On the skeleton of the dual cut polytope
Conference
·
OSTI ID:35946
- Tokyo Institute of Technology (Japan)
The cut polytope is the ({sub 2}{sup n})-dimensional convex polytope generated by all cuts of the complete graph on n nodes. One of the applications of the cut polytope, the polyhedral approach to the maximum cut problem, leads to the study of its facets which are known only up to n = 7 where they number 116,764. For n {<=} 7, we describe the skeleton of the dual of the cut polytope, in particular, we give its adjacencies relations and diameter. We also give similar results for a relative of the cut polytope, the cut cone, and new results on the size of the facets of the cut polytope.
- OSTI ID:
- 35946
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
All 0-1 polytopes are traveling salesman polytopes
Lifting, projection and the cycle polytope of a directed graph
On a positive semidefinite relaxation of the cut polytope
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35839
Lifting, projection and the cycle polytope of a directed graph
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35800
On a positive semidefinite relaxation of the cut polytope
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36200