Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
From MaRDI portal
Publication:2003558
Recommendations
- A comparative review of 3D container loading algorithms
- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
- Exact solution techniques for two-dimensional cutting and packing
- The Three-Dimensional Bin Packing Problem
- A matheuristic framework for the three-dimensional single large object placement problem with practical constraints
Cites work
- 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems
- A beam search approach to the container loading problem
- 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 maximal-space algorithm for the container loading problem
- A MIP approach for some practical packing problems: balancing constraints and tetris-like items
- A MIP-based slicing heuristic for three-dimensional bin packing
- A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- A space-indexed formulation of packing boxes into a larger box
- A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
- An analytical model for the container loading problem
- An efficient placement heuristic for three-dimensional rectangular packing
- An improved typology of cutting and packing problems
- Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
- The Three-Dimensional Bin Packing Problem
- Three-dimensional container loading models with cargo stability and load bearing constraints
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem
Cited in
(24)- Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
- Effective loading in combined vehicle routing and container loading problems
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- A matheuristic framework for the three-dimensional single large object placement problem with practical constraints
- Extracting maximal objects from three-dimensional solid materials
- A new dynamic shape adjustment and placement algorithm for 3D yard allocation problem with time dimension
- Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer
- Cutting and packing problems under uncertainty: literature review and classification framework
- Airfreight forwarder's shipment planning: shipment consolidation and containerization
- A large neighbourhood search algorithm for solving container loading problems
- Modeling soft unloading constraints in the multi-drop container loading problem
- Solving the three-dimensional open-dimension rectangular packing problem: a constraint programming model
- A two-phase constructive algorithm for the single container mix-loading problem
- Mathematical modeling and heuristic solutions for container loading and routing problem: a case study in a cable manufacturing company
- A block-building constraint programming model for the container loading problem
- Static stability versus packing efficiency in online three-dimensional packing problems: a new approach and a computational study
- Solving the parallel processor scheduling and bin packing problems with contiguity constraints: mathematical models and computational studies
- Two-phase matheuristic for assignment and truck loading problems
- A three-dimensional spatial resource-constrained project scheduling problem: model and heuristic
- Mixed-integer linear programming models for 3D irregular strip packing problems
- A tree search-based heuristic for the three-dimensional single container loading problem
- Improved approximation algorithms for three-dimensional knapsack
- Heuristics for the three-dimensional multiple bin size bin packing problem with transportation constraints
This page was built for publication: Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003558)
