{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,28]],"date-time":"2026-08-28T03:40:57Z","timestamp":1787888457398,"version":"build-2784847793"},"reference-count":25,"publisher":"Elsevier BV","issue":"3-5","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1999,3,4]],"date-time":"1999-03-04T00:00:00Z","timestamp":920505600000},"content-version":"vor","delay-in-days":154,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1998,10]]},"DOI":"10.1016\/s0167-6377(98)00037-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T09:07:44Z","timestamp":1027588064000},"page":"71-80","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":134,"title":["Efficient continuous-time dynamic network flow algorithms"],"prefix":"10.1016","volume":"23","author":[{"given":"L.","family":"Fleischer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"\u00c9.","family":"Tardos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(98)00037-6_BIB1","unstructured":"E.J. Anderson, P. Nash, Linear Programming in Infinite-Dimensional Spaces, Wiley, New York, 1987."},{"key":"10.1016\/S0167-6377(98)00037-6_BIB2","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1287\/moor.7.4.501","article-title":"A class of continuous network flow problems","volume":"7","author":"Anderson","year":"1982","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(98)00037-6_BIB3","doi-asserted-by":"crossref","unstructured":"E.J. Anderson, A.B. Philpott, A continuous-time network simplex algorithm, Networks 19 (1989) 395\u2013425.","DOI":"10.1002\/net.3230190403"},{"key":"10.1016\/S0167-6377(98)00037-6_BIB4","unstructured":"E.J. Anderson, A.B. Philpott, Optimisation of flows in networks over time, in: F.P. Kelly (Ed.), Probability, Statistics and Optimisation, Ch. 27, Wiley, New York, 1994, pp. 369\u2013382."},{"key":"10.1016\/S0167-6377(98)00037-6_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02216922","article-title":"A survey of dynamic network flows","volume":"20","author":"Aronson","year":"1989","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0167-6377(98)00037-6_BIB6","unstructured":"L. Fleischer, Faster algorithms for the quickest transshipment problem with zero transit times, Proc. 9th Annual ACM\/SIAM Symp. on Discrete Algorithms, 1998, pp. 147\u2013156; SIAM J. Optim., submitted."},{"key":"10.1016\/S0167-6377(98)00037-6_BIB7","unstructured":"L. Fleischer, Universally maximum flow with piecewise constant capacities, Technical Report TR-98-02, Columbia University, Computational Optimization Research Center, 1998."},{"key":"10.1016\/S0167-6377(98)00037-6_BIB8","unstructured":"L.R. Ford, D.R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, NJ, 1962."},{"key":"10.1016\/S0167-6377(98)00037-6_BIB9","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1307\/mmj\/1028998140","article-title":"Transient flows in networks","volume":"6","author":"Gale","year":"1959","journal-title":"Michigan Math. J."},{"key":"10.1016\/S0167-6377(98)00037-6_BIB10","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1002\/net.3230140308","article-title":"Optimal dynamic routing in communication networks with continuous traffic","volume":"14","author":"Hajek","year":"1984","journal-title":"Networks"},{"key":"10.1016\/S0167-6377(98)00037-6_BIB11","unstructured":"B. Hoppe, Efficient dynamic network flow algorithms, Ph.D. Thesis, Cornell University, June 1995; Department of Computer Science Technical Report TR95-1524."},{"key":"10.1016\/S0167-6377(98)00037-6_BIB12","unstructured":"B. Hoppe,\u00c9. Tardos, Polynomial time algorithms for some evacuation problems, Proc. of 5th Ann. ACM-SIAM Symp. on Discrete Algorithms, 1994, pp. 433\u2013441."},{"key":"10.1016\/S0167-6377(98)00037-6_BIB13","unstructured":"B. Hoppe,\u00c9. Tardos, The quickest transshipment problem, Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms, 1995, pp. 512\u2013521."},{"key":"10.1016\/S0167-6377(98)00037-6_BIB14","unstructured":"B. Klinz, personal communication."},{"key":"10.1016\/S0167-6377(98)00037-6_BIB15","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01585506","article-title":"Optimal flows in networks with multiple sources and sinks","volume":"7","author":"Megiddo","year":"1974","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(98)00037-6_BIB16","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1287\/opre.21.2.517","article-title":"Maximal, lexicographic, and dynamic network flows","volume":"21","author":"Minieka","year":"1973","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(98)00037-6_BIB17","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1002\/net.3230180405","article-title":"Minimum-delay routing in continuous-time dynamic networks with piecewise-constant capacities","volume":"18","author":"Ogier","year":"1988","journal-title":"Networks"},{"key":"10.1016\/S0167-6377(98)00037-6_BIB18","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0167-6377(94)00035-5","article-title":"On continuous network flows","volume":"17","author":"Orda","year":"1995","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(98)00037-6_BIB19","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1287\/moor.15.4.640","article-title":"Continuous-time flows in networks","volume":"15(4)","author":"Philpott","year":"1990","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(98)00037-6_BIB20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230260102","article-title":"An adaptive discretization method for a class of continuous network programs","volume":"26","author":"Philpott","year":"1995","journal-title":"Networks"},{"key":"10.1016\/S0167-6377(98)00037-6_BIB21","doi-asserted-by":"crossref","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 (Ed.), Handbooks in Operations Research and Management Science: Networks, Elsevier, Amsterdam, 1995.","DOI":"10.1016\/S0927-0507(05)80107-0"},{"key":"10.1016\/S0167-6377(98)00037-6_BIB22","doi-asserted-by":"crossref","first-page":"1558","DOI":"10.1137\/0331073","article-title":"An algorithm for a class of continuous linear programs","volume":"31(6)","author":"Pullan","year":"1993","journal-title":"SIAM J. Control Optim."},{"key":"10.1016\/S0167-6377(98)00037-6_BIB23","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1137\/S1052623495288180","article-title":"A study of general dynamic network programs with arc time-delays","volume":"7","author":"Pullan","year":"1997","journal-title":"SIAM J. Optim."},{"key":"10.1016\/S0167-6377(98)00037-6_BIB24","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1287\/opre.19.7.1602","article-title":"An algorithm for universal maximal dynamic flows in a network","volume":"19","author":"Wilkinson","year":"1971","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(98)00037-6_BIB25","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01580132","article-title":"A bad network problem for the simplex method and other minimum cost flow algorithms","volume":"5","author":"Zadeh","year":"1973","journal-title":"Math. Programming"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000376?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000376?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:42Z","timestamp":1759098822000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637798000376"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":25,"journal-issue":{"issue":"3-5","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["S0167637798000376"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(98)00037-6","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1998,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient continuous-time dynamic network flow algorithms","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0167-6377(98)00037-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}