Skip to main content
SpringerLink
Log in

The minimal cost maximum matching of a graph

  • Abhandlungen
  • Published:
Unternehmensforschung Aims and scope Submit manuscript

Summary

This paper deals with the problem of finding the maximum matching of a weighted graph, having the minimum cost. This problem is solved via a branch and bound algorithm, derived directly fromLand andDoig's technique. The linear programming problem associated with each step of the procedure is solved through a primal-dual algorithm.

Zusammenfassung

Diese Arbeit beschäftigt sich mit demmatching problem. In einem gewichteten Graphen ist dasmaximal matching mit minimalen Kosten gesucht. Zur Lösung wird ein vonLand undDoig beschriebener Branch-and-Bound-Algorithmus verwendet. Das sich je Iterationsschritt ergebende LP-Problem wird mit einem Primal-Dual-Algorithmus gelöst.

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

  • Berge, C.: Theorie des graphes et ses applications, Dunod, 1968.

  • Kuhn, H. W.: The Hungarian Method for the Assignment Problem, Naval Res. Logist. Quart.,2, 1955, 83–97.

    Google Scholar 

  • Edmonds, J.: Maximum Matchings and a Polyhedron with 0–1 vertices, J. Res. Nat. Bur. Stand.,68 B, 1965, 125–130.

    Google Scholar 

  • Land, A. H. andA. Doig: An Automatic Method of Solving Discrete Programming Problems, Econometrica,23, 1960, 497–520.

    Google Scholar 

  • Norman, R. Z. andM. O. Rabin: An Algorithm for a Minimal Cover of a Graph, Proc. Amer. Math. Soc.,10, 1959, 315–319.

    Google Scholar 

  • Dantzig, G. B., L. R. Ford Jr., andD. R. Fulkerson: A Primal-Dual Algorithm for Linear Programs inH. W. Kuhn andA. W. Tucker, Annals of Mathematics Study No. 38, Princeton University Press, Princeton (1956), 171–181.

    Google Scholar 

Download references

Authors
  1. A. O. De Maio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. A. Roveda
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The authors are with the Laboratory of Automatic Control, Istituto di Elettrotecnica ed Elettronica, Politecnico di Milano, I-20133 Milano, Piazza Leonardo da Vinci, 32.

Rights and permissions

Reprints and permissions

About this article

Cite this article

De Maio, A.O., Roveda, C.A. The minimal cost maximum matching of a graph. Unternehmensforschung Operations Research 15, 196–210 (1971). https://doi.org/10.1007/BF01939827

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation