These results raise the question whether it is possible to come up with a polynomial cutting plane algorithm for integer infeasibility in fixed dimension. Using ...

Finally, we present a polynomial algorithm in varying dimension, which computes cutting planes for a simplicial cone that correspond to vertices of Qj. 1.

The elementary closure P′ of a polyhedron P is the intersection of P with all its Gomory-Chvátal cutting planes. P′ is a rational polyhedron provided that P ...

The elementary closure P of a polyhedron P is the intersection of P with all its Gomory-. Chvátal cutting planes. P is a rational polyhedron provided that P ...

We show that the number of inequalities needed to describe the elementary closure of a rational polyhedron is polynomially bounded in fixed dimension.

The elementary closure P′ of a polyhedron P is the intersection of P with all its Gomory-Chvátal cutting planes. P′ is a rational polyhedron provided that P ...

Nov 1, 2024 · The elementary closure P 0 of a polyhedron P is the intersection of P with all its Gomory-Chvatal cutting planes.

We show that the number of inequalities needed to describe the elementary closure of a rational polyhedron is polynomially bounded in fixed dimension. If P is a ...

Last we consider the elementary closure in fixed dimension. the known bounds for the number of inequalities defining P'; are exponential, even fixed dimension.

Author: Bockmayr, Alexander et al.; Genre: Journal Article; Issued: 2001; Title: Cutting Planes and the Elementary Closure in Fixed Dimension.