A general purpose algorithm for three-dimensional packing
From MaRDI portal
Publication:2890477
Recommendations
- 3-D container packing heuristics
- An Efficient Algorithm for Solving the Container Loading Problem
- A tree search algorithm for solving the container loading problem
- Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem
- A heuristic for the three-dimensional strip packing problem
Cited in
(32)- scientific article; zbMATH DE number 2205697 (Why is no real title available?)
- Heuristic algorithms for on-line packing in three dimensions
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- Lower bounds for three-dimensional multiple-bin-size bin packing problems
- The distributor's three-dimensional pallet-packing problem: a human intelligence-based heuristic approach
- A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
- A tree search algorithm for solving the container loading problem
- A multi-level tree search algorithm for three dimensional container loading problem
- SIMULTANEOUS PACKING AND COVERING IN THREE–DIMENSIONAL EUCLIDEAN SPACE
- A comparative review of 3D container loading algorithms
- Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem
- A heuristic approach to the three-dimensional cargo-loading problem
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
- On the three-dimensional container packing problem under home delivery service
- Space and time allocation in a shipyard assembly hall
- Constraints in container loading -- a state-of-the-art review
- A computer-based heuristic for packing pooled shipment containers
- An efficient placement heuristic for three-dimensional rectangular packing
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
- A global optimization algorithm for the three-dimensional packing problem
- A new heuristic algorithm for cuboids packing with no orientation constraints
- A heuristic algorithm for three-dimensional container loading problem with non-identical items
- A recursion heuristic algorithm for cylinder objects loading problem
- scientific article; zbMATH DE number 3990764 (Why is no real title available?)
- A cost-efficient method to optimize package size in emerging markets
- scientific article; zbMATH DE number 773158 (Why is no real title available?)
- AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS
- An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
- Approximate algorithms for the container loading problem
- Three-stage heuristic algorithm for three-dimensional irregular packing problem
- 3-D container packing heuristics
- An Efficient Algorithm for Solving the Container Loading Problem
This page was built for publication: A general purpose algorithm for three-dimensional packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890477)