Transforming clique tree inequalities to induce facets for the 2-edge connected polytope
Conference
·
OSTI ID:35858
The 2-edge connected polytope Q{sub 2E}{sup n} is the convex hull of all 0-1 incidence vectors of 2-edge connected spanning subgraphs of the complete graph K{sub n}. This polytope is related to the travelling salesman polytope, which is a face of Q{sub 2E}{sup n}. By exploiting this relationship and applying the theory from Boyd and Pulleyblank (1991), we show how the clique tree inequalities for the traveling salesman polytope can be transformed into a large new class of facet-inducing inequalities for Q{sub 2E}{sup n}. We also discuss how this class can be generalized to include the lifted 2-cover inequalities introduced by Grotschel, Monma and Stoer (1989).
- OSTI ID:
- 35858
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
New facets of the STS polytope generated from known facets of the ATS polytope.
All 0-1 polytopes are traveling salesman polytopes
On the symmetric circuit polytope
Journal Article
·
Sun May 01 00:00:00 EDT 2005
· Proposed for publication in the Journal of the Discrete Optimization.
·
OSTI ID:970744
All 0-1 polytopes are traveling salesman polytopes
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35839
On the symmetric circuit polytope
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35814