English

A parameterized linear formulation of the integer hull

Computational Complexity 2025-10-21 v3 Optimization and Control

Abstract

Let AZm×nA \in \mathbb{Z}^{m \times n} be an integer matrix with components bounded by Δ\Delta in absolute value. Cook et al.~(1986) have shown that there exists a universal matrix BZm×nB \in \mathbb{Z}^{m' \times n} with the following property: For each bZmb \in \mathbb{Z}^m, there exists tZmt \in \mathbb{Z}^{m'} such that the integer hull of the polyhedron P={xRn ⁣:Axb}P = \{ x \in \mathbb{R}^n \colon Ax \leq b\} is described by PI={xRn ⁣:Bxt}P_I = \{ x \in \mathbb{R}^n \colon Bx \leq t\}. Our \emph{main result} is that tt is an \emph{affine} function of bb as long as bb is from a fixed equivalence class of the lattice DZmD \cdot \mathbb{Z}^m. Here DND \in \mathbb{N} is a number that depends on nn and Δ\Delta only. Furthermore, DD as well as the matrix BB can be computed in time depending on Δ\Delta and nn 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}
}
R2 v1 2026-06-28T20:56:22.388Z