{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T01:46:42Z","timestamp":1695952002121},"reference-count":21,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2005,11,1]],"date-time":"2005-11-01T00:00:00Z","timestamp":1130803200000},"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":[[2005,11]]},"DOI":"10.1016\/j.orl.2004.12.001","type":"journal-article","created":{"date-parts":[[2005,1,11]],"date-time":"2005-01-11T12:29:51Z","timestamp":1105446591000},"page":"625-628","source":"Crossref","is-referenced-by-count":3,"title":["A fast algorithm for minimum weight odd circuits and cuts in planar graphs"],"prefix":"10.1016","volume":"33","author":[{"given":"Adam N.","family":"Letchford","sequence":"first","affiliation":[]},{"given":"Nicholas A.","family":"Pearson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2004.12.001_bib1","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0167-6377(83)90016-0","article-title":"The max-cut problem on graphs not contractible to K5","volume":"2","author":"Barahona","year":"1983","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.orl.2004.12.001_bib2","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. Program."},{"key":"10.1016\/j.orl.2004.12.001_bib3","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/PL00011381","article-title":"Set packing relaxations of some integer programs","volume":"88","author":"Bornd\u00f6rfer","year":"2000","journal-title":"Math. Program."},{"key":"10.1016\/j.orl.2004.12.001_bib4","unstructured":"B. Brejova, T. Vinar, Weihe's algorithm for maximum flow in planar graphs, University of Waterloo, unpublished manuscript, 1999."},{"key":"10.1016\/j.orl.2004.12.001_bib5","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0025-5610(96)00003-2","article-title":"{0,1\/2}-Chv\u00e1tal\u2013Gomory cuts","volume":"74","author":"Caprara","year":"1996","journal-title":"Math. Program."},{"key":"10.1016\/j.orl.2004.12.001_bib6","series-title":"Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004)","article-title":"A deterministic near-linear time algorithm for finding minimum cuts in planar graphs","author":"Chalermsook","year":"2004"},{"key":"10.1016\/j.orl.2004.12.001_bib7","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","volume":"34","author":"Fredman","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/j.orl.2004.12.001_bib8","series-title":"Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"434","article-title":"Data structures for weighted matching and nearest common ancestors with linking","author":"Gabow","year":"1990"},{"key":"10.1016\/j.orl.2004.12.001_bib9","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","article-title":"A new approach to the maximum flow problem","volume":"35","author":"Goldberg","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/j.orl.2004.12.001_bib10","series-title":"Geometric Algorithms and Combinatorial Optimization","author":"Gr\u00f6tschel","year":"1988"},{"key":"10.1016\/j.orl.2004.12.001_bib11","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0167-6377(81)90020-1","article-title":"Weakly bipartite graphs","volume":"1","author":"Gr\u00f6tschel","year":"1981","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.orl.2004.12.001_bib12","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/0095-8956(89)90052-X","article-title":"Decomposition and optimization over cycles in binary matroids","volume":"46","author":"Gr\u00f6tschel","year":"1989","journal-title":"J. Comb. Th. (B)"},{"key":"10.1016\/j.orl.2004.12.001_bib13","series-title":"Graph Theory","author":"Harary","year":"1994"},{"key":"10.1016\/j.orl.2004.12.001_bib14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1006\/jcss.1997.1493","article-title":"Faster shortest-path algorithms for planar graphs","volume":"55","author":"Henzinger","year":"1997","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.orl.2004.12.001_bib15","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1137\/0211056","article-title":"Hamiltonian paths in grid graphs","volume":"11","author":"Itai","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.orl.2004.12.001_bib16","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","article-title":"A separator theorem for planar graphs","volume":"36","author":"Lipton","year":"1979","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/j.orl.2004.12.001_bib17","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01582226","article-title":"Implementing an efficient minimum cut algorithm","volume":"67","author":"Nagamochi","year":"1994","journal-title":"Math. Program."},{"key":"10.1016\/j.orl.2004.12.001_bib18","series-title":"The Traveling Salesman Problem","first-page":"307","article-title":"Polyhedral computations","author":"Padberg","year":"1985"},{"key":"10.1016\/j.orl.2004.12.001_bib19","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\/j.orl.2004.12.001_bib20","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1006\/jcss.1997.1538","article-title":"Maximum (s,t)-flows in planar networks in O(|V|log|V|)-time","volume":"55","author":"Weihe","year":"1997","journal-title":"J. Comp. Sys. Sci."},{"key":"10.1016\/j.orl.2004.12.001_bib21","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","article-title":"Algorithm 232","volume":"7","author":"Williams","year":"1964","journal-title":"ACM Commun."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637704001646?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637704001646?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,7,3]],"date-time":"2021-07-03T21:52:40Z","timestamp":1625349160000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637704001646"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2005,11]]}},"alternative-id":["S0167637704001646"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2004.12.001","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2005,11]]}}}