Recommendations
Cites work
- scientific article; zbMATH DE number 17641 (Why is no real title available?)
- scientific article; zbMATH DE number 3432276 (Why is no real title available?)
- A complete description of the traveling salesman polytope on 8 nodes
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- Extension operations for cuts
- Facets for the cut cone. I
- Facets for the cut cone. II: Clique-web inequalities
- Facets of the Bipartite Subgraph Polytope
- On the cut polytope
- On the cycle polytope of a binary matroid
- Small Travelling Salesman Polytopes
- The equipartition polytope. II: Valid inequalities and facets
- 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
- Facets for the cut cone. I
- Facets for the cut cone. II: Clique-web inequalities
- Moffatt eddies in the cone
- 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)