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 |
-
A review of methods and algorithms for optimizing construction scheduling
Zhou, J., (2013)
-
A polyhedral description of kernels
Chen, Qin, (2016)
-
On the query complexity of Black-Peg AB-mastermind
Ouali, Mourad el, (2018)
- More ...
-
Approximation schemes for job shop scheduling problems with controllable processing times
Jansen, Klaus, (2005)
-
Jansen, Klaus, (2011)
-
Grundlagen der Tarifpolitik bei der Deutschen Bundespost
Jansen, Klaus, (1968)
- More ...