Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
Year of publication: |
2021
|
---|---|
Authors: | Martinovic, John ; Strasdat, N. ; Selch, M. |
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. 132.2021, p. 1-26
|
Subject: | Cutting and packing | Fire-ups | Integer programming | Reduction methods | Temporal bin packing problem | Packproblem | Packing problem | Ganzzahlige Optimierung | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Heuristik | Heuristics | Operations Research | Operations research | Algorithmus | Algorithm |
-
Models and algorithms for the bin-packing problem with minimum color fragmentation
Mehrani, Saharnaz, (2022)
-
A semi-continuous MIP model for the irregular strip packing problem
Leao, Aline A. S., (2016)
-
A clique covering MIP model for the irregular strip packing problem
Rodrigues, Marcos Okamura, (2017)
- More ...
-
Improved flow-based formulations for the skiving stock problem
Martinovic, John, (2020)
-
Mathematical models and approximate solution approaches for the stochastic bin packing problem
Martinovic, John, (2021)
-
Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups
Martinovic, John, (2023)
- More ...