A MIP-based slicing heuristic for three-dimensional bin packing
From MaRDI portal
Publication:1686545
Recommendations
- A data-driven approach for mixed-case palletization with support
- The pallet loading problem: three-dimensional bin packing with practical constraints
- A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
- A systematic approach for the three-dimensional palletization problem
- A particular approach for the three-dimensional packing problem with additional constraints
Cites work
- A Genetic Algorithm for Solving the Container Loading Problem
- A comparative review of 3D container loading algorithms
- A global optimization algorithm for the three-dimensional packing problem
- A maximal-space algorithm for the container loading problem
- A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
- A prototype column generation strategy for the multiple container loading problem
- A space-indexed formulation of packing boxes into a larger box
- An analytical model for the container loading problem
- An effective tabu search approach with improved loading algorithms for the 3L-CVRP
- An improved typology of cutting and packing problems
- Constraints in container loading -- a state-of-the-art review
- Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
- Extreme point-based heuristics for three-dimensional bin packing
- Guided local search for the three-dimensional bin-packing problem
- Heuristic algorithms for the three-dimensional bin packing problem
- Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem
- MIP-based approaches for the container loading problem with multi-drop constraints
- Multi-dimensional bin packing problems with guillotine constraints
- Neighborhood structures for the container loading problem: a VNS implementation
- Optimal facility layout design
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- The Three-Dimensional Bin Packing Problem
- Three-dimensional bin packing problem with variable bin height
- Three-dimensional packing of items with limited load bearing strength
- Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem
Cited in
(6)- The exact solutions of several types of container loading problems
- Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
- The master bay plan problem: a solution method based on its connection to the three-dimensional bin packing problem
- A data-driven approach for mixed-case palletization with support
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- Mathematical modeling and heuristic solutions for container loading and routing problem: a case study in a cable manufacturing company
This page was built for publication: A MIP-based slicing heuristic for three-dimensional bin packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1686545)
