A block-building constraint programming model for the container loading problem
From MaRDI portal
Cites work
- A comparative review of 3D container loading algorithms
- A global optimization approach for solving three-dimensional open dimension rectangular packing problems
- A linear programming approach for the three-dimensional bin-packing problem
- A MIP approach for some practical packing problems: balancing constraints and tetris-like items
- A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
- A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
- A two-phase approach for single container loading with weakly heterogeneous boxes
- An analytical model for the container loading problem
- An improved typology of cutting and packing problems
- Constraints in container loading -- a state-of-the-art review
- Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
- Instance space analysis for 2D bin packing mathematical models
- Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
- Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
- Solving the three-dimensional open-dimension rectangular packing problem: a constraint programming model
- The exact solutions of several types of container loading problems
- The Three-Dimensional Bin Packing Problem
- Three-dimensional container loading models with cargo stability and load bearing constraints
- VCS: A new heuristic function for selecting boxes in the single container loading problem
- Weight distribution considerations in container loading
This page was built for publication: A block-building constraint programming model for the container loading problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6931526)
