One-dimensional stock cutting resilient against singular random defects
Year of publication: |
2023
|
---|---|
Authors: | Arbib, Claudio ; Marinelli, Fabrizio ; Pferschy, Ulrich ; Ranjbar, Fatemeh K. |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 157.2023, p. 1-14
|
Subject: | Cutting stock | Bin packing | Recoverable defects | Dynamic programming | Mixed integer programming | Packproblem | Packing problem | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Dynamische Optimierung |
-
Durak, Bahadır, (2017)
-
Exact approaches for the unconstrained two-dimensional cutting problem with defects
Zhang, Hao, (2023)
-
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
Furini, Fabio, (2017)
- More ...
-
An LP-based tabu search for batch scheduling in a cutting process with finite buffers
Arbib, Claudio, (2012)
-
Arbib, Claudio, (2005)
-
Arbib, Claudio, (2003)
- More ...