Facets for the cut cone I
Open Access
- 1 August 1992
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 56 (1-3) , 121-160
- https://doi.org/10.1007/bf01580897
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- The cut cone, L1 embeddability, complexity, and multicommodity flowsNetworks, 1991
- All Facets of the Cut Cone Cn for n = 7 are KnownEuropean Journal of Combinatorics, 1990
- All the Facets of the Six-point Hamming ConeEuropean Journal of Combinatorics, 1989
- Experiments in quadratic 0–1 programmingMathematical Programming, 1989
- Distance-Regular GraphsPublished by Springer Nature ,1989
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout DesignOperations Research, 1988
- On the cycle polytope of a binary matroidJournal of Combinatorial Theory, Series B, 1986
- Facets of the Bipartite Subgraph PolytopeMathematics of Operations Research, 1985
- Sur les Inégalités Valides dans L1European Journal of Combinatorics, 1984
- The max-cut problem on graphs not contractible to K5Operations Research Letters, 1983