Upper bounds for the homogeneous case of a two-dimensional packing problem

DOI10.1007/BF01415959zbMath0728.90074OpenAlexW2002789999MaRDI QIDQ3352854

H. Exeler

Publication date: 1991

Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01415959

zbMATH Keywords

packingnon-convex minimizationpiecewise linear problemupper bound of the maximal number of packed units

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

How to use structural constraints to compute an upper bound for the pallet loading problem, Analysis of upper bounds for the pallet loading problem, The pallet loading problem: a review of solution methods and computational experiments

Cites Work

• Unnamed Item
• Determining an upper bound for a class of rectangular packing problems
• Packing the maximum number of \(m\times n\) tiles in a large \(p\times q\) rectangle
• Generating Pallet Loading Patterns: A Special Case of the Two-Dimensional Cutting Stock Problem
• A Note on the Two-Dimensional Rectangular Cutting-Stock Problem