Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing

DOI10.1016/j.cor.2011.03.011zbMath1251.90236OpenAlexW2111448234MaRDI QIDQ1761965

Thiago A. De Queiroz, Flávio K. Miyazawa, Yoshiko Wakabayashi, Eduardo Candido Xavier

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.03.011

zbMATH Keywords

column generationstrip packingguillotine cuttingthree-dimensional cutting stockunbounded knapsack

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (12)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts ⋮ The container loading problem with cargo stability: a study on support factors, mechanical equilibrium and grids ⋮ A space-indexed formulation of packing boxes into a larger box ⋮ Exploiting Packing Components in General-Purpose Integer Programming Solvers ⋮ Order and static stability into the strip packing problem ⋮ Grids for cutting and packing problems: a study in the 2D knapsack problem ⋮ Practical constraints in the container loading problem: comprehensive formulations and exact algorithm ⋮ Upper bounds for heuristic approaches to the strip packing problem ⋮ The exact solutions of several types of container loading problems ⋮ On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns ⋮ Constraints in container loading -- a state-of-the-art review

Uses Software

• COIN-OR

Cites Work

• Unnamed Item
• Unnamed Item
• An on-line algorithm for multidimensional bin packing
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
• Three-dimensional packings with rotations
• Exact algorithms for the guillotine strip cutting/packing problem.
• A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
• Models and bounds for two-dimensional level packing problems
• Models and algorithms for three-stage two-dimensional bin packing
• A note on the approximability of cutting stock problems
• A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
• An Exact Approach to the Strip-Packing Problem
• A Linear Programming Approach to the Cutting-Stock Problem
• On strip packing With rotations
• An asymptotic approximation algorithm for 3D-strip packing
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• On Packing Two-Dimensional Bins
• Loading Multiple Pallets
• An effective recursive partitioning approach for the packing of identical rectangles in a rectangle
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Multistage Cutting Stock Problems of Two and More Dimensions
• Recursive Computational Procedure for Two-dimensional Stock Cutting

This page was built for publication: Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing