Multiple Container Packing: A Case Study of Pipe Packing
From MaRDI portal
Publication:5285353
Recommendations
- A bottleneck assignment approach to the multiple container loading problem
- A heuristic for multiple container loading problems
- A general purpose algorithm for three-dimensional packing
- scientific article; zbMATH DE number 3945878
- Loading problem in multiple containers and pallets using strategic search method
Cited in
(13)- Integer programming formulations for approximate packing circles in a rectangular container
- A probability collectives approach for multi-agent distributed and cooperative optimization with tolerance for agent failure
- Multiproduct cycling with packaging in the process industry
- Three-stage heuristic algorithm for three-dimensional irregular packing problem
- The multiple container loading problem with preference
- Solving circle packing problems by global optimization: numerical results and industrial applications
- A dual-response forwarding approach for containerizing air cargoes under uncertainty, based on stochastic mixed 0-1 programming
- Approximate packing: integer programming models, valid inequalities and nesting
- A bottleneck assignment approach to the multiple container loading problem
- Three-dimensional bin packing problem with variable bin height
- Packing circular-like objects in a rectangular container
- Effective methods for a container packing operation
- Loading problem in multiple containers and pallets using strategic search method
This page was built for publication: Multiple Container Packing: A Case Study of Pipe Packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5285353)