Solving matching problems with linear programming
- 1 December 1985
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 33 (3), 243-259
- https://doi.org/10.1007/bf01584376
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A Cutting Plane Algorithm for the Linear Ordering ProblemOperations Research, 1984
- An analysis of alternative strategies for implementing matching algorithmsNetworks, 1983
- Weakly bipartite graphs and the Max-cut problemOperations Research Letters, 1981
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- Solving Large-Scale Symmetric Travelling Salesman Problems to OptimalityManagement Science, 1980
- Assignment and Matching Problems: Solution Methods with FORTRAN-ProgramsPublished by Springer Science and Business Media LLC ,1980
- A primal algorithm for optimum matchingPublished by Springer Science and Business Media LLC ,1978
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock ProblemCanadian Journal of Mathematics, 1957