A fast and scalable deepest-left-bottom-fill algorithm to solve irregular 3D cutting and packing problems using a semi-discrete representation
| Year of publication: |
2025
|
|---|---|
| Authors: | Chehrazad, Sahar ; Roose, Dirk ; Wauters, Tony |
| Published in: |
International journal of production research. - London [u.a.] : Taylor & Francis, ISSN 1366-588X, ZDB-ID 1485085-0. - Vol. 63.2025, 18, p. 6606-6629
|
| Subject: | Cutting and packing | deepest-left-bottom-fill algorithm | geometry | parallelisation | semi-discrete representation | Theorie | Theory | Algorithmus | Algorithm | Packproblem | Packing problem | Operations Research | Operations research | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics |
-
Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
Martinovic, John, (2021)
-
An introduction to stochastic bin packing-based server consolidation with conflicts
Martinovic, John, (2022)
-
A clique covering MIP model for the irregular strip packing problem
Rodrigues, Marcos Okamura, (2017)
- More ...
-
Chehrazad, Sahar, (2022)
-
Dispatch and conflict-free routing of capacitated vehicles with storage stack allocation
Thanos, Emmanouil, (2021)
-
Extracting maximal objects from three-dimensional solid materials
Silva, Everton Fernandes, (2021)
- More ...