Creating worst-case instances for lower bounds of the 2D strip packing problem

DOI10.1007/978-3-319-55702-1_15zbMATH Open1375.90246OpenAlexW2738202274MaRDI QIDQ4596449FDOQ4596449

Authors: Torsten Buchwald, Guntram Scheithauer 

Publication date: 1 December 2017

Published in: Operations Research Proceedings 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-55702-1_15

Recommendations

• Creating worst-case instances for upper and lower bounds of the two-dimensional strip packing problem
• Models and bounds for two-dimensional level packing problems
• An exact algorithm for the two-dimensional strip-packing problem
• Improved Lower Bound for Online Strip Packing
• A branch and bound algorithm for the strip packing problem

Mathematics Subject Classification ID

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

Cited In (1)

• Creating worst-case instances for upper and lower bounds of the two-dimensional strip packing problem

This page was built for publication: Creating worst-case instances for lower bounds of the 2D strip packing problem

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