{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T09:28:26Z","timestamp":1750411706550},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642291159"},{"type":"electronic","value":"9783642291166"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29116-6_21","type":"book-chapter","created":{"date-parts":[[2012,3,26]],"date-time":"2012-03-26T09:59:55Z","timestamp":1332755995000},"page":"247-260","source":"Crossref","is-referenced-by-count":9,"title":["Generalized Maximum Flows over Time"],"prefix":"10.1007","author":[{"given":"Martin","family":"Gro\u00df","sequence":"first","affiliation":[]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02216922","volume":"20","author":"J.E. Aronson","year":"1989","unstructured":"Aronson, J.E.: A survey of dynamic network flows. Annals of Operations Research\u00a020, 1\u201366 (1989)","journal-title":"Annals of Operations Research"},{"key":"21_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R.E. Bellman","year":"1958","unstructured":"Bellman, R.E.: On a routing problem. Quarterly of Applied Mathematics\u00a016, 87\u201390 (1958)","journal-title":"Quarterly of Applied Mathematics"},{"key":"21_CR3","unstructured":"Beygang, K., Krumke, S.O., Zeck, C.: Generalized max flow in series-parallel graphs. Report in Wirtschaftsmathematik 125, TU Kaiserslautern (2010)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Dantzig, G.B.: Linear programming and extensions. Princeton University Press (1962)","DOI":"10.7249\/R366"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1137\/S0097539703427215","volume":"36","author":"L. Fleischer","year":"2007","unstructured":"Fleischer, L., Skutella, M.: Quickest flows over time. SIAM Journal on Computing\u00a036, 1600\u20131630 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0167-6377(98)00037-6","volume":"23","author":"L.K. Fleischer","year":"1998","unstructured":"Fleischer, L.K., Tardos, \u00c9.: Efficient continuous-time dynamic network flow algorithms. Operations Research Letters\u00a023, 71\u201380 (1998)","journal-title":"Operations Research Letters"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s101070100238","volume":"91","author":"L.K. Fleischer","year":"2002","unstructured":"Fleischer, L.K., Wayne, K.D.: Fast and simple approximation schemes for generalized flow. Mathematical Programming\u00a091, 215\u2013238 (2002)","journal-title":"Mathematical Programming"},{"key":"21_CR9","unstructured":"Fleischer, L., Skutella, M.: Minimum cost flows over time without intermediate storage. In: Proceedings of the 14th Annual ACM\u2013SIAM Symposium on Discrete Algorithms, Baltimore, MD, pp. 66\u201375 (2003)"},{"key":"21_CR10","unstructured":"Ford, L.R.: Network flow theory. Paper P-923, The Rand Corporation (1956)"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press (1962)","DOI":"10.1515\/9781400875184"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"L.R. Ford","year":"1987","unstructured":"Ford, L.R., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Operations Research\u00a06, 419\u2013433 (1987)","journal-title":"Operations Research"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization problems. Journal of the ACM\u00a034, 596\u2013615 (1987)","journal-title":"Journal of the ACM"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1307\/mmj\/1028998140","volume":"6","author":"D. Gale","year":"1959","unstructured":"Gale, D.: Transient flows in networks. Michigan Mathematical Journal\u00a06, 59\u201363 (1959)","journal-title":"Michigan Mathematical Journal"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1287\/moor.16.2.351","volume":"16","author":"A.V. Goldberg","year":"1991","unstructured":"Goldberg, A.V., Plotkin, S.A., Tardos, \u00c9.: Combinatorial algorithms for the generalized circulation problem. Mathematics of Operations Research\u00a016, 351\u2013379 (1991)","journal-title":"Mathematics of Operations Research"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1287\/moor.21.3.529","volume":"21","author":"D. Goldfarb","year":"1996","unstructured":"Goldfarb, D., Jin, Z.: A faster combinatorial algorithm for the generalized circulation problem. Mathematics of Operations Research\u00a021, 529\u2013539 (1996)","journal-title":"Mathematics of Operations Research"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1287\/moor.22.4.793","volume":"22","author":"D. Goldfarb","year":"1997","unstructured":"Goldfarb, D., Jin, Z., Orlin, J.B.: Polynomial-time highest gain augmenting path algorithms for the generalized circulation problem. Mathematics of Operations Research\u00a022, 793\u2013802 (1997)","journal-title":"Mathematics of Operations Research"},{"key":"21_CR18","unstructured":"Gondran, M., Minoux, M.: Graphs and Algorithms. Wiley (1984)"},{"key":"21_CR19","unstructured":"Hoppe, B., Tardos, \u00c9.: Polynomial time algorithms for some evacuation problems. In: Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 433\u2013441 (1994)"},{"key":"#cr-split#-21_CR20.1","unstructured":"Kantorovich, L.V.: Mathematical methods of organizing and planning production. Technical report, Publication House of the Leningrad State University (1939)"},{"key":"#cr-split#-21_CR20.2","doi-asserted-by":"crossref","unstructured":"Translated in Management Science 6, 366-422 (1960)","DOI":"10.1287\/mnsc.6.4.366"},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1006\/jagm.1994.1044","volume":"17","author":"V. King","year":"1994","unstructured":"King, V., Rao, S., Tarjan, R.: A faster deterministic maximum flow algorithm. Journal of Algorithms\u00a017, 447\u2013474 (1994)","journal-title":"Journal of Algorithms"},{"key":"21_CR22","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1002\/net.10112","volume":"43","author":"B. Klinz","year":"2004","unstructured":"Klinz, B., Woeginger, G.J.: Minimum cost dynamic flows: The series parallel case. Networks\u00a043, 153\u2013162 (2004)","journal-title":"Networks"},{"key":"21_CR23","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1287\/opre.21.2.517","volume":"21","author":"E. Minieka","year":"1973","unstructured":"Minieka, E.: Maximal, lexicographic, and dynamic network flows. Operations Research\u00a021, 517\u2013527 (1973)","journal-title":"Operations Research"},{"key":"21_CR24","unstructured":"Moore, E.F.: The shortest path through a maze. In: Proceedings of the International Symposium on Switching, Part II, pp. 285\u2013292. Harvard University Press (1959)"},{"key":"21_CR25","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1109\/TCT.1966.1082612","volume":"13","author":"K. Onaga","year":"1966","unstructured":"Onaga, K.: Dynamic programming of optimum flows in lossy communication nets. IEEE Transactions on Circuit Theory\u00a013, 282\u2013287 (1966)","journal-title":"IEEE Transactions on Circuit Theory"},{"key":"21_CR26","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0016-0032(67)90046-4","volume":"283","author":"K. Onaga","year":"1967","unstructured":"Onaga, K.: Optimal flows in general communication networks. Journal of the Franklin Institute\u00a0283, 308\u2013327 (1967)","journal-title":"Journal of the Franklin Institute"},{"key":"21_CR27","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0927-0507(05)80107-0","volume-title":"Network Routing, ch. 3","author":"W.B. Powell","year":"1995","unstructured":"Powell, W.B., Jaillet, P., Odoni, A.: Stochastic and dynamic networks and routing. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Network Routing, ch. 3, vol.\u00a08, pp. 141\u2013295. Handbooks in Operations Research and Management Science, North\u2013Holland, Amsterdam, The Netherlands (1995)"},{"key":"21_CR28","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1287\/moor.23.1.69","volume":"23","author":"T. Radzik","year":"1998","unstructured":"Radzik, T.: Faster algorithms for the generalized network flow problem. Mathematics of Operations Research\u00a023, 69\u2013100 (1998)","journal-title":"Mathematics of Operations Research"},{"key":"21_CR29","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0304-3975(03)00403-1","volume":"312","author":"T. Radzik","year":"2004","unstructured":"Radzik, T.: Improving time bounds on maximum generalised flow computations by contracting the network. Theoretical Computer Science\u00a0312, 75\u201394 (2004)","journal-title":"Theoretical Computer Science"},{"key":"21_CR30","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10107-007-0183-8","volume":"118","author":"M. Restrepo","year":"2009","unstructured":"Restrepo, M., Williamson, D.P.: A simple gap-canceling algorithm for the generalized maximum flow problem. Mathematical Programming\u00a0118, 47\u201374 (2009)","journal-title":"Mathematical Programming"},{"key":"21_CR31","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-76796-1_21","volume-title":"Research Trends in Combinatorial Optimization","author":"M. Skutella","year":"2009","unstructured":"Skutella, M.: An introduction to network flows over time. In: Research Trends in Combinatorial Optimization, pp. 451\u2013482. Springer, Heidelberg (2009)"},{"key":"21_CR32","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1137\/0132037","volume":"32","author":"K. Truemper","year":"1977","unstructured":"Truemper, K.: On max flows with gains and pure min-cost flows. SIAM Journal on Applied Mathematics\u00a032, 450\u2013456 (1977)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"21_CR33","unstructured":"Wayne, K.D.: Generalized Maximum Flow Algorithms. PhD thesis, Cornell University (1999)"},{"key":"21_CR34","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1287\/moor.27.3.445.313","volume":"27","author":"K.D. Wayne","year":"2002","unstructured":"Wayne, K.D.: A polynomial combinatorial algorithm for generalized minimum cost flow. Mathematics of Operations Research\u00a027, 445\u2013459 (2002)","journal-title":"Mathematics of Operations Research"},{"key":"21_CR35","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1287\/opre.19.7.1602","volume":"19","author":"W.L. Wilkinson","year":"1971","unstructured":"Wilkinson, W.L.: An algorithm for universal maximal dynamic flows in a network. Operations Research\u00a019, 1602\u20131612 (1971)","journal-title":"Operations Research"},{"key":"21_CR36","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01580132","volume":"5","author":"N. Zadeh","year":"1973","unstructured":"Zadeh, N.: A bad network problem for the simplex method and other minimum cost flow algorithms. Mathematical Programming\u00a05, 255\u2013266 (1973)","journal-title":"Mathematical Programming"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29116-6_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:24:37Z","timestamp":1620127477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29116-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642291159","9783642291166"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29116-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}