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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Ahuja R, Magnanti T, Orlin J (1994) Network flows. Wiley, New York
Alevras D (1997) Order preserving assignments without contiguity. Discret Math 163:1–11
Ball MO, Derigs U (1983) An analysis of alternate strategies for implementing matching algorithms. Networks 13:517–549
Edmonds J (1965) Maximum matching and a polyhedron with (0, 1) vertices. J Res Nat Bureau Standards (B) 69B:125–130
Edmonds J (1965) Paths, trees, and flowers. Canad J Math 17:449–467
Grötschel M, Holland O (1985) Solving matching problems with linear programming. Math Program 33:243–259
Grötschel M, Lovasz L, Schrijver A (1988) Geometric algorithms and combinatorial optimization. Springer, Berlin
Kuhn HW (1955) The Hungarian method for the assignment problem. Naval Res Logist Quart 2:83–97
Lovasz L, Plummer M (1986) Matching theory. North-Holland, Amsterdam
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
Nemhauser GL, Wolsey L (1988) Integer and combinatorial optimization. Wiley, New York
Padberg M, Alevras D (1994) Order-preserving assignments. Naval Res Logist 41:395–421
Padberg MW, Grötschel M (1985) Polyhedral theory. The Traveling Salesman Problem. Wiley, New York, pp 251–305
Padberg M, Rao MR (1982) Odd minimum cut-sets and b‑matchings. Math Oper Res 7:67–80
Pulleyblank WR (1989) Polyhedral combinatorics. Optimization, vol 1 of Handbook Oper Res and Management Sci. North-Holland, Amsterdam, pp 371–446
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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
DOI: https://doi.org/10.1007/978-0-387-74759-0_18
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-74758-3
Online ISBN: 978-0-387-74759-0
eBook Packages: Mathematics and StatisticsReference Module Computer Science and Engineering