Heuristic for the rectangular strip packing problem with rotation of items
From MaRDI portal
(Redirected from Publication:340330)
Recommendations
- A heuristic algorithm for the non-oriented 2D rectangular strip packing problem
- A new heuristic recursive algorithm for the strip rectangular packing problem
- Heuristics for the two-dimensional irregular bin packing problem with limited rotations
- A heuristic for the three-dimensional strip packing problem
- On strip packing with rotations
- A recursive heuristic algorithm for 2D rectangular strip packing problems
- Heuristics for the score-constrained strip-packing problem
- Heuristic algorithm for the rectangular packing problem with static non-equilibrium constraint
Cited in
(8)- scientific article; zbMATH DE number 19811 (Why is no real title available?)
- Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns
- Upper bounds for heuristic approaches to the strip packing problem
- An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
- An EDA for the 2D knapsack problem with guillotine constraint
- Sequential heuristic for the two-dimensional bin-packing problem
- Exact and approximate methods for the score-constrained packing problem
- A block-based layer building approach for the 2D guillotine strip packing problem
This page was built for publication: Heuristic for the rectangular strip packing problem with rotation of items
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340330)