Heuristics for the strip packing problem with unloading constraints
From MaRDI portal
Publication:340305
DOI10.1016/j.cor.2012.11.003zbMath1349.90879OpenAlexW1983494426MaRDI QIDQ340305
Jefferson L. M. da Silveira, Flávio K. Miyazawa, Eduardo Candido Xavier
Publication date: 14 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.11.003
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (8)
The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ Exact and approximate methods for the score-constrained packing problem ⋮ Cargo securing under multi-drop and axle weight constraints ⋮ Metaheuristics for truck loading in the car production industry ⋮ Two-dimensional strip packing with unloading constraints ⋮ The value of integrating loading and routing ⋮ 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
This page was built for publication: Heuristics for the strip packing problem with unloading constraints
