On the Chvátal Rank of Polytopes in the 0/1 Cube - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Applied Mathematics Year : 1999

On the Chvátal Rank of Polytopes in the 0/1 Cube

Friedrich Eisenbrand
  • Function : Author
Mark Hartmann
  • Function : Author
Andreas S. Schulz
  • Function : Author

Abstract

Given a polytope $P\subseteq\R^n$, the Chvátal-Gomory procedure computes iteratively the integer hull $P_I$ of $P$. The Chvátal rank of $P$ is the minimal number of iterations needed to obtain $P_I$. It is always finite, but already the Chvátal rank of polytopes in $\R^2$ can be arbitrarily large. In this paper, we study polytopes in the 0/1~cube, which are of particular interest in combinatorial optimization. We show that the Chvátal rank of any polytope $P\subseteq [0,1]^n$ is $\mbox{O}(n^3 \log n)$ and prove the linear upper and lower bound $n$ for the case $P\cap \Z^n = \emptyset$.
No file

Dates and versions

inria-00099018 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00099018 , version 1

Cite

Alexander Bockmayr, Friedrich Eisenbrand, Mark Hartmann, Andreas S. Schulz. On the Chvátal Rank of Polytopes in the 0/1 Cube. Discrete Applied Mathematics, 1999, 98 (1-2), pp.21-27. ⟨inria-00099018⟩
59 View
0 Download

Share

Gmail Facebook X LinkedIn More