A particular approach for the three-dimensional packing problem with additional constraints
From MaRDI portal
(Redirected from Publication:976016)
Recommendations
- 3-D container packing heuristics
- AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS
- A heuristic for the three-dimensional strip packing problem
- A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
- Heuristic algorithms for the three-dimensional bin packing problem
Cites work
- A greedy search for the three-dimensional bin packing problem: the packing static stability case
- An analytical model for the container loading problem
- Extreme point-based heuristics for three-dimensional bin packing
- Guided local search for the three-dimensional bin-packing problem
- Packing small boxes into a big box.
- The Three-Dimensional Bin Packing Problem
Cited in
(22)- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
- A comparative review of 3D container loading algorithms
- Constraint programming approach for spatial packaging problem
- A three-dimensional bin packing problem with item fragmentation and its application in the storage location assignment problem
- A matheuristic framework for the three-dimensional single large object placement problem with practical constraints
- Approximated solutions to a 3D-packing MIP model by a non-linear approach
- A MIP-based slicing heuristic for three-dimensional bin packing
- An efficient method for the three-dimensional container loading problem by forming box sizes
- The pallet loading problem: three-dimensional bin packing with practical constraints
- Constraints in container loading -- a state-of-the-art review
- The exact solutions of several types of container loading problems
- scientific article; zbMATH DE number 3990764 (Why is no real title available?)
- Solving packing problems by a distributed global optimization algorithm
- AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS
- A global optimization approach for solving three-dimensional open dimension rectangular packing problems
- A fast heuristic for a three-dimensional non-convex domain loading problem
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- Container packing problem with balance constraints
- A hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem
This page was built for publication: A particular approach for the three-dimensional packing problem with additional constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976016)