Abstract.
Perhaps the two most fundamental well-solved models in combinatorial optimization are the optimal matching problem and the optimal matroid intersection problem. We review the basic results for both, and describe some more recent advances. Then we discuss extensions of these models, in particular, two recent ones—jump systems and path-matchings.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: October 10, 2000 / Accepted: June 13, 2001¶Published online December 6, 2001
Rights and permissions
About this article
Cite this article
Cunningham, W. Matching, matroids, and extensions. Math. Program. 91, 515–542 (2002). https://doi.org/10.1007/s101070100256
Published:
Issue Date:
DOI: https://doi.org/10.1007/s101070100256