Back to Search
Start Over
From equipartition to uniform cut polytopes: Extended polyhedral results
- Source :
- Discrete Mathematics, Discrete Mathematics, Elsevier, 2011, 311 (8 & 9), pp.705-714. ⟨10.1016/j.disc.2011.01.018⟩
- Publication Year :
- 2011
- Publisher :
- Elsevier BV, 2011.
-
Abstract
- International audience; Given an undirected graph G, a uniform cut polytope is defined as the convex hull of the incidence vectors of the cuts in G for which the size of the shores are fixed. In this paper we show that simple extensions of facet-defining inequalities for the equipartition polytope introduced by Conforti et al. in [5] and [6] provide facet-defining inequalities for uniform cut polyhedra.
- Subjects :
- Convex hull
Discrete mathematics
medicine.medical_specialty
021103 operations research
Polyhedral combinatorics
Graph partitioning
0211 other engineering and technologies
Graph partition
Uniform k 21 polytope
Polytope
Uniform cut polytopes
0102 computer and information sciences
02 engineering and technology
[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
01 natural sciences
Theoretical Computer Science
Combinatorics
Polyhedron
010201 computation theory & mathematics
Cut
Convex polytope
medicine
Mathematics::Metric Geometry
Discrete Mathematics and Combinatorics
Mathematics
Subjects
Details
- ISSN :
- 0012365X
- Volume :
- 311
- Issue :
- 8-9
- Database :
- OpenAIRE
- Journal :
- Discrete Mathematics
- Accession number :
- edsair.doi.dedup.....2f46288ef4b9ca10d20e3190ad9d4bd1
- Full Text :
- https://doi.org/10.1016/j.disc.2011.01.018