{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T23:33:12Z","timestamp":1786145592795,"version":"3.56.0"},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0167-6377(03)00070-1","type":"journal-article","created":{"date-parts":[[2003,7,7]],"date-time":"2003-07-07T09:48:54Z","timestamp":1057571334000},"page":"31-35","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":12,"title":["The MA-ordering max-flow algorithm is not strongly polynomial for directed networks"],"prefix":"10.1016","volume":"32","author":[{"given":"Akiyoshi","family":"Shioura","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(03)00070-1_BIB1","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","article-title":"Theoretical improvements in algorithmic efficiency for network flow problems","volume":"19","author":"Edmonds","year":"1972","journal-title":"J. ACM"},{"key":"10.1016\/S0167-6377(03)00070-1_BIB2","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/S0167-6377(02)00237-7","article-title":"A maximum flow algorithm using MA ordering","volume":"31","author":"Fujishige","year":"2003","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(03)00070-1_BIB3","unstructured":"S. Fujishige, S. Isotani, New maximum flow algorithms by MA ordering and scaling, Proceedings of the Third Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, 2003, pp. 186\u2013193."},{"key":"10.1016\/S0167-6377(03)00070-1_BIB4","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0167-6377(00)00059-6","article-title":"Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks","volume":"27","author":"McCormick","year":"2000","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(03)00070-1_BIB5","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1287\/moor.5.2.258","article-title":"Theoretical efficiency of the algorithm \u2018Capacity\u2019 for the maximum flow problem","volume":"5","author":"Queyranne","year":"1980","journal-title":"Math. Oper. Res."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637703000701?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637703000701?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T22:33:34Z","timestamp":1759098814000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637703000701"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0167637703000701"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(03)00070-1","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The MA-ordering max-flow algorithm is not strongly polynomial for directed networks","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0167-6377(03)00070-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}