Two-dimensional rectangle packing: On-line methods and results

DOI10.1016/0166-218X(93)90009-DzbMath0786.90055OpenAlexW2113707630MaRDI QIDQ1309806

J. B. G. Frenk, Martine Labbé, János A. Csirik

Publication date: 9 January 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(93)90009-d

zbMATH Keywords

heuristicsasymptotic worst- case ratioson-line two-dimensional rectangle packing

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (12)

On two dimensional packing ⋮ Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing ⋮ Drawer algorithms for 1-space bounded multidimensional hyperbox packing ⋮ Efficient 1-space bounded hypercube packing algorithm ⋮ Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing ⋮ Online bin packing of squares and cubes ⋮ Bounds for online bounded space hypercube packing ⋮ An on-line algorithm for multidimensional bin packing ⋮ Online bin packing of squares and cubes ⋮ Two-dimensional online bin packing with rotation ⋮ Online strip packing with modifiable boxes ⋮ A lower bound for online rectangle packing

Cites Work

• Multidimensional on-line bin packing: Algorithms and worst-case analysis
• A lower bound for on-line bin packing
• On Packing Two-Dimensional Bins
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

This page was built for publication: Two-dimensional rectangle packing: On-line methods and results