Upper bounds for heuristic approaches to the strip packing problem

DOI10.1111/itor.12100zbMath1338.90333OpenAlexW2112191836MaRDI QIDQ2803257

Torsten Buchwald, Guntram Scheithauer

Publication date: 4 May 2016

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12100

zbMATH Keywords

performance ratiocutting and packingstrip packing problem

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• An effective shaking procedure for 2D and 3D strip packing problems
• An exact strip packing algorithm based on canonical forms
• Heuristic for the rectangular strip packing problem with rotation of items
• A skyline heuristic for the 2D rectangular packing and strip packing problems
• Relations between capacity utilization, minimal bin size and bin number
• A squeaky wheel optimisation methodology for two-dimensional strip packing
• A general framework for bounds for higher-dimensional orthogonal packing problems.
• An efficient placement heuristic for three-dimensional rectangular packing
• The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
• New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
• Spatial representation and reasoning for robot mapping. A shape-based approach
• Reactive GRASP for the strip-packing problem
• A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
• A branch and bound algorithm for the strip packing problem
• Exact algorithms for the two-dimensional strip packing problem with and without rotations
• New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
• Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
• Two-dimensional packing problems: a survey
• A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
• An Exact Approach to the Strip-Packing Problem
• An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
• One-dimensional relaxations and LP bounds for orthogonal packing
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Orthogonal Packings in Two Dimensions
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• A Strip-Packing Algorithm with Absolute Performance Bound 2
• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem

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