A parameterized linear formulation of the integer hull
Abstract
Let be an integer matrix with components bounded by in absolute value. Cook et al.~(1986) have shown that there exists a universal matrix with the following property: For each , there exists such that the integer hull of the polyhedron is described by . Our \emph{main result} is that is an \emph{affine} function of as long as is from a fixed equivalence class of the lattice . Here is a number that depends on and only. Furthermore, as well as the matrix can be computed in time depending on and only. An application of this result is the solution of an open problem posed by Cslovjecsek et al.~(SODA 2024) concerning the complexity of \emph{2-stage-stochastic integer programming} problems. The main tool of our proof is the classical theory of \emph{Chv\'atal-Gomory cutting planes} and the \emph{elementary closure} of rational polyhedra.
Keywords
Cite
@article{arxiv.2501.02347,
title = {A parameterized linear formulation of the integer hull},
author = {Friedrich Eisenbrand and Thomas Rothvoss},
journal= {arXiv preprint arXiv:2501.02347},
year = {2025}
}