Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem
From MaRDI portal
Publication:1330560
DOI10.1016/0377-2217(94)90212-7zbMath0803.90105OpenAlexW2087186919MaRDI QIDQ1330560
Bidhu B. Mohanty, Kamlesh Mathur, Nancy J. Ivancic
Publication date: 3 January 1995
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90212-7
heuristic algorithmthree-dimensional bin packingcolumn generation subproblemfractional knapsack problem
Related Items (8)
A 3D-BPP approach for optimising stowage plans and terminal productivity ⋮ A data-driven approach for mixed-case palletization with support ⋮ A MIP-based slicing heuristic for three-dimensional bin packing ⋮ Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems ⋮ Layout optimization for the objects located within a rotating vessel -- a three-dimensional packing problem with behavioral constraints ⋮ A comparative review of 3D container loading algorithms ⋮ The exact solutions of several types of container loading problems ⋮ Constraints in container loading -- a state-of-the-art review
Cites Work
- Unnamed Item
- A comparative evaluation of heuristics for container loading
- A computer-based heuristic for packing pooled shipment containers
- Load planning for shipments of low density products
- On Three-Dimensional Packing
- A heuristic approach to the three-dimensional cargo-loading problem
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- Fractional knapsack problems
This page was built for publication: Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem
