Skip to main content
SpringerLink
Log in

Solving non-bipartite matching problems via shortest path techniques

  • Chapter III Assignment And Matching
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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

References

  1. M.O. Ball and U. Derigs, An analysis of alternate strategies for implementing matching algorithms, Networks 13(1983)517.

    Google Scholar 

  2. C. Berge, Two theorems in graph theory, Proc. Natl. ad. Acad. Sci. USA 43(1957)842.

    Google Scholar 

  3. R.E. Burkard and U. Derigs,Assignment and Matching Problems: Solution Methods with FORTRAN-Programs, Springer Lecture Notes in Mathematical Systems No. 184 (Springer-Verlag, Berlin, 1980).

    Google Scholar 

  4. W. Cunningham and A. Marsh,A Primal Algorithm for Optimum Matching, Math. Program. Study 8(1978)50.

    Google Scholar 

  5. U. Derigs, A shortest augmenting path method for solving minimal perfect matching problems, Networks 11(1981)379.

    Google Scholar 

  6. U. Derigs, Postoptimal analysis for matching problems, Math. Oper. Res. 49(1985)215.

    Google Scholar 

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

    Google Scholar 

  8. U. Derigs and A. Metz, On the use of optimal fractional matchings for solving the (integer) matching problem, Computing 36(1986)263.

    Google Scholar 

  9. J. Edmonds, Maximum matching and a polyhedron with 0, 1 vertices, J. Res. Natl. Bur. Stand. 69B(1965)125.

    Google Scholar 

  10. J. Edmonds and W. Pulleyblank, Facets of 1-matching polyhedra, in:Hypergraph Seminar, Lecture Notes in Mathematics No. 411 (Springer-Verlag, Berlin, 1974) pp. 214–242.

    Google Scholar 

  11. G. Gallo and S. Pallottino, this volume, p. 3.

  12. E.L. Lawler,Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976).

    Google Scholar 

  13. J.M. Rouseau, private communication (1984).

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Betriebswirtschaftslehre VII, Universität Bayreuth, D-8580, Bayreuth, FRG

    Ulrich Derigs

Authors
  1. Ulrich Derigs
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Supported by Sonderforschungsbereich 21 (DFG), Institut für Operations Research, Universität Bonn.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Derigs, U. Solving non-bipartite matching problems via shortest path techniques. Ann Oper Res 13, 225–261 (1988). https://doi.org/10.1007/BF02288324

Download citation

  • Issue Date:

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

Keywords

Search

Navigation