Integer packing sets form a well-quasi-ordering

DOI10.1016/j.orl.2021.01.013OpenAlexW3123397483MaRDI QIDQ2661623

Jeff Linderoth, Haoran Zhu, Alberto Del Pia, Dion C. Gijswijt

Publication date: 7 April 2021

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.12841

zbMATH Keywords

well-quasi-orderingpolyhedralitypacking polyhedra\(k\)-aggregation closure

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (max. 100)

On a Generalization of the Chvátal-Gomory Closure ⋮ Generalized Chvátal-Gomory closures for integer programs with bounds on variables ⋮ The aggregation closure is polyhedral for packing and covering integer programs ⋮ On a generalization of the Chvátal-Gomory closure

Cites Work

• On the polyhedrality of cross and quadrilateral closures
• Graph minors. XX: Wagner's conjecture
• On finitely generated closures in the theory of cutting planes
• The theory of well-quasi-ordering: a frequently discovered concept
• On the Chvátal-Gomory Closure of a Compact Convex Set
• An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets
• On the existence of optimal solutions to integer and mixed-integer programming problems
• On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width
• The Gomory-Chvátal Closure of a Nonrational Polytope Is a Rational Polytope
• Ordering by Divisibility in Abstract Algebras

This page was built for publication: Integer packing sets form a well-quasi-ordering