{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T20:54:59Z","timestamp":1672260899895},"reference-count":14,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"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":4429,"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":[[2001,6]]},"DOI":"10.1016\/s0166-218x(00)00252-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:59:10Z","timestamp":1027634350000},"page":"301-315","source":"Crossref","is-referenced-by-count":10,"title":["A cycle augmentation algorithm for minimum cost multicommodity flows on a ring"],"prefix":"10.1016","volume":"110","author":[{"given":"Bruce","family":"Shepherd","sequence":"first","affiliation":[]},{"given":"Lisa","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00252-3_BIB1","first-page":"50","article-title":"Ring networks to the rescue","author":"Clendening","year":"1992","journal-title":"Telephone Engnr. Manage."},{"key":"10.1016\/S0166-218X(00)00252-3_BIB2","series-title":"Combinatorial Optimization","author":"Cook","year":"1998"},{"key":"10.1016\/S0166-218X(00)00252-3_BIB3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF02110141","article-title":"An optimization problem related to balancing loads on SONET rings","volume":"3","author":"Cosares","year":"1994","journal-title":"Telecomm. Systems"},{"key":"10.1016\/S0166-218X(00)00252-3_BIB4","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","article-title":"Maximal flow through a network","volume":"8","author":"Ford","year":"1956","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0166-218X(00)00252-3_BIB5","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/0095-8956(85)90046-2","article-title":"Edge-disjoint paths in planar graphs","volume":"39","author":"Frank","year":"1985","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0166-218X(00)00252-3_BIB6","unstructured":"A. Frank, B. Shepherd, V. Tandon, Z. Vegh, Node-capacitated routing in a ring network, 1998, submitted for publication."},{"key":"10.1016\/S0166-218X(00)00252-3_BIB7","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1145\/76359.76368","article-title":"Finding minimum-cost circulations by canceling negative cycles","volume":"36","author":"Goldberg","year":"1989","journal-title":"J ACM"},{"key":"10.1016\/S0166-218X(00)00252-3_BIB8","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\/S0166-218X(00)00252-3_BIB9","first-page":"36","article-title":"A polynomial time approximation scheme for the SONET ring loading problem","author":"Khanna","year":"1997","journal-title":"Bell Labs Tech. J. Spring"},{"key":"10.1016\/S0166-218X(00)00252-3_BIB10","series-title":"Paths, Flows and VLSI-Layout","author":"Korte","year":"1990"},{"key":"10.1016\/S0166-218X(00)00252-3_BIB11","doi-asserted-by":"crossref","unstructured":"D. Mitra, J.A. Morrison, K.G. Ramakrishnan, Virtual private networks: joint resource allocation and routing design, Proceedings of IEEE INFOCOM 99, April, 1999, pp. 480\u2013490.","DOI":"10.1109\/INFCOM.1999.751381"},{"key":"10.1016\/S0166-218X(00)00252-3_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 B"},{"issue":"1","key":"10.1016\/S0166-218X(00)00252-3_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0895480195294994","article-title":"The ring loading problem","volume":"11","author":"Schrijver","year":"1998","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(00)00252-3_BIB14","doi-asserted-by":"crossref","unstructured":"K. Wayne, A polynomial combinatorial algorithm for generalized minimum cost flow, Proceedings of STOC \u201999, 1999, pp. 11\u201318.","DOI":"10.1145\/301250.301261"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002523?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002523?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T18:50:06Z","timestamp":1555699806000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00002523"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":14,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0166218X00002523"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00252-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}