{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,14]],"date-time":"2024-05-14T17:18:06Z","timestamp":1715707086950},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1994,2]]},"DOI":"10.1007\/bf01581694","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T05:42:27Z","timestamp":1114666947000},"page":"139-150","source":"Crossref","is-referenced-by-count":10,"title":["A separation algorithm for the matchable set polytope"],"prefix":"10.1007","volume":"65","author":[{"given":"William H.","family":"Cunningham","sequence":"first","affiliation":[]},{"given":"Jan","family":"Green-Kr\u00f3tki","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 and W.R. Pulleyblank, \u201cThe perfectly matchable subgraph polyhedron of an arbitrary graph,\u201dCombinatorica 9 (1989) 495\u2013516.","journal-title":"Combinatorica"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01205074","volume":"11","author":"W.H. Cunningham","year":"1991","unstructured":"W.H. Cunningham and J. Green-Kr\u00f3tki, \u201cb-matching degree-sequence polyhedra,\u201dCombinatorica 11 (1991) 219\u2013230.","journal-title":"Combinatorica"},{"key":"CR3","first-page":"126","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, \u201cMaximum matching and a polyhedron with 0\u20131 vertices,\u201dJournal of Research of the National Bureau of Standards 69B (1965) 126\u2013130.","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"CR4","first-page":"89","volume-title":"Combinatorial Structures and their Applications","author":"J. Edmonds","year":"1970","unstructured":"J. Edmonds and E.L. Johnson, \u201cMatching: A well-solved class of integer linear programs,\u201d in: R.K. Guy et al., eds.Combinatorial Structures and their Applications (Gordon and Breach, New York, 1970) pp. 89\u201392."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"A. Frank","year":"1987","unstructured":"A. Frank and E. Tardos, \u201cAn application of simultaneous Diophantine approximation in combinatorial optimization.\u201dCombinatorica 7 (1987) 49\u201366.","journal-title":"Combinatorica"},{"key":"CR6","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 and A. Schrijver, \u201cThe ellipsoid method and its consequences in combinatorial optimization,\u201dCombinatorica 1 (1981) 169\u2013197.","journal-title":"Combinatorica"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0167-6377(87)90027-7","volume":"6","author":"Q. Ning","year":"1987","unstructured":"Q. Ning, \u201cOn separation and adjacency problems for perfectly matchable subgraph polytopes of a graph,\u201dOperations Research Letters 6 (1987) 239\u2013242.","journal-title":"Operations Research Letters"},{"key":"CR8","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 and M.R. Rao, \u201cOdd minimum cuts andb-matchings,\u201dMathematics of Operations Research 7 (1982) 67\u201380.","journal-title":"Mathematics of Operations Research"},{"key":"CR9","volume-title":"Faces of Matching Polyhedra","author":"W.R. Pulleyblank","year":"1973","unstructured":"W.R. Pulleyblank,Faces of Matching Polyhedra, Ph.D. Thesis (University of Waterloo, Ont., Canada, 1973)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581694.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581694\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581694","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:12:20Z","timestamp":1556881940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581694"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":9,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["BF01581694"],"URL":"https:\/\/doi.org\/10.1007\/bf01581694","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}