The inequicut cone
From MaRDI portal
Publication:688255
DOI10.1016/0012-365X(93)90115-AzbMATH Open0801.52006MaRDI QIDQ688255FDOQ688255
Authors: Komei Fukuda, Monique Laurent, Michel Deza 
Publication date: 1 December 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)
Cites Work
- Extension operations for cuts
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- On the cut polytope
- Facets for the cut cone. I
- Facets for the cut cone. II: Clique-web inequalities
- On the cycle polytope of a binary matroid
- The equipartition polytope. II: Valid inequalities and facets
- Facets of the Bipartite Subgraph Polytope
- A complete description of the traveling salesman polytope on 8 nodes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Small Travelling Salesman Polytopes
- The even and odd cut polytopes
Cited In (14)
- The even and odd cut polytopes
- Double description method revisited
- The equipartition polytope. I: Formulations, dimension and basic facets
- On the polyhedral structure of uniform cut polytopes
- Extension operations for cuts
- A Cone Eversion
- Some new classes of facets for the equicut polytope
- Application of cut polyhedra. I
- The \(E_t\)-construction for lattices, spheres and polytopes
- Moffatt eddies in the cone
- Facets for the cut cone. I
- Facets for the cut cone. II: Clique-web inequalities
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
- Canonical equation sets for classes of concordant polytopes
This page was built for publication: The inequicut cone
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688255)
