Skip to main content
SpringerLink
Log in

Solving (large scale) matching problems combinatorially

  • Published:
Mathematical Programming Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

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).

    Google Scholar 

  • U. Derigs, “Postoptimal analysis for matching problems,”Methods of Operations Research 49 (1980) 215–221.

    Google Scholar 

  • U. Derigs, “Solving large-scale matching problems efficiently — A new primal matching approach,”Networks 16 (1986) 1–16.

    Google Scholar 

  • U. Derigs and A. Metz, “On the use of optimal fractional matchings for solving the (integer) matching problem,”Computing 36 (1986a) 263–270.

    Google Scholar 

  • 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.

    Google Scholar 

  • J. Edmonds, “Maximum matching and a polyhedron with 0, 1 vertices,”Journal of Research of the National Bureau Standards 69B (1965) 125–130.

    Google Scholar 

  • 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.

    Google Scholar 

  • M. Grötschel and O. Holland, “Solving matching problems with linear programming,”Mathematical Programming 33 (1985) 243–259.

    Google Scholar 

  • A. Metz, “Postoptimale Analyse und neue primale Matching Algorithmen,” Diploma Thesis, University of Cologne (Cologne, 1987).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Wirtschaftsinformatik, Universität zu Köln, W-5000, Köln, Germany

    U. Derigs & A. Metz

Authors
  1. U. Derigs
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Metz
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was partially supported by Sonderforschungsbereich 303, University of Bonn, and a special grant from the Deutsche Forschungsgemeinschaft.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01594929

Key words

Search

Navigation