Heuristics for the strip packing problem with unloading constraints
From MaRDI portal
Publication:340305
DOI10.1016/J.COR.2012.11.003zbMATH Open1349.90879OpenAlexW1983494426MaRDI QIDQ340305FDOQ340305
Authors: Jefferson L. M. da Silveira, Flávio K. Miyazawa, Eduardo C. 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
Recommendations
- Two dimensional strip packing with unloading constraints
- Two-dimensional strip packing with unloading constraints
- An open space based heuristic for the 2D strip packing problem with unloading constraints
- Two dimensional knapsack with unloading constraints
- A note on a two dimensional knapsack problem with unloading constraints
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Cited In (12)
- An open space based heuristic for the 2D strip packing problem with unloading constraints
- The value of integrating loading and routing
- A note on a two dimensional knapsack problem with unloading constraints
- A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands
- Metaheuristics for truck loading in the car production industry
- An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
- Two dimensional strip packing with unloading constraints
- Two dimensional knapsack with unloading constraints
- 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
- Two-dimensional strip packing with unloading constraints
This page was built for publication: Heuristics for the strip packing problem with unloading constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340305)