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)
-
Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
Martinovic, John, (2021)
-
A clique covering MIP model for the irregular strip packing problem
Rodrigues, Marcos Okamura, (2017)
- More ...
-
On matrices with the Edmonds-Johnson property
Del Pia, Alberto, (2010)
-
On the rank of disjunctive cuts
Del Pia, Alberto, (2012)
-
Rank-one Boolean tensor factorization and the multilinear polytope
Del Pia, Alberto, (2025)
- More ...