Performance Bound for Bottom-Left Guillotine Packing of Rectangles

DOI10.1057/JORS.1992.21zbMATH Open0751.90061OpenAlexW2089958820MaRDI QIDQ4006908FDOQ4006908

Authors: Mahesh Girkar, Bruce MacLeod, Robert Moll 

Publication date: 27 September 1992

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1992.21

Recommendations

• scientific article; zbMATH DE number 4198016
• An optimal algorithm for rectangle placement
• On Two Dimensional Packing
• On two dimensional packing

zbMATH Keywords

bottom-left guillotine placement of rectanglesworst case performance bound

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cited In (1)

• New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems

This page was built for publication: Performance Bound for Bottom-Left Guillotine Packing of Rectangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4006908)