The equipartition polytope. I: Formulations, dimension and basic facets
- 1 November 1990
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 49 (1) , 49-70
- https://doi.org/10.1007/bf01588778
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout DesignOperations Research, 1988
- A polynomial characterization of some graph partitioning problemsInformation Processing Letters, 1988
- Some New Matroids on Graphs: Cut Sets and the Max Cut ProblemMathematics of Operations Research, 1987
- On the cut polytopeMathematical Programming, 1986
- A solvable case of quadratic 0–1 programmingDiscrete Applied Mathematics, 1986
- Facets of the Bipartite Subgraph PolytopeMathematics of Operations Research, 1985
- Bottleneck extremaJournal of Combinatorial Theory, 1970
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970