{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T22:19:19Z","timestamp":1648678759961},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,2,25]],"date-time":"2010-02-25T00:00:00Z","timestamp":1267056000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1007\/s10852-010-9129-x","type":"journal-article","created":{"date-parts":[[2010,2,24]],"date-time":"2010-02-24T14:39:14Z","timestamp":1267022354000},"page":"291-309","source":"Crossref","is-referenced-by-count":0,"title":["Updating Network Flows Given Multiple, Heterogeneous Arc Attribute Changes"],"prefix":"10.1007","volume":"9","author":[{"given":"Elise","family":"Miller-Hooks","sequence":"first","affiliation":[]},{"given":"Hao","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Zhiying","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,2,25]]},"reference":[{"key":"9129_CR1","volume-title":"Network Flows Theory, Algorithms and Applications","author":"R Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows Theory, Algorithms and Applications. Prentice Hall, New Jersey (1993)"},{"key":"9129_CR2","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/0377-2217(86)90245-6","volume":"23","author":"A Ali","year":"1986","unstructured":"Ali, A., Allen, R., Barr, R., Kennington, J.: Reoptimization procedure for bounded variable primal simplex network algorithms. Eur. J. Oper. Res. 23, 256\u2013263 (1986)","journal-title":"Eur. J. Oper. Res."},{"key":"9129_CR3","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1287\/opre.37.1.159","volume":"37","author":"A Ali","year":"1989","unstructured":"Ali, A., Padman, R., Thiagarajan, H.: Dual algorithms for pure network problem. Oper. Res. 37, 159\u2013171 (1989)","journal-title":"Oper. Res."},{"key":"9129_CR4","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/ijoc.5.4.395","volume":"5","author":"M Amini","year":"1993","unstructured":"Amini, M., Barr, R.: Network reoptimization algorithms: a statistically designed comparison. ORSA J. Comput. 5, 395\u2013409 (1993)","journal-title":"ORSA J. Comput."},{"key":"9129_CR5","volume-title":"Dynamic Programming and Stochastic Control","author":"D Bertsekas","year":"1976","unstructured":"Bertsekas, D.: Dynamic Programming and Stochastic Control. Academic Press, New York (1976)"},{"key":"9129_CR6","volume-title":"Network Optimization: Continuous and Discrete Models","author":"D Bertsekas","year":"1998","unstructured":"Bertsekas, D.: Network Optimization: Continuous and Discrete Models. Athena Scientific, Massachusetts (1998)"},{"key":"9129_CR7","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF02288322","volume":"13","author":"D Bertsekas","year":"1988","unstructured":"Bertsekas, D., Tseng, P.: RELAX: a computer code for minimum cost network flow problems. Ann. Oper. Res. 13, 127\u2013190 (1988)","journal-title":"Ann. Oper. Res."},{"key":"9129_CR8","doi-asserted-by":"crossref","unstructured":"Busaker, R., Gowen, P.: A procedure for determining a family of minimum-cost network flow patterns. O. R. O. Technical Paper 15 (1961)","DOI":"10.21236\/AD0249662"},{"key":"9129_CR9","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1016\/S0377-2217(00)00059-X","volume":"131","author":"X Cai","year":"2001","unstructured":"Cai, X., Sha, D., Wong, C.: Time-varying minimum cost flow problems. Eur. J. Oper. Res. 131, 352\u2013374 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"9129_CR10","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1016\/0377-2217(88)90034-3","volume":"34","author":"M Desrochers","year":"1988","unstructured":"Desrochers, M., Soumis, F.: A reoptimization algorithm for the shortest path problem with time windows. Eur. J. Oper. Res. 34, 242\u2013254 (1988)","journal-title":"Eur. J. Oper. Res."},{"key":"9129_CR11","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19, 248\u2013264 (1972)","journal-title":"J. ACM"},{"key":"9129_CR12","volume-title":"Flows in Networks","author":"L Ford","year":"1962","unstructured":"Ford, L., Fulkerson, D.: Flows in Networks. Princeton University Press, New Jersey (1962)"},{"key":"9129_CR13","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1287\/ijoc.1040.0081","volume":"18","author":"A Frangioni","year":"2006","unstructured":"Frangioni, A., Manca, A.: A computational study of cost reoptimization for min-cost flow problems. INFORMS J. Comput. 18, 61\u201370 (2006)","journal-title":"INFORMS J. Comput."},{"key":"9129_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jagm.1995.0805","volume":"22","author":"A Goldberg","year":"1997","unstructured":"Goldberg, A.: An efficient implementation of a scaling minimum-cost flow algorithm. J. Algorithms 22, 1\u201329 (1997)","journal-title":"J. Algorithms"},{"key":"9129_CR15","first-page":"27","volume":"3","author":"M Iri","year":"1960","unstructured":"Iri, M.: A new method for solving transportation-network problems. J. Oper. Res. Soc. Jpn. 3, 27\u201387 (1960)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"9129_CR16","unstructured":"Jewell, W.: Optimal flow through networks. Interim Technical Report 8, Massachusetts Institute of Technology (1958)"},{"key":"9129_CR17","unstructured":"Malhotra, H.: Escape from fire. In: Mourareau, R., Thomas, M. (eds.) Fires in Buildings: Proceedings of a European Symposium, Luxembourg, pp. 115\u2013125 (1985)"},{"key":"9129_CR18","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0377-2217(99)00159-9","volume":"120","author":"H Meyr","year":"2000","unstructured":"Meyr, H.: Simultaneous lotsizing and scheduling by combining local search with dual reoptimization. Eur. J. Oper. Res. 120, 311\u2013326 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"9129_CR19","unstructured":"Miller-Hooks, E.: Optimal routing in time-varying, stochastic networks: algorithms and implementation. Ph.D. thesis, Department of Civil Engineering, The University of Texas at Austin, Austin, TX (1994)"},{"key":"9129_CR20","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10694-006-8433-5","volume":"43","author":"E Miller-Hooks","year":"2007","unstructured":"Miller-Hooks, E., Krauthammer, T.: Intelligent evacuation, rescue and recovery concept. Fire Technol. 43, 107\u2013122 (2007)","journal-title":"Fire Technol."},{"key":"9129_CR21","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1023\/B:JMMA.0000026708.57419.6d","volume":"3","author":"E Miller-Hooks","year":"2004","unstructured":"Miller-Hooks, E., Stock Patterson, S.: On solving quickest time problems in time-dependent and dynamic networks. J. Math. Model. Algor. 3, 39\u201371 (2004)","journal-title":"J. Math. Model. Algor."},{"key":"9129_CR22","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1287\/trsc.1040.0112","volume":"39","author":"E Miller-Hooks","year":"2005","unstructured":"Miller-Hooks, E., Yang, B.: Updating paths in time-varying networks with arc weight changes. Transp. Sci. 39, 451\u2013464 (2005)","journal-title":"Transp. Sci."},{"key":"9129_CR23","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1287\/opre.41.2.338","volume":"41","author":"J Orlin","year":"1993","unstructured":"Orlin, J.: A faster strongly polynomial minimum cost flow algorithm. Oper. Res. 41, 338\u2013350 (1993)","journal-title":"Oper. Res."},{"key":"9129_CR24","volume-title":"Equilibrium and Advanced Transportation Modelling","author":"S Pallottino","year":"1998","unstructured":"Pallottino, S., Scutella, G.: Shortest path algorithms in transportation models: classical and innovative aspects. In: Equilibrium and Advanced Transportation Modelling. Kluwer Academic Publishers, Boston (1998)"},{"key":"9129_CR25","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0360-8352(91)90028-5","volume":"20","author":"B Shetty","year":"1991","unstructured":"Shetty, B.: Reoptimization procedures for networks with side constraints. Comput. Ind. Eng. 20, 243\u2013249 (1991)","journal-title":"Comput. Ind. Eng."},{"key":"9129_CR26","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1145\/5925.5934","volume":"33","author":"S Singh","year":"1986","unstructured":"Singh, S.: Improved methods for storing and updating information in the out-of-kilter algorithm. J. ACM 33, 551\u2013567 (1986)","journal-title":"J. ACM"},{"key":"9129_CR27","unstructured":"Ziliaskopoulos, A.: Optimum path algorithms on multidimensional networks: analysis and design, implantations and computational experience. Ph.D. thesis, Department of Civil Engineering, The University of Texas at Austin, Austin, TX (1994)"}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-010-9129-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-010-9129-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-010-9129-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:26:31Z","timestamp":1559269591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-010-9129-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,25]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["9129"],"URL":"https:\/\/doi.org\/10.1007\/s10852-010-9129-x","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,25]]}}}