Heuristics for the two-dimensional irregular bin packing problem with limited rotations
From MaRDI portal
Publication:6068729
DOI10.1016/j.cor.2023.106398MaRDI QIDQ6068729
Ek Peng Chew, Loo Hay Lee, Haobin Li, Jie Deng, Sifan Cai
Publication date: 13 November 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- Robust mixed-integer linear programming models for the irregular strip packing problem
- An effective heuristic for the two-dimensional irregular bin packing problem
- Algorithms for nesting with defects
- Complete and robust no-fit polygon generation for the irregular stock cutting problem
- Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet
- The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
- A clique covering MIP model for the irregular strip packing problem
- A customized branch-and-bound approach for irregular shape nesting
- Matheuristics for the irregular bin packing problem with free rotations
- Packing of concave polyhedra with continuous rotations using nonlinear optimisation
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts
- Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations
- Irregular packing problems: a review of mathematical models
- Raster penetration map applied to the irregular packing problem
- An improved typology of cutting and packing problems
- An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations
- A tutorial in irregular shape packing problems
- Decomposition Algorithm for Irregular Placement Problems
This page was built for publication: Heuristics for the two-dimensional irregular bin packing problem with limited rotations
