Loading...
Please wait, while we are loading the content...
On the Cut Polyhedron (2000)
| Content Provider | CiteSeerX |
|---|---|
| Author | Conforti, Michele Rinaldi, Giovanni Wolsey, Laurence |
| Abstract | The cut polyhedron cut(G) of an undirected graph G = (V, E) is the dominant of the convex hull of all of its nonempty edge cutsets. After examining various compact extended formulations for cut(G), we study some of its polyhedral properties. In particular, we characterize all of the facets induced by inequalities with right-hand side at most 2. These include all of the rank facets of the polyhedron. |
| File Format | |
| Language | English |
| Publisher Date | 2000-01-01 |
| Access Restriction | Open |
| Subject Keyword | Cut Polyhedron Polyhedral Property Undirected Graph Rank Facet Nonempty Edge Cutsets Cut Polyhedron Cut Convex Hull Right-hand Side |
| Content Type | Text |
| Resource Type | Technical Report |
