Solving (large scale) matching problems combinatorially
- 1 March 1991
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 50 (1-3) , 113-121
- https://doi.org/10.1007/bf01594929
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On the use of optimal fractional matchings for solving the (integer) matching problemComputing, 1986
- Solving large‐scale matching problems efficiently: A new primal matching approachNetworks, 1986
- Solving matching problems with linear programmingMathematical Programming, 1985
- The zero pivot phenomenon in transportation and assignment problems and its computational implicationsMathematical Programming, 1977
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965