{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:33:21Z","timestamp":1771025601741,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ZOR - Methods and Models of Operations Research"],"published-print":{"date-parts":[[1993,2]]},"DOI":"10.1007\/bf01415527","type":"journal-article","created":{"date-parts":[[2005,4,3]],"date-time":"2005-04-03T12:32:18Z","timestamp":1112531538000},"page":"31-58","source":"Crossref","is-referenced-by-count":87,"title":["The quickest flow problem"],"prefix":"10.1007","volume":"37","author":[{"given":"Rainer E.","family":"Burkard","sequence":"first","affiliation":[]},{"given":"Karin","family":"Dlaska","sequence":"additional","affiliation":[]},{"given":"Bettina","family":"Klinz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","first-page":"1","volume":"24","author":"JH Ahrens","year":"1980","unstructured":"Ahrens JH, Finke G (1980) Primal transportation and transshipment algorithms.Zeitschrift f\u00fcr Operations Research 24:1?32","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"CR2","first-page":"211","volume-title":"Handbooks in OR & MS, Vol. 1","author":"RK Ahuja","year":"1989","unstructured":"Ahuja RK, Magnanti T, Orlin JB (1989) Network Flows. In: GL Nemhauser et al. (eds.),Handbooks in OR & MS, Vol. 1, North Holland, Amsterdam, 211?369"},{"key":"CR3","unstructured":"Ahuja RK, Orlin JB (1991) Scaling algorithms for the constrained maximum flow problem, talk presented at the 14-th International Symposium on Mathematical Programming, Amsterdam"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1287\/opre.37.1.159","volume":"37","author":"AI Ali","year":"1989","unstructured":"Ali AI, Padman R, Thiagaran H (1989) Dual algorithms for pure network problems.Operations Research 37:159?171","journal-title":"Operations Research"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02216922","volume":"20","author":"JE Aronson","year":"1989","unstructured":"Aronson JE (1989) A survey on dynamic network flows.Annals of Operations Research 20:1?66","journal-title":"Annals of Operations Research"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02288322","volume":"13","author":"DP Bertsekas","year":"1988","unstructured":"Bertsekas DP, Tseng P (1988) The relax codes for linear minimum cost network flow problems.Annals of Operations Research 13:125?190","journal-title":"Annals of Operations Research"},{"key":"CR7","volume-title":"RELAXT-III: A new and improved version of the RELAX code, LIDS Report P-1990","author":"DP Bertsekas","year":"1990","unstructured":"Bertsekas DP, Tseng P (1990) RELAXT-III: A new and improved version of the RELAX code, LIDS Report P-1990, Laboratory for Information and Decision Systems, MIT, Cambridge, MA"},{"key":"CR8","volume-title":"The quickest disjoint flow problem. Technical Report 189-91","author":"RE Burkard","year":"1991","unstructured":"Burkard RE, Dlaska K, Kellerer H (1991) The quickest disjoint flow problem. Technical Report 189-91, Institute of Mathematics, University of Technology, Graz, Austria"},{"key":"CR9","volume-title":"The quickest flow problem. Technical Report 188-91","author":"RE Burkard","year":"1991","unstructured":"Burkard RE, Dlaska K, Klinz B (1991) The quickest flow problem. Technical Report 188-91, Institute of Mathematics, University of Technology, Graz, Austria (also available as Rutcor Research Report RRR # 57-91, Rutgers University, New Brunswick, NJ, 1991)"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/BF02591893","volume":"5","author":"PJ Carstensen","year":"1983","unstructured":"Carstensen PJ (1983) Complexity of some parametric integer and network programming problems.Mathematical Programming 5:64?75","journal-title":"Mathematical Programming"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/mnsc.28.1.86","volume":"28","author":"LG Chalmet","year":"1982","unstructured":"Chalmet LG, Francis RL, Saunders PB (1982) Network models for building evacuation.Management Science 28:86?105","journal-title":"Management Science"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0305-0548(90)90039-A","volume":"17","author":"YL Chen","year":"1990","unstructured":"Chen YL, Chin YH (1990) The quickest path problem.Computers and Operations Research 17:153?161","journal-title":"Computers and Operations Research"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF01415937","volume":"33","author":"U Derigs","year":"1989","unstructured":"Derigs U, Meier W (1989) Implementing Goldberg's max-flow algorithm, a computational investigation.Zeitschrift f\u00fcr Operations Research 33:383?403","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0377-2217(90)90136-Y","volume":"46","author":"U Derigs","year":"1990","unstructured":"Derigs U, Meier W (1990) Goldrmf\/Goldnet-max-flow program.European Journal of Operational Research 46:260","journal-title":"European Journal of Operational Research"},{"key":"CR15","volume-title":"Flows in Networks","author":"LR Ford","year":"1962","unstructured":"Ford LR, Fulkerson DR (1962)Flows in Networks, Princeton University Press, New Jersey"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02288320","volume":"13","author":"G Gallo","year":"1988","unstructured":"Gallo G, Pallottino S (1988) Shortest path algorithms.Annals of Operations Research 13:3?79","journal-title":"Annals of Operations Research"},{"key":"CR17","volume-title":"Efficient Parallel Algorithms","author":"A Gibbons","year":"1988","unstructured":"Gibbons A, Rytter W (1988)Efficient Parallel Algorithms, Cambridge University Press, Cambridge"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BFb0121089","volume":"26","author":"MD Grigoriadis","year":"1986","unstructured":"Grigoriadis MD (1986) An efficient implementation of the network simplex method.Mathematical Programming Study 26:83?111","journal-title":"Mathematical Programming Study"},{"key":"CR19","volume-title":"Min cost and time minimizing dynamic flows, Research Report No. 83-16","author":"HW Hamacher","year":"1983","unstructured":"Hamacher HW (1983) Min cost and time minimizing dynamic flows, Research Report No. 83-16, Industrial & Systems Engineering Department, University of Florida, Gainesville"},{"key":"CR20","doi-asserted-by":"crossref","unstructured":"Hamacher HW (1989) Temporally repeated flow algorithms for dynamic min cost flows,Proceedings of the 28-th IEEE Conference on Decision and Control","DOI":"10.1109\/CDC.1989.70312"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02591871","volume":"26","author":"T Ibaraki","year":"1983","unstructured":"Ibaraki T (1983) Parametric approaches to fractional programs.Mathematical Programming 26:345?362","journal-title":"Mathematical Programming"},{"key":"CR22","unstructured":"Iwano K, Misono S, Tezuka S, Fujishige S (1990) A new scaling algorithm for the maximum mean cut problem. IBM Research Report RT 0049, Tokyo, Japan"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1287\/mnsc.28.1.106","volume":"28","author":"JR Jarvis","year":"1982","unstructured":"Jarvis JR, Ratliff DH (1982) Some equivalent objectives for dynamic network flow problems.Management Science 28:106?109","journal-title":"Management Science"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0166-218X(81)90026-3","volume":"3","author":"RM Karp","year":"1981","unstructured":"Karp RM, Orlin JB (1981) Parametric shortest path algorithms with an application to cyclic staffing.Discrete Applied Mathematics 3:37?45","journal-title":"Discrete Applied Mathematics"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","volume":"20","author":"D Klingman","year":"1974","unstructured":"Klingman D, Napier A, Stutz S (1974) Netgen: A program for generating large scale capacitated assignment, transportation and minimum cost flow problems.Management Science 20: 814?821","journal-title":"Management Science"},{"key":"CR26","volume-title":"Minimum concave-cost network flow problems with a single nonlinear arc cost, Technical Report 191-91","author":"B Klinz","year":"1991","unstructured":"Klinz B, Tuy H (1991) Minimum concave-cost network flow problems with a single nonlinear arc cost, Technical Report 191-91, Institute of Mathematics, University of Technology, Graz, Austria"},{"key":"CR27","unstructured":"McCormick TS, Ervolina TR (1990) Computing maximum mean cuts, UBC Faculty of Commerce Working Paper 90-MSC-011, Vancouver, BC"},{"key":"CR28","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/moor.4.4.414","volume":"4","author":"N Megiddo","year":"1979","unstructured":"Megiddo N (1979) Combinatorial optimization with rational objective functions.Mathematics of Operations Research 4:414?424","journal-title":"Mathematics of Operations Research"},{"key":"CR29","first-page":"852","volume":"30","author":"N Megiddo","year":"1983","unstructured":"Megiddo N (1983) Applying parallel computation algorithms in the design of serial algorithms.Journal of the A. C. M. 30:852?865","journal-title":"Journal of the A. C. M."},{"key":"CR30","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1287\/opre.21.2.517","volume":"21","author":"E Minieka","year":"1973","unstructured":"Minieka E (1973) Maximal, lexicographic, and dynamic network flows.Operations Research 21:517?527","journal-title":"Operations Research"},{"key":"CR31","volume-title":"Linear Programming","author":"KG Murty","year":"1983","unstructured":"Murty KG (1983)Linear Programming, John Wiley & Sons, New York"},{"key":"CR32","doi-asserted-by":"crossref","unstructured":"Orlin JB (1988) A faster strongly polynomial minimum cost flow algorithm,Proc. 20-th Annual Symp. Theory of Computing 377?387","DOI":"10.21236\/ADA457044"},{"key":"CR33","unstructured":"Orlin JB (1992) Private communication"},{"key":"CR34","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01586040","volume":"54","author":"JB Orlin","year":"1992","unstructured":"Orlin JB, Ahuja RK (1992) New scaling algorithms for the assignment and minimum mean cycle problems.Mathematical Programming 54:41?56","journal-title":"Mathematical Programming"},{"key":"CR35","volume-title":"Minimizing capacity violations in a transshipment network, Technical Report","author":"T Radzik","year":"1991","unstructured":"Radzik T (1991) Minimizing capacity violations in a transshipment network, Technical Report, Computer Science Department, Stanford University, CA"},{"key":"CR36","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/0305-0548(91)90063-W","volume":"18","author":"JB Rosen","year":"1991","unstructured":"Rosen JB, Sun S-Z, Xue G-L (1991) Algorithms for the quickest path problem and the enumeration of quickest paths.Computers and Operations Research 18:579?584","journal-title":"Computers and Operations Research"},{"key":"CR37","unstructured":"Rote G (1991) Private communication"},{"key":"CR38","volume-title":"Mathematics and Its Applications, Volume 69","author":"G Ruhe","year":"1991","unstructured":"Ruhe G (1991)Algorithmic Aspects of Flows in Networks, Mathematics and Its Applications, Volume 69, Kluwer Academic Publishers, Doortrecht"},{"key":"CR39","volume-title":"Mathematical Systems in Economics 42","author":"S Schaible","year":"1978","unstructured":"Schaible S (1978)Analyse und Anwendungen von Quotientenprogrammen ? Ein Beitrag zur Planung mit Hilfe der nichtlinearen Programmierung, (in German), Mathematical Systems in Economics 42, Verlag Anton Hain, Meisenheim am Glan"},{"key":"CR40","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0377-2217(83)90153-4","volume":"12","author":"S Schaible","year":"1983","unstructured":"Schaible S, Ibaraki T (1983) Fractional programming.European Journal of Operational Research 12:325?338","journal-title":"European Journal of Operational Research"},{"key":"CR41","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/net.3230210206","volume":"21","author":"NE Young","year":"1991","unstructured":"Young NE, Tarjan RE, Orlin JB (1991) Faster parametric shortest path minimum-balance algorithms.Networks 21:205?221","journal-title":"Networks"},{"key":"CR42","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01580132","volume":"5","author":"N Zadeh","year":"1973","unstructured":"Zadeh N (1973) A bad network problem for the simplex method and other minimum cost flow algorithms.Mathematical Programming 5:255?266","journal-title":"Mathematical Programming"}],"container-title":["ZOR Zeitschrift f\ufffdr Operations Research Methods and Models of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01415527.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01415527\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01415527","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T10:06:01Z","timestamp":1556877961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01415527"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["BF01415527"],"URL":"https:\/\/doi.org\/10.1007\/bf01415527","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}