A clique covering MIP model for the irregular strip packing problem
| Year of publication: |
November 2017
|
|---|---|
| Authors: | Rodrigues, Marcos Okamura ; Toledo, Franklina Maria Bragion de |
| 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. 87.2017, p. 221-234
|
| Subject: | Cutting and packing | Irregular strip packing problem | Clique covering | Mixed integer programming | Packproblem | Packing problem | Ganzzahlige Optimierung | Integer programming | Operations Research | Operations research | Algorithmus | Algorithm | Theorie | Theory | Heuristik | Heuristics |
-
A semi-continuous MIP model for the irregular strip packing problem
Leao, Aline A. S., (2016)
-
Kimms, Alf, (2023)
-
Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
Martinovic, John, (2021)
- More ...
-
Ferreira, Kamyla Maria, (2024)
-
Network scheduling problem with cross-docking and loading constraints
Castellucci, Pedro B., (2021)
-
Robust mixed-integer linear programming models for the irregular strip packing problem
Cherri, Luiz H., (2016)
- More ...