Cones of Matrices and Set-Functions and 0–1 Optimization
- 1 May 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 1 (2), 166-190
- https://doi.org/10.1137/0801013
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Coflow polyhedraDiscrete Mathematics, 1992
- The perfectly Matchable Subgraph Polytope of an arbitrary graphCombinatorica, 1989
- Geometric Algorithms and Combinatorial OptimizationPublished by Springer Nature ,1988
- Relaxations of vertex packingJournal of Combinatorial Theory, Series B, 1986
- The perfectly matchable subgraph polytope of a bipartite graphNetworks, 1983
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- On certain polytopes associated with graphsJournal of Combinatorial Theory, Series B, 1975
- Edmonds polytopes and a hierarchy of combinatorial problemsDiscrete Mathematics, 1973
- Determinants on SemilatticesProceedings of the American Mathematical Society, 1969
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965