Integer packing sets form a well-quasi-ordering

Journal article (2021)

Authors

Alberto Del Pia University of Wisconsin-Madison
Dion Gijswijt Discrete Mathematics and Optimization - EEMCS
Jeff Linderoth University of Wisconsin-Madison
Haoran Zhu University of Wisconsin-Madison
Research Group
Discrete Mathematics and Optimization (EEMCS) (TU Delft)
Copyright: © 2021 Alberto Del Pia, Dion Gijswijt, Jeff Linderoth, Haoran Zhu
DOI: https://doi.org/10.1016/j.orl.2021.01.013
More Info
expand_more

Published Date

2021

Language

English

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Delft Institute of Applied Mathematics

Research Group

Discrete Mathematics and Optimization

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.

Files

IPS_WQO.pdf
(.pdf | 0.355 Mb)
- Embargo expired in 27-01-2022
help_outline
1_s2.0_S0167637721000225_main.... (.pdf)
(.pdf | 0.435 Mb)

Download not available