Upper bounds for heuristic approaches to the strip packing problem

DOI10.1007/978-3-319-28697-6_10zbMATH Open1346.90694OpenAlexW2574125426MaRDI QIDQ2806895FDOQ2806895

Authors: Torsten Buchwald, Guntram Scheithauer 

Publication date: 19 May 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-319-28697-6_10

Recommendations

• Upper bounds for heuristic approaches to the strip packing problem
• A heuristic for the three-dimensional strip packing problem
• Heuristic algorithms for on-line packing in three dimensions
• GENERALIZED FIRST-FIT ALGORITHMS IN TWO AND THREE DIMENSIONS
• On Three-Dimensional Packing

zbMATH Keywords

upper boundthree-dimensional caselayer-relaxation

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• A Strip-Packing Algorithm with Absolute Performance Bound 2
• Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem

Cited In (3)

• Creating worst-case instances for upper and lower bounds of the two-dimensional strip packing problem
• Upper bounds for heuristic approaches to the strip packing problem
• An improved best-fit heuristic for the orthogonal strip packing problem

This page was built for publication: Upper bounds for heuristic approaches to the strip packing problem

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