An Improvement of Previously Known Upper Bound of Multiple Strip Packing Problem and Probabilistic Analysis of Algorithm in Case of Large Number of Strips Given

Proceedings of the Institute for System Programming of the RAS
doi 10.15514/ispras-2018-31(1)-9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute for System Programming of the Russian Academy of Sciences

Related search

A Harmonic Algorithm for the 3D Strip Packing Problem

SIAM Journal on Computing
MathematicsComputer Science
2013English

An Improved Heuristic Recursive Strategy Based on Genetic Algorithm for the Strip Rectangular Packing Problem

Zidonghua Xuebao/Acta Automatica Sinica
ControlSystems EngineeringComputer GraphicsInformation SystemsComputer-Aided DesignSoftware
2007English

An Upper Bound for the Number of Odd Multiperfect Numbers

Bulletin of the Australian Mathematical Society
Mathematics
2013English

An Upper Bound on the Double Domination Number of Trees

Kragujevac Journal of Mathematics
Mathematics
2015English

An Upper Bound for the Chromatic Number of Line Graphs

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2007English

An Adaptive Genetic Algorithm for 2D Packing Problem

Modern Applied Science
2010English

An Upper Bound to the Number of Conjugacy Classes of Non-Abelian Nilpotent Groups

Journal of Mathematics and Statistics
MathematicsStatisticsProbability
2017English

Yukawa Bound States of a Large Number of Fermions

Journal of High Energy Physics
High Energy PhysicsNuclear
2015English

An Upper Bound on the Total Outer-Independent Domination Number of a Tree

Opuscula Mathematica
Mathematics
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy