{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T01:22:14Z","timestamp":1781659334211,"version":"3.54.5"},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1986,2,1]],"date-time":"1986-02-01T00:00:00Z","timestamp":507600000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10028,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1986,2]]},"DOI":"10.1016\/0095-8956(86)90063-8","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T09:37:08Z","timestamp":1107941828000},"page":"40-62","source":"Crossref","is-referenced-by-count":66,"title":["On the cycle polytope of a binary matroid"],"prefix":"10.1016","volume":"40","author":[{"given":"F","family":"Barahona","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M","family":"Gr\u00f6tschel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(86)90063-8_BIB1","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0167-6377(83)90016-0","article-title":"The max cut problem in graphs not contractible to K5","volume":"2","author":"Barahona","year":"1983","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0095-8956(86)90063-8_BIB2","author":"Barahona","year":"1983"},{"key":"10.1016\/0095-8956(86)90063-8_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":"69B","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"10.1016\/0095-8956(86)90063-8_BIB4","series-title":"Combinatorial Structures and Their Applications","first-page":"89","article-title":"Matching: A well solved class of integer linear programs","author":"Edmonds","year":"1970"},{"key":"10.1016\/0095-8956(86)90063-8_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\/0095-8956(86)90063-8_BIB6","author":"Gastou","year":"1982"},{"key":"10.1016\/0095-8956(86)90063-8_BIB7","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1137\/0602021","article-title":"Adjacency on the postman polyhedron","volume":"2","author":"Giles","year":"1981","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0095-8956(86)90063-8_BIB8","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","article-title":"Some polyhedra related to combinatorial problems","volume":"2","author":"Gomory","year":"1969","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/0095-8956(86)90063-8_BIB9","series-title":"Mathematical Programming\u2014The State of the Art: Bonn 1982","first-page":"439","article-title":"Min-Max Results in Combinatorial Optimization","author":"Schrijver","year":"1983"},{"key":"10.1016\/0095-8956(86)90063-8_BIB10","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0195-6698(81)80033-9","article-title":"Matroids and multicommodity flows","volume":"2","author":"Seymour","year":"1981","journal-title":"European Journal of Combinatorics"},{"key":"10.1016\/0095-8956(86)90063-8_BIB11","author":"Welsh","year":"1976"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895686900638?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895686900638?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T10:55:48Z","timestamp":1548759348000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895686900638"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,2]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,2]]}},"alternative-id":["0095895686900638"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(86)90063-8","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1986,2]]}}}