Integer packing sets form a well-quasi-ordering
Year of publication: |
2021
|
---|---|
Authors: | Del Pia, Alberto ; Gijswijt, Dion ; Linderoth, Jeff ; Zhu, Haoran |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 49.2021, 2, p. 226-230
|
Subject: | -aggregation closure | Packing polyhedra | Polyhedrality | Well-quasi-ordering | Packproblem | Packing problem | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Operations Research | Operations research | Algorithmus | Algorithm | Heuristik | Heuristics |
-
Models and algorithms for the bin-packing problem with minimum color fragmentation
Mehrani, Saharnaz, (2022)
-
Kim, Kyungdoc, (2014)
-
Solving the variable size bin packing problem with discretized formulations
Correia, Isabel, (2008)
- More ...
-
Approximation algorithms for hard capacitated k-facility location problems
Aardal, Karen, (2015)
-
Approximation algorithms for hard capacitated k-facility location problems
Aardal, Karen, (2015)
-
Does Sunlight Kill Germs? Stock Market Listing and Workplace Safety
Liang, Claire Y.C, (2021)
- More ...