This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ball, M.O. and Derigs, U. (1983). “An Analysis of Alternate Strategies for Implementing Matching Algorithms,” Networks 13, 517–549.
Coffman, E.G., Jr. and Graham, R.L. (1972). “Optimal Scheduling for Two Processor Systems,” Acta Inform. 1, 200–213.
Derigs, U. and Metz, A. (1986). “On the Use of Optimal Fractional Matchings for Solving the (Integer) Matching Problem,” Computing, 36, 263–270.
Edmonds, J. (1965a). “Paths, Trees, and Flowers,” Canad. Jl. Math., 17, 449–467.
Edmonds, J. (1965b). “Maximum Matching and a Polyhedron with (0,1) Vertices,” Jl. Res. Nat. Bur. Standards Sect. B, 69B, 125–130.
Edmonds, J. and Johnson, E.L. (1973). “Matching, Euler Tours and the Chinese Postman,” Math. Programming, 5, 88–124.
Even, S. and Kariv, O. (1975). “An O(n 5/2) Algorithm for Maximum Matching in General Graphs,” 16th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, New York, 100–112.
Galil, Z., Micali, S., and Gabow, H. (1982). “Priority Queues with Variable Priority and an O (EV log V) Algorithm for finding a Maximal Weighted Matching in General Graphs,” 23rd Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, New York, 255–261.
Gabow, H.N. (1976). “An Efficient Implementation of Edmond's Algorithm for Maximum Matching on Graphs,” Jl. Assoc. Comput. Mach., 23, 221–234.
Gerards, A.M.H. (1995). “Matching.” In M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser, eds. Network Models, Handbooks in Operations Research and Management Science, vol. 7, 135–224, Elsevier, Amsterdam.
Gondran, M. and Minoux, M. (1984). Graphs and Algorithms. John Wiley, Chichester.
Jonker, R. and Volgenant, A. (1986). “Improving the Hungarian Assignment Algorithm,” Opl Res. Lett., 5, 171–175.
Kuhn, H.W. (1955). “The Hungarian Method for the Assignment Problem,” Naval Res. Logist. Quart., 2, 83–97.
Kuhn, H.W. (1956). “Variants of the Hungarian Method for Assignment Problems,” Naval Res. Logist. Quart., 3, 253–258.
Kwan, Mei-Ko (1962). “Graphic Programming Using Odd and Even Points,” Chinese Math., 1, 273–277.
Lawler, E.L. (1976). Combinatorial Optimization, Networks and Matroids. Holt, Rinehart and Winston, New York.
Lovasz L. and Plummer, M.D. (1986). Matching Theory. Annals of Discrete Mathematics, vol. 29, North-Holland, Amsterdam.
McHugh, James A. (1990). Algorithmic Graph Theory. Prentice-Hall, London.
Micali, S. and Vazirani, V.V. (1980). “An O(V 1/2E) Algorithm for Finding Maximum Matching in General Graphs,” 21st Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, New York, 17–27.
Miller, D.L. (1995). “A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems,” ORSA Jl. Computing, 7, 1–9.
Wright, M.B. (1990). “Speeding Up the Hungarian Algorithm,” Computers Opns Res., 17, 95–96.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this entry
Cite this entry
Eglese, R.W. (2001). Matching. In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_589
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_589
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-7923-7827-3
Online ISBN: 978-1-4020-0611-1
eBook Packages: Springer Book Archive