Integer packing sets form a well-quasi-ordering
Alberto Del Pia (University of Wisconsin-Madison)
Dion Gijswijt (TU Delft - Discrete Mathematics and Optimization)
Jeff Linderoth (University of Wisconsin-Madison)
Haoran Zhu (University of Wisconsin-Madison)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
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.
help_outline