Skip to main content
SpringerLink
Log in

Assignment and Matching

AM

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

Maximum Cardinality Bipartite Matching Problem

Weighted Bipartite Matching Problem

Weighted Matching Problem

Maximum Cardinality Matching Problem

See also

References

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 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Ahuja R, Magnanti T, Orlin J (1994) Network flows. Wiley, New York

    Google Scholar 

  2. Alevras D (1997) Order preserving assignments without contiguity. Discret Math 163:1–11

    MathSciNet  MATH  Google Scholar 

  3. Ball MO, Derigs U (1983) An analysis of alternate strategies for implementing matching algorithms. Networks 13:517–549

    MathSciNet  MATH  Google Scholar 

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

    MathSciNet  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  6. Grötschel M, Holland O (1985) Solving matching problems with linear programming. Math Program 33:243–259

    MATH  Google Scholar 

  7. Grötschel M, Lovasz L, Schrijver A (1988) Geometric algorithms and combinatorial optimization. Springer, Berlin

    MATH  Google Scholar 

  8. Kuhn HW (1955) The Hungarian method for the assignment problem. Naval Res Logist Quart 2:83–97

    MathSciNet  Google Scholar 

  9. Lovasz L, Plummer M (1986) Matching theory. North-Holland, Amsterdam

    MATH  Google Scholar 

  10. Micali S, Vazirani VV (1980) An O(√(|v|)|E|) algorithm for finding maximum matching in general graphs. IEEE Symp Found Computer Sci, pp 17–27

    Google Scholar 

  11. Nemhauser GL, Wolsey L (1988) Integer and combinatorial optimization. Wiley, New York

    MATH  Google Scholar 

  12. Padberg M, Alevras D (1994) Order-preserving assignments. Naval Res Logist 41:395–421

    MathSciNet  MATH  Google Scholar 

  13. Padberg MW, Grötschel M (1985) Polyhedral theory. The Traveling Salesman Problem. Wiley, New York, pp 251–305

    Google Scholar 

  14. Padberg M, Rao MR (1982) Odd minimum cut-sets and b‑matchings. Math Oper Res 7:67–80

    MathSciNet  MATH  Google Scholar 

  15. Pulleyblank WR (1989) Polyhedral combinatorics. Optimization, vol 1 of Handbook Oper Res and Management Sci. North-Holland, Amsterdam, pp 371–446

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Corporation, West Chester, USA

    Dimitris Alevras

Authors
  1. Dimitris Alevras
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Alevras, D. (2008). Assignment and Matching . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_18

Download citation

Publish with us

Policies and ethics

Search

Navigation