Edmonds polytopes and a hierarchy of combinatorial problems

@article{Chvtal1973EdmondsPA,
  title={Edmonds polytopes and a hierarchy of combinatorial problems},
  author={V. Chv{\'a}tal},
  journal={Discret. Math.},
  year={1973},
  volume={4},
  pages={305-337}
}
  • V. Chvátal
  • Published 1973
  • Computer Science, Mathematics
  • Discret. Math.
Let S be a set of linear inequalities that determine a bounded polyhedron P. The closure of S is the smallest set of inequalities that contain S and is closed under two operations: (i) taking linear combinations of inequalities, (ii) replacing an inequality @Sa"jx"j @? a"0, where a"1, a"2,..., a"n are integers, by the inequality @Sa"jx"j @? awitha >= [a"0]. Obviously, if integers x"1, x"2,..., x"n satisfy all the inequalities in S, then they satisfy also all inequalities in the closure of S… Expand
593 Citations
FOR MIXED INTEGER PROGRAMMING PROBLEMS
  • PDF
Chvátal closures for mixed integer programming problems
  • 265
  • PDF
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube
  • 58
  • PDF
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube*
  • 56
On the Rank of Mixed 0, 1 Polyhedra
  • 43
  • PDF
Matrix Cones, Projection Representations, and Stable Set Polyhedra
  • PDF
On the Rational Polytopes with Chvátal Rank 1
  • 2
  • PDF
Outer-product-free sets for polynomial optimization and oracle-based cuts
  • 16
  • PDF
Gomory-chvatal cutting planes and the elementary closure of polyhedra
  • 13
  • Highly Influenced
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 37 REFERENCES
Edmonds polytopes and weakly hamiltonian graphs
  • V. Chvátal
  • Mathematics, Computer Science
  • Math. Program.
  • 1973
  • 159
Anti-blocking polyhedra
  • 183
  • PDF
Maximum matching and a polyhedron with 0,1-vertices
  • 1,590
  • Highly Influential
  • PDF
Some remarks on the theory of graphs
  • 556
  • PDF
The complexity of theorem-proving procedures
  • S. Cook
  • Mathematics, Computer Science
  • STOC '71
  • 1971
  • 6,178
  • PDF
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
  • 2,297
  • PDF
Minimum partition of a matroid into independent subsets
  • 404
  • PDF
Integral Extreme Points
  • 74
The Factorization of Linear Graphs
  • 788
  • PDF
...
1
2
3
4
...