Skip to main content
SpringerLink
Log in

Matching: A Well-Solved Class of Integer Linear Programs

  • Chapter
  • First Online:
Book cover Combinatorial Optimization — Eureka, You Shrink!

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2570))

Abstract

A main purpose of this work is to give a good algorithm for a certain well-described class of integer linear programming problems, called matching problems (or the matching problem). Methods developed for simple matching [2]

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berge, C., Théorie des graphes et ses applications, Dunod, Paris, 1958.

    Google Scholar 

  2. Edmonds, J., Paths, trees, and flowers, Canad. J. Math. 17 (1965), 449–467.

    MathSciNet  MATH  Google Scholar 

  3. Edmonds, J., Maximum matching and a polyhedron with 0,1-vertices, J. Res. Nat. Bur. Standards 69B (1965), 125–130.

    MathSciNet  Google Scholar 

  4. Edmonds, J., An introduction to matching, preprinted lectures, Univ. of Mich. Summer Engineering Conf. 1967.

    Google Scholar 

  5. Johnson, E.L., Programming in networks and graphs, Operation Research Center Report 65-1, Etchavary Hall, Univ. of Calif., Berkeley.

    Google Scholar 

  6. Tutte, W.T., The factorization of linear graphs, J. London Math. Soc. 22 (1947), 107–111.

    Article  MathSciNet  MATH  Google Scholar 

  7. Tutte, W.T., The factors of graphs, Canad. J. Math. 4 (1952), 314–328.

    MathSciNet  MATH  Google Scholar 

  8. Witzgall, C. and Zahn, C.T. Jr., Modification of Edmonds’ matching algorithm, J. Res. Nat. Bur. Standards 69B (1965), 91–98.

    MathSciNet  Google Scholar 

  9. White, L.J., A parametric study of matchings, Ph.D. Thesis, Dept. of Elec. Engineering, Univ. of Mich., 1967.

    Google Scholar 

  10. Balinski, M., A labelling method for matching, Combinatorics Conference, Univ. of North Carolina, 1967.

    Google Scholar 

  11. Balinski, M., Establishing the matching poloytope, preprint, City Univ. of New York, 1969.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Bureau of Standards, Washington, D.C., USA

    Jack Edmonds

  2. I.B.M. Research Center, Yorktown Heights, NY, USA

    Ellis L. Johnson

Authors
  1. Jack Edmonds
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ellis L. Johnson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität zu Köln, Pohligstr. 1, 50969, Köln, Germany

    Michael Jünger

  2. Institut für Informatik, Universität Heidelberg, Im Neuenheimer Feld 368, 69120, Heidelberg, Germany

    Gerhard Reinelt

  3. Istituto di Analisi dei Sistemi ed Informatica “Antonio Ruberti”, CNR, viale Manzoni 30, 00185, Rome, Italy

    Giovanni Rinaldi

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Edmonds, J., Johnson, E.L. (2003). Matching: A Well-Solved Class of Integer Linear Programs. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds) Combinatorial Optimization — Eureka, You Shrink!. Lecture Notes in Computer Science, vol 2570. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36478-1_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-36478-1_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00580-3

  • Online ISBN: 978-3-540-36478-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation