Optimal Rectangle Packing: An Absolute Placement Approach

DOI10.1613/jair.3735zbMath1261.68092arXiv1402.0557OpenAlexW1559424388MaRDI QIDQ4907833

Richard E. Korf, Eric Huang

Publication date: 25 February 2013

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.0557

zbMATH Keywords

optimal solutionrectangle packingperfect packing problem

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (8)

Optimized location of light sources to cover a rectangular region ⋮ Scheduling under the network of temporo-spatial proximity relationships ⋮ Packing unequal rectangles and squares in a fixed size circular container using formulation space search ⋮ A new search procedure for the two-dimensional orthogonal packing problem ⋮ Packing a rectangle with m x (m + 1) rectangles ⋮ Parameterized complexity of strip packing and minimum volume packing ⋮ Handling precedence constraints in scheduling problems by the sequence pair representation ⋮ Stabilized branch-and-price algorithms for vector packing problems

This page was built for publication: Optimal Rectangle Packing: An Absolute Placement Approach