Two-dimensional strip packing with unloading constraints
From MaRDI portal
Publication:2448886
DOI10.1016/j.dam.2013.08.019zbMath1311.68192OpenAlexW2173177713MaRDI QIDQ2448886
Jefferson L. M. da Silveira, Flávio K. Miyazawa, Eduardo Candido Xavier
Publication date: 5 May 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.08.019
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (7)
A hybrid algorithm based on variable neighbourhood for the strip packing problem ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ Cargo securing under multi-drop and axle weight constraints ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem ⋮ An open space based heuristic for the 2D strip packing problem with unloading constraints
Cites Work
- Heuristics for the strip packing problem with unloading constraints
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- MIP-based approaches for the container loading problem with multi-drop constraints
- On Three-Dimensional Packing
- On Two Dimensional Packing
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- On packing of squares and cubes
This page was built for publication: Two-dimensional strip packing with unloading constraints
