Abstract
In this paper we describe computational results for a modification of the shortest augmenting path approach for solving large scale matching problems. Using a new assignment start procedure and the two-phase strategy, where first the problem is solved on a sparse subgraph and then reoptimization is used, matching problems on complete graphs with 1000 nodes are solved in about 10–15 seconds on an IBM 4361.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
R.E. Burkard and U. Derigs, “Assignment and matching problems: Solution methods with FORTRAN-programs,”Lecture Notes in Economics and Mathematical Systems, No. 184 (Springer, Berlin, 1980).
U. Derigs, “Postoptimal analysis for matching problems,”Methods of Operations Research 49 (1980) 215–221.
U. Derigs, “Solving large-scale matching problems efficiently — A new primal matching approach,”Networks 16 (1986) 1–16.
U. Derigs and A. Metz, “On the use of optimal fractional matchings for solving the (integer) matching problem,”Computing 36 (1986a) 263–270.
U. Derigs and A. Metz, “An in-core/out-of-core method for solving large scale assignment problems,”Zeitschrift für Operations Research 30 (1986b) A181-A195.
J. Edmonds, “Maximum matching and a polyhedron with 0, 1 vertices,”Journal of Research of the National Bureau Standards 69B (1965) 125–130.
B. Gavish, P. Schweitzer & E. Shlifer, “The zero pivot phenomenon in transportation and assignment problems and its computational implications,”Mathematical Programming 12 (1977) 226–240.
M. Grötschel and O. Holland, “Solving matching problems with linear programming,”Mathematical Programming 33 (1985) 243–259.
A. Metz, “Postoptimale Analyse und neue primale Matching Algorithmen,” Diploma Thesis, University of Cologne (Cologne, 1987).
Author information
Authors and Affiliations
Additional information
This work was partially supported by Sonderforschungsbereich 303, University of Bonn, and a special grant from the Deutsche Forschungsgemeinschaft.
Rights and permissions
About this article
Cite this article
Derigs, U., Metz, A. Solving (large scale) matching problems combinatorially. Mathematical Programming 50, 113–121 (1991). https://doi.org/10.1007/BF01594929
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01594929