Heuristics for the strip packing problem with unloading constraints
From MaRDI portal
(Redirected from Publication:340305)
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
Cited in
(12)- The value of integrating loading and routing
- An open space based heuristic for the 2D strip packing problem with unloading constraints
- 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
- An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
- Metaheuristics for truck loading in the car production industry
- 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)