Multi-dimensional bin packing problems with guillotine constraints

DOI10.1016/J.COR.2010.01.017MaRDI QIDQ976021zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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

constraint programmingpackingcutting

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints
• A heuristic for solving large bin packing problems in two and three dimensions
• An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts
• A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
• Guillotineable bin packing: A genetic approach

Cites work

• scientific article; zbMATH DE number 2084718 (Why is no real title available?)
• A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
• A comparative numerical analysis for the guillotine two-dimensional cutting problem
• A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
• A new constraint programming approach for the orthogonal packing problem
• A survey of dual-feasible and superadditive functions
• An Algorithm for Two-Dimensional Cutting Problems
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• An analytical model for the container loading problem
• An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
• Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Decomposition Principle for Linear Programs
• Exact algorithms for the guillotine strip cutting/packing problem.
• One-dimensional relaxations and LP bounds for orthogonal packing
• Sweep synchronization as a global propagation mechanism
• The Three-Dimensional Bin Packing Problem
• The two-dimensional bin packing problem with variable bin sizes and costs
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
• Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem

Cited in

(9)

• An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts
• A comparative review of 3D container loading algorithms
• A MIP-based slicing heuristic for three-dimensional bin packing
• A novel non-linear approach to minimal area rectangular packing
• Constraints in container loading -- a state-of-the-art review
• Scheduling inspired models for two-dimensional packing problems
• A beam search approach to solve the convex irregular bin packing problem with guillotine guts
• Liner shipping network design with deadlines
• An exact algorithm for the two-dimensional stage-unrestricted guillotine cutting/packing decision problem

Describes a project that uses

Uses Software

• Algorithm 864

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

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