Abstract
A uniform cut polytope is defined as the convex hull of the incidence vectors of all cuts in an undirected graph G for which the cardinalities of the shores are fixed. In this paper, we study linear descriptions of such polytopes. Complete formulations are presented for the cases when the cardinality k of one side of the cut is equal to 1 or 2. For larger values of k, investigations with relation to the shape of these polytopes are reported. We namely determine their diameter and also provide new families of facet-defining inequalities.
| Original language | English |
|---|---|
| Pages (from-to) | 62-70 |
| Number of pages | 9 |
| Journal | Discrete Applied Mathematics |
| Volume | 175 |
| DOIs | |
| Publication status | Published - 1 Oct 2014 |
| Externally published | Yes |
Keywords
- Graph partitioning
- Uniform cut polytopes
Fingerprint
Dive into the research topics of 'On the polyhedral structure of uniform cut polytopes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver