{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T16:28:35Z","timestamp":1680452915330},"reference-count":15,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2003,11]]},"DOI":"10.1016\/s0167-6377(03)00052-x","type":"journal-article","created":{"date-parts":[[2003,6,9]],"date-time":"2003-06-09T21:09:27Z","timestamp":1055192967000},"page":"429-434","source":"Crossref","is-referenced-by-count":5,"title":["A compact linear program for testing optimality of perfect matchings"],"prefix":"10.1016","volume":"31","author":[{"given":"Paolo","family":"Ventura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedrich","family":"Eisenbrand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0167-6377(03)00052-X_BIB1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01580600","article-title":"On cuts and matchings in planar graphs","volume":"60","author":"Barahona","year":"1993","journal-title":"Math. Programming Ser. A"},{"issue":"4","key":"10.1016\/S0167-6377(03)00052-X_BIB2","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1137\/0803035","article-title":"Reducing matching to polynomial size linear programming","volume":"3","author":"Barahona","year":"1993","journal-title":"SIAM J. Optim."},{"key":"10.1016\/S0167-6377(03)00052-X_BIB3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","article-title":"Maximum matching and a polyhedron with 0,1-vertices","volume":"69","author":"Edmonds","year":"1965","journal-title":"J. Res. Natl. Bur. Standards"},{"key":"10.1016\/S0167-6377(03)00052-X_BIB4","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0167-6377(03)00052-X_BIB5","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","article-title":"Matching, Euler tours and the Chinese postman","volume":"5","author":"Edmonds","year":"1973","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(03)00052-X_BIB6","unstructured":"F. Eisenbrand, G. Rinaldi, P. Ventura, Primal separation for 0\/1 polytopes, IASI-CNR Research Report 546, Istituto di Analisi dei Sistemi ed Informatica, Roma, Italy, 2001."},{"issue":"2","key":"10.1016\/S0167-6377(03)00052-X_BIB7","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","article-title":"The ellipsoid method and its consequences in combinatorial optimization","volume":"1","author":"Gr\u00f6tschel","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/S0167-6377(03)00052-X_BIB8","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0167-5060(08)70822-7","article-title":"Graph theory and integer programming","volume":"4","author":"Lov\u00e1sz","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0167-6377(03)00052-X_BIB9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1287\/moor.7.1.67","article-title":"Odd minimum cut-sets and b-matchings","volume":"7","author":"Padberg","year":"1982","journal-title":"Math. Oper. Res."},{"issue":"1","key":"10.1016\/S0167-6377(03)00052-X_BIB10","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/0095-8956(83)90011-4","article-title":"Short proofs on the matching polyhedron","volume":"34","author":"Schrijver","year":"1983","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0167-6377(03)00052-X_BIB11","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/S0167-6377(03)00052-X_BIB12","unstructured":"P. Seymour, Sums of circuits, in: J. Bondy, A.P.U.S.R. Murty (Eds.), Graph Theory and Related Topics, 1979, pp. 341\u2013355."},{"issue":"1","key":"10.1016\/S0167-6377(03)00052-X_BIB13","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF01594930","article-title":"On the core of network synthesis games","volume":"50","author":"Tamir","year":"1991","journal-title":"Math. Programming Ser. A"},{"key":"10.1016\/S0167-6377(03)00052-X_BIB14","doi-asserted-by":"crossref","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","article-title":"A short proof of the factor theorem for finite graphs","volume":"6","author":"Tutte","year":"1954","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0167-6377(03)00052-X_BIB15","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/0022-0000(91)90024-Y","article-title":"Expressing combinatorial optimization problems by linear programs","volume":"43","author":"Yannakakis","year":"1991","journal-title":"J. Comput. System Sci."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016763770300052X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016763770300052X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T21:57:53Z","timestamp":1553119073000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016763770300052X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["S016763770300052X"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(03)00052-x","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}