{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T15:21:46Z","timestamp":1772637706939,"version":"3.50.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"4-5","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"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":[[1998,5]]},"DOI":"10.1016\/s0167-6377(98)00009-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:14:29Z","timestamp":1027624469000},"page":"119-127","source":"Crossref","is-referenced-by-count":11,"title":["One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs"],"prefix":"10.1016","volume":"22","author":[{"given":"Bettina","family":"Klinz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(98)00009-1_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02216922","article-title":"A survey on dynamic network flows","volume":"20","author":"Aronson","year":"1989","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0167-6377(98)00009-1_BIB2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01415527","article-title":"The quickest flow problem","volume":"37","author":"Burkard","year":"1993","journal-title":"ZOR Meth. Models Oper. Res."},{"key":"10.1016\/S0167-6377(98)00009-1_BIB3","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1287\/opre.6.3.419","article-title":"Constructing maximal dynamic flows from static flows","volume":"6","author":"Ford","year":"1958","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(98)00009-1_BIB4","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979."},{"key":"10.1016\/S0167-6377(98)00009-1_BIB5","unstructured":"B. Hoppe, \u00c9. Tardos, Polynomial time algorithms for some evacuation problems, in: Proc. 5th Annual ACM-SIAM Symp. on Discrete Algorithms, 1994, pp. 433\u2013441."},{"key":"10.1016\/S0167-6377(98)00009-1_BIB6","unstructured":"B. Hoppe, \u00c9. Tardos, The quickest transshipment problem, in: Proc. 6th Annual ACM-SIAM Symp. on Discrete Algorithms, 1995, pp. 512\u2013521."},{"key":"10.1016\/S0167-6377(98)00009-1_BIB7","doi-asserted-by":"crossref","unstructured":"B. Klinz, G.J. Woeginger, Minimum cost dynamic flows: the series-parallel case, in: Proc. 4th Internat. IPCO Conf., in: E. Balas, J. Clausen (Eds.), Lecture Notes in Computer Science, vol. 920, Springer, Berlin, 1995, pp. 329\u2013343.","DOI":"10.1007\/3-540-59408-6_62"},{"key":"10.1016\/S0167-6377(98)00009-1_BIB8","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0166-218X(93)90050-X","article-title":"Computing the throughput of a network with dedicated lines","volume":"42","author":"Papadimitriou","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-6377(98)00009-1_BIB9","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/moor.9.2.190","article-title":"Minimum convex cost dynamic network flows","volume":"9","author":"Orlin","year":"1984","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(98)00009-1_BIB10","unstructured":"W.B. Powell, P. Jaillet, A. Odoni, Stochastic and dynamic networks and routing, in: M.O. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser (Eds.), Handbooks in Operations Research and Management Science: Network Routing, vol. 8, Elsevier, Amsterdam, 1995, pp. 141\u2013295."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000091?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000091?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T04:54:27Z","timestamp":1555563267000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637798000091"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":10,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["S0167637798000091"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(98)00009-1","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}