{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T07:21:44Z","timestamp":1774941704891,"version":"3.50.1"},"reference-count":24,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"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":8812,"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":[[1989,6]]},"DOI":"10.1016\/0095-8956(89)90052-x","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T09:37:08Z","timestamp":1107941828000},"page":"306-337","source":"Crossref","is-referenced-by-count":17,"title":["Decomposition and optimization over cycles in binary matroids"],"prefix":"10.1016","volume":"46","author":[{"given":"M","family":"Gr\u00f6tschel","sequence":"first","affiliation":[]},{"given":"K","family":"Truemper","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(89)90052-X_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(89)90052-X_BIB2","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/0095-8956(86)90063-8","article-title":"On the cycle polytope of a binary matroid","volume":"40","author":"Barahona","year":"1986","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(89)90052-X_BIB3_1","series-title":"An application of combinatorial optimization to statistical physics and circuit layout design","author":"Barahona","year":"1986"},{"key":"10.1016\/0095-8956(89)90052-X_BIB3_2","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1287\/opre.36.3.493","volume":"36","author":"Barahona","year":"1988","journal-title":"Oper. Res."},{"key":"10.1016\/0095-8956(89)90052-X_BIB4","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02592023","article-title":"On the cut polytope","volume":"36","author":"Barahona","year":"1986","journal-title":"Math. Programming"},{"key":"10.1016\/0095-8956(89)90052-X_BIB5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/moor.13.1.99","article-title":"An almost linear-time algorithm for graph realization","volume":"13","author":"Bixby","year":"1988","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0095-8956(89)90052-X_BIB6","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1145\/3149.3154","article-title":"The travelling salesman problem in graphs with 3-edge cutsets","volume":"32","author":"Cornu\u00e9jols","year":"1985","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0095-8956(89)90052-X_BIB7","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(89)90052-X_BIB8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0022-0000(80)90042-2","article-title":"An efficient PQ-graph algorithm for solving the graph realization problem","volume":"21","author":"Fujishige","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0095-8956(89)90052-X_BIB9","author":"Garey","year":"1979"},{"key":"10.1016\/0095-8956(89)90052-X_BIB10","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\/0095-8956(89)90052-X_BIB11","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0204019","article-title":"Finding a maximum cut of a planar graph in polynomial time","volume":"4","author":"Hadlock","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0095-8956(89)90052-X_BIB12","first-page":"502","article-title":"Finding the maximum cut in a graph","volume":"10","author":"Orlova","year":"1972","journal-title":"Eng. Cybernetics"},{"key":"10.1016\/0095-8956(89)90052-X_BIB13","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."},{"key":"10.1016\/0095-8956(89)90052-X_BIB14","article-title":"Algorithmic Applications of Connectivity and Related Topics in Matroid Theory","author":"Rajan","year":"1986"},{"key":"10.1016\/0095-8956(89)90052-X_BIB15","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0095-8956(80)90075-1","article-title":"Decomposition of regular matroids","volume":"28","author":"Seymour","year":"1980","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(89)90052-X_BIB16","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 J. Combin."},{"key":"10.1016\/0095-8956(89)90052-X_BIB17","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/S0195-6698(84)80041-4","article-title":"Partial matroid representations","volume":"5","author":"Truemper","year":"1984","journal-title":"European J. Combin."},{"key":"10.1016\/0095-8956(89)90052-X_BIB18","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0095-8956(85)90037-1","article-title":"A decomposition theory for matroids. I. General results","volume":"39","author":"Truemper","year":"1985","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(89)90052-X_BIB19","doi-asserted-by":"crossref","unstructured":"K. Truemper, A decomposition theory for matroids. IV. Decomposition of graphs, J. Combin. Theory Ser. B, in press.","DOI":"10.1016\/0095-8956(88)90073-1"},{"key":"10.1016\/0095-8956(89)90052-X_BIB20","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0095-8956(88)90073-1","article-title":"A decomposition theory for matroids. V. Testing of matrix total unimodularity","volume":"45","author":"Truemper","year":"1988","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(89)90052-X_BIB21","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1007\/BF01594196","article-title":"\u00dcber eine Eigenschaft der ebenen Komplexe","volume":"114","author":"Wagner","year":"1937","journal-title":"Math. Ann."},{"key":"10.1016\/0095-8956(89)90052-X_BIB22","author":"Welsh","year":"1976"},{"key":"10.1016\/0095-8956(89)90052-X_BIB23","unstructured":"Cunningham and Edmonds (unpublished)."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589568990052X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589568990052X?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:53:07Z","timestamp":1548759187000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009589568990052X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["009589568990052X"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(89)90052-x","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}