Integer packing sets form a well-quasi-ordering

Alberto Del Pia, Dion Gijswijt, Jeff Linderoth, Haoran Zhu*

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

2 Citations (Scopus)
21 Downloads (Pure)


An integer packing set is a set of non-negative integer vectors with the property that, if a vector x is in the set, then every non-negative integer vector y with y≤x is in the set as well. The main result of this paper is that integer packing sets, ordered by inclusion, form a well-quasi-ordering. This result allows us to answer a recently posed question: the k-aggregation closure of any packing polyhedron is again a packing polyhedron.

Original languageEnglish
Pages (from-to)226-230
Number of pages5
JournalOperations Research Letters
Issue number2
Publication statusPublished - 2021

Bibliographical note

Accepted Author Manuscript


  • k-aggregation closure
  • Packing polyhedra
  • Polyhedrality
  • Well-quasi-ordering


Dive into the research topics of 'Integer packing sets form a well-quasi-ordering'. Together they form a unique fingerprint.

Cite this