Facets of the K-partition Polytope

@article{Chopra1995FacetsOT,
  title={Facets of the K-partition Polytope},
  author={Sunil Chopra and M. R. Rao},
  journal={Discrete Applied Mathematics},
  year={1995},
  volume={61},
  pages={27-48}
}
We study facets of the k-partition polytope Pk.+, the convex hull of edges cut by r-partitions of a complete graph for r < k, k 2 3. We generalize the hypermetric and cycle inequalities (see Deza and Laurent, 1992) from the cut polytope to Pk.,, k 2 3. We give some sufficient conditions under which these are facet defining. We show the anti-web inequality introduced by Deza and Laurent (1992) to be facet defining for Pi,_, k 2 3. We also give lifting procedures for constructing facets of Pk… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Grotschel, On the cycle polytope of a binary matroid

M. F. Barahona
J. Combin. Theory Ser. B • 1986
View 7 Excerpts
Highly Influenced

Facets for the complete cut

M. Deza, M. Laurent
cone, Math. Programming • 1992
View 2 Excerpts

Facets for the cut cone I

Math. Program. • 1992
View 2 Excerpts

Similar Papers

Loading similar papers…