A cutting plane algorithm for minimum perfect 2-matchings
- 1 December 1987
- journal article
- Published by Springer Nature in Computing
- Vol. 39 (4) , 327-344
- https://doi.org/10.1007/bf02239975
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Solving matching problems with linear programmingMathematical Programming, 1985
- Odd Minimum Cut-Sets and b-MatchingsMathematics of Operations Research, 1982
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- Solving Large-Scale Symmetric Travelling Salesman Problems to OptimalityManagement Science, 1980
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Multi-Terminal Network FlowsJournal of the Society for Industrial and Applied Mathematics, 1961