{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:08:02Z","timestamp":1761620882205},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1997,9]]},"DOI":"10.1007\/bf01215915","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T15:19:53Z","timestamp":1109344793000},"page":"315-337","source":"Crossref","is-referenced-by-count":29,"title":["The optimal path-matching problem"],"prefix":"10.1007","volume":"17","author":[{"given":"William H.","family":"Cunningham","sequence":"first","affiliation":[]},{"given":"James F.","family":"Geelen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/BF02125345","volume":"9","author":"E. Balas","year":"1989","unstructured":"E. Balas andW. R. Pulleyblank: The perfectly matchable subgraph polyherron of an arbitrary graph,Combinatorica,9 (1989), 495?516.","journal-title":"Combinatorica"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0095-8956(84)90023-6","volume":"36","author":"W. H. Cunningham","year":"1984","unstructured":"W. H. Cunningham: Testing membership in matroid polyhedra,J. Combinatorial Theory Ser. B,36 (1984), 161?188.","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01581694","volume":"65","author":"W. H. Cunningham","year":"1994","unstructured":"W. H. Cunningham andJ. Green-Kr\u00f3tki: A separation alogirthm for the matchable set polytope,Math. Programming,65 (1994), 139?150.","journal-title":"Math. Programming"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"W. H. Cunningham andJ. F. Geelen: The optimal path-matching problem,Proceedings of thirty-seventh Symposium on the Foundations of Computing, IEEE Computer Society Press, (1996), 78?85.","DOI":"10.1109\/SFCS.1996.548466"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BFb0121194","volume":"8","author":"W. H. Cunningham","year":"1978","unstructured":"W. H. Cunningham andA. B. Marsh III A primal algorithm for optimum matching,Math. Programming Stud.,8 (1978), 50?72.","journal-title":"Math. Programming Stud."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds: Paths, trees and flowers,Canada. J. Math.,17 (1965), 449?467.","journal-title":"Canada. J. Math."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds: Maximum matching and a polyhedron with 0, 1 vertices,J. Res. Nat. Bur. Standards Sect. B,69 (1965), 125?130.","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"241","DOI":"10.6028\/jres.071B.033","volume":"71","author":"J. Edmonds","year":"1967","unstructured":"J. Edmonds: Systems of distinct representatives and linear algebra,J. Res. Nat. Bur. Standards Sect. B,71 (1967), 241?245.","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"key":"CR9","first-page":"69","volume-title":"Combinatorial Structures and their Applications","author":"J. Edmonds","year":"1970","unstructured":"J. Edmonds: Submodular functions, matroids and certain polyhedra, in: R.K. Guy, et al. (eds.)Combinatorial Structures and their Applications, Gordon and Breach, New York, 1970, 69?87."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"147","DOI":"10.6028\/jres.069B.016","volume":"69","author":"J. Edmons","year":"1965","unstructured":"J. Edmons andD. R. Fulkerson: Transversals and matroid partition,J. Res. Nat. Bur. Standards Sect. B,69 (1965), 147?153.","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"key":"CR11","volume-title":"Matroids, Matchings, and Unimodular Matrices","author":"J. F. Geelen","year":"1995","unstructured":"J. F. Geelen:Matroids, Matchings, and Unimodular Matrices, doctoral thesis, University of Waterloo, Waterloo, Canada, 1995."},{"key":"CR12","volume-title":"Matching Polyhedra","author":"J. Green-Kr\u00f3tki","year":"1980","unstructured":"J. Green-Kr\u00f3tki:Matching Polyhedra, Master's thesis, Carleton University, Ottawa, Canada, 1980."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, andA. Schrijver: The ellipsoid method and its consequences in combinatorial optimization,Combinatorica 1 (1981), 169?197.","journal-title":"Combinatorica"},{"key":"CR14","unstructured":"L. Lov\u00e1sz: Private communication, 1992."},{"key":"CR15","volume-title":"Matching Theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"L. Lov\u00e1sz andM. D. Plummer:Matching Theory, North-Holland, Amsterdam, 1986."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1287\/moor.7.1.67","volume":"7","author":"M. W. Padberg","year":"1982","unstructured":"M. W. Padberg andM. R. Rao: Odd minimum cut-sets andb-matchings,Math. Oper. Res.,7 (1982), 67?80.","journal-title":"Math. Oper. Res."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/0095-8956(83)90011-4","volume":"34","author":"A. Schrijver","year":"1983","unstructured":"A. Schrijver: Short proofs on the matching polyhedron,J. Combinatorial Theory Ser. B,34 (1983), 104?108.","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"CR18","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver:Theory of Linear and Integer Programming, Wiley, New York, 1986."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","volume":"22","author":"W. T. Tutte","year":"1947","unstructured":"W. T. Tutte: The factorization of linear graphs,J. London Math. Soc.,22 (1947), 107?111.","journal-title":"J. London Math. Soc."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01215915.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01215915\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01215915","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T09:56:46Z","timestamp":1556791006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01215915"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["BF01215915"],"URL":"https:\/\/doi.org\/10.1007\/bf01215915","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}