Theoretical Papers - Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
| Year of publication: |
2001
|
|---|---|
| Authors: | Scheithauer, G. ; Terno, J. ; Müller, A. ; Belov, G. |
| Published in: |
Journal of the Operational Research Society : OR. - Basingstoke, Hampshire : Palgrave, ISSN 0030-3623, ZDB-ID 7160331. - Vol. 52.2001, 12, p. 1390-1401
|
Saved in:
Saved in favorites
Similar items by person
-
The modified integer round-up property of the one-dimensional cutting stock problem
Scheithauer, G., (1995)
-
The solution of two-stage guillotine cutting stock problems having extremely varying order demands
Riehme, J., (1996)
-
The G4-heuristic for the pallet loading problem
Scheithauer, G., (1996)
- More ...