On the Chvátal-rank of Antiwebs
References (9)
Edmonds polytopes and a hierarchy of combinatorial problems
Discrete Math.
(1973)On certain polytopes associated with graphs
J. Combin. Theory (B)
(1975)- et al.
On cutting-plane proofs in combinatorial optimization
Lin. Algebra and its Appl.
(1989) Anti-blocking polyhedra
J. Comb. Theory
(1972)
There are more references available in the full text version of this article.
Cited by (1)
A lower bound on the Chvátal-rank of Antiwebs
2011, Electronic Notes in Discrete Mathematics
Copyright © 2010 Elsevier B.V. All rights reserved.