{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T20:22:33Z","timestamp":1773087753656,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"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":8478,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1990,5]]},"DOI":"10.1016\/0166-218x(90)90134-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"125-145","source":"Crossref","is-referenced-by-count":9,"title":["Multicommodity flows in certain planar directed networks"],"prefix":"10.1016","volume":"27","author":[{"given":"Hiroshi","family":"Nagamochi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshihide","family":"Ibaraki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90134-X_BIB1","series-title":"CORE discussion paper 7212","article-title":"Multicommodity maximum flow in planar networks (The D-algorithm approach","author":"Diaz","year":"1972"},{"key":"10.1016\/0166-218X(90)90134-X_BIB2","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/0166-218X(90)90134-X_BIB3","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/opre.11.3.344","article-title":"Multi-commodity network flows","volume":"11","author":"Hu","year":"1963","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(90)90134-X_BIB4","series-title":"International Seminar on Operations Research and Systems","first-page":"227","article-title":"Heuristic algorithms for multi-item multi-stage production scheduling based on the network flow concept","author":"Ibaraki","year":"1985"},{"key":"10.1016\/0166-218X(90)90134-X_BIB5","series-title":"Bachelor Thesis","article-title":"Performance evaluation of the algorithms for some multicommodity flow problem","author":"Ito","year":"1985"},{"key":"10.1016\/0166-218X(90)90134-X_BIB6","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","article-title":"A new polynomial-time algorithm for linear programming","volume":"4","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"key":"10.1016\/0166-218X(90)90134-X_BIB7","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/opre.26.2.209","article-title":"A survey of linear cost multicommodity network flows","volume":"26","author":"Kennington","year":"1978","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(90)90134-X_BIB8","series-title":"Algorithms for Network Programming","author":"Kennington","year":"1980"},{"issue":"5","key":"10.1016\/0166-218X(90)90134-X_BIB9_1","first-page":"1093","article-title":"A polynomial algorithm in linear programming","volume":"244","author":"Khachiyan","year":"1979","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"1","key":"10.1016\/0166-218X(90)90134-X_BIB9_2","first-page":"191","volume":"20","author":"Khachiyan","year":"1979","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0166-218X(90)90134-X_BIB10","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1137\/0214023","article-title":"An efficient algorithm for finding multicommodity flows in planar graphs","volume":"14","author":"Matsumoto","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90134-X_BIB11","series-title":"Doctoral Dissertation","article-title":"Studies on multicommodity flows in directed networks","author":"Nagamochi","year":"1988"},{"key":"10.1016\/0166-218X(90)90134-X_BIB12","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0095-8956(81)80012-3","article-title":"Multicommodity flows in planar graphs","volume":"31","author":"Okamura","year":"1981","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(90)90134-X_BIB13","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0167-6377(86)90011-8","article-title":"A dual version of Tardos's algorithm for linear programming","volume":"5","author":"Orlin","year":"1986","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0166-218X(90)90134-X_BIB14","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.34.2.250","article-title":"A strongly polynomial algorithm to solve combinatorial linear programs","volume":"34","author":"Tardos","year":"1986","journal-title":"Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090134X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090134X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:56:51Z","timestamp":1555120611000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090134X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["0166218X9090134X"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90134-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}