Improved flow-based formulations for the skiving stock problem
Year of publication: |
2020
|
---|---|
Authors: | Martinovic, John ; Delorme, M. ; Iori, M. ; Scheithauer, Guntram ; Strasdat, N. |
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. 113.2020, p. 1-18
|
Subject: | Arcflow model | Cutting and packing | Integer linear programs | Skiving stock problem | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Operations Research | Operations research | Packproblem | Packing problem | Ganzzahlige Optimierung | Integer programming |
-
Martinovic, J., (2018)
-
Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
Martinovic, John, (2021)
-
The meet-in-the-middle principle for cutting and packing problems
Côté, Jean-François, (2018)
- More ...
-
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, (2021)
-
Cutting stock problems with nondeterministic item lengths : a new approach to server consolidation
Martinovic, John, (2019)
- More ...