A space-indexed formulation of packing boxes into a larger box
From MaRDI portal
Publication:433833
DOI10.1016/j.orl.2011.10.008zbMath1242.90106arXiv2101.00441OpenAlexW2142331260MaRDI QIDQ433833
Jakub Mareček, Sam D. Allen, Edmund Kieran Burke
Publication date: 6 July 2012
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.00441
Related Items (5)
A data-driven approach for mixed-case palletization with support ⋮ A MIP-based slicing heuristic for three-dimensional bin packing ⋮ Exploiting Packing Components in General-Purpose Integer Programming Solvers ⋮ Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems ⋮ A comparative review of 3D container loading algorithms
Uses Software
Cites Work
- Unnamed Item
- A hybrid placement strategy for the three-dimensional strip packing problem
- On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
- Hardness of approximation for orthogonal rectangle packing and covering problems
- An analytical model for the container loading problem
- A time indexed formulation of non-preemptive single machine scheduling problems
- Packing small boxes into a big box.
- Three-dimensional container loading models with cargo stability and load bearing constraints
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
- Conflict analysis in mixed integer programming
- Probabilistic Analysis of Geometric Location Problems
- Worst-Case and Probabilistic Analysis of a Geometric Location Problem
This page was built for publication: A space-indexed formulation of packing boxes into a larger box