A polynomial time OPT + 1 algorithm for the cutting stock problem with a constant number of object lengths
Year of publication: |
2011
|
---|---|
Authors: | Jansen, Klaus ; Solis-Oba, Roberto |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 36.2011, 4, p. 743-753
|
Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Packproblem | Packing problem |
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
-
An iterated greedy algorithm for the planning of yarn-dyeing boilers
Demir, Yunus, (2024)
-
Exact approaches for the unconstrained two-dimensional cutting problem with defects
Zhang, Hao, (2023)
- More ...
-
Approximation schemes for job shop scheduling problems with controllable processing times
Jansen, Klaus, (2005)
-
Jansen, Klaus, (2011)
-
Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
Jansen, Klaus, (2001)
- More ...