Models and algorithms for the bin-packing problem with minimum color fragmentation
Year of publication: |
2022
|
---|---|
Authors: | Mehrani, Saharnaz ; Cardonha, Carlos ; Bergman, David |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 34.2022, 2, p. 1070-1085
|
Subject: | bin packing | branch and price | decision diagrams | integer programming | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Packproblem | Packing problem | Algorithmus | Algorithm | Heuristik | Heuristics | Operations Research | Operations research |
-
Kim, Kyungdoc, (2014)
-
Irregular packing problems : a review of mathematical models
Leao, Aline A. S., (2020)
-
Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
Martinovic, John, (2021)
- More ...
-
Bergman, David, (2023)
-
Optimizing over an ensemble of trained neural networks
Wang, Keliang, (2023)
-
Network models for multiobjective discrete optimization
Bergman, David, (2022)
- More ...