Multi-dimensional bin packing problems with guillotine constraints

DOI10.1016/j.cor.2010.01.017zbMath1188.90206OpenAlexW2043649866WikidataQ58826403 ScholiaQ58826403MaRDI QIDQ976021

David Pisinger, Rasmus Resen Amossen

Publication date: 11 June 2010

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

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

zbMATH Keywords

packingconstraint programmingcutting

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Liner shipping network design with deadlines ⋮ A novel non-linear approach to minimal area rectangular packing ⋮ An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts ⋮ A MIP-based slicing heuristic for three-dimensional bin packing ⋮ An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem ⋮ Scheduling inspired models for two-dimensional packing problems ⋮ A comparative review of 3D container loading algorithms ⋮ Constraints in container loading -- a state-of-the-art review

Uses Software

• Algorithm 864

Cites Work

• Unnamed Item
• A survey of dual-feasible and superadditive functions
• An analytical model for the container loading problem
• An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
• Exact algorithms for the guillotine strip cutting/packing problem.
• A comparative numerical analysis for the guillotine two-dimensional cutting problem
• A new constraint programming approach for the orthogonal packing problem
• Sweep synchronization as a global propagation mechanism
• The two-dimensional bin packing problem with variable bin sizes and costs
• A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
• Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
• Decomposition Principle for Linear Programs
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• One-dimensional relaxations and LP bounds for orthogonal packing
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• An Algorithm for Two-Dimensional Cutting Problems
• Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
• The Three-Dimensional Bin Packing Problem
• A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing

This page was built for publication: Multi-dimensional bin packing problems with guillotine constraints