Oriented aligned rectangle packing problem

DOI10.1016/0377-2217(92)90249-9zbMath0761.90081OpenAlexW2076005816MaRDI QIDQ1196022

Pankaj K. Agarwal, Man-tak Shing

Publication date: 4 January 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90249-9

zbMATH Keywords

two-dimensional bin-packingmodule placementoriented aligned rectangle packing

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

Applying genetic algorithms and neural networks to the container loading problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bounds for on-line two-dimensional packing algorithms
• On packing squares with equal squares
• Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
• Shelf Algorithms for Two-Dimensional Packing Problems
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Orthogonal Packings in Two Dimensions
• Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms
• A algorithm for two-dimensional packing
• On Packing Two-Dimensional Bins

This page was built for publication: Oriented aligned rectangle packing problem