A parameterized linear formulation of the integer hull

Abstract

Let A ∈ Zm × n be an integer matrix with components bounded by in absolute value. Cook et al.~(1986) have shown that there exists a universal matrix B ∈ Zm' × n with the following property: For each b ∈ Zm, there exists t ∈ Zm' such that the integer hull of the polyhedron P = \ x ∈ Rn Ax ≤ b\ is described by PI = \ x ∈ Rn Bx ≤ t\. Our main result is that t is an affine function of b as long as b is from a fixed equivalence class of the lattice D · Zm. Here D ∈ N is a number that depends on n and only. Furthermore, D as well as the matrix B can be computed in time depending on and n only. An application of this result is the solution of an open problem posed by Cslovjecsek et al.~(SODA 2024) concerning the complexity of 2-stage-stochastic integer programming problems. The main tool of our proof is the classical theory of Chv\'atal-Gomory cutting planes and the elementary closure of rational polyhedra.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…