{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T10:03:45Z","timestamp":1749809025898,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,4,6]],"date-time":"2019-04-06T00:00:00Z","timestamp":1554508800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,4,6]],"date-time":"2019-04-06T00:00:00Z","timestamp":1554508800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s12351-019-00472-6","type":"journal-article","created":{"date-parts":[[2019,4,7]],"date-time":"2019-04-07T03:09:16Z","timestamp":1554606556000},"page":"1179-1209","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Quickest flow over time network interdiction: mathematical formulation and a solution method"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0455-2350","authenticated-orcid":false,"given":"Shahram","family":"Morowati-Shalilvand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sedaghat","family":"Shahmorad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamal","family":"Mirnia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javad","family":"Mehri-Tekmeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"issue":"4","key":"472_CR1","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1016\/j.cie.2013.04.014","volume":"65","author":"M Afshari-Rad","year":"2013","unstructured":"Afshari-Rad M, Taghizadeh-Kakhki H (2013) Maximum dynamic network flow interdiction problem: new formulation and solution procedures. Comput Ind Eng 65(4):531\u2013536","journal-title":"Comput Ind Eng"},{"key":"472_CR2","volume-title":"Network flows: theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice-Hall Inc, Upper Saddle River"},{"issue":"2","key":"472_CR3","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.ejor.2010.12.011","volume":"211","author":"I Akg\u00fcn","year":"2011","unstructured":"Akg\u00fcn I, Tansel Bc, Wood R (2011) The multi-terminal maximum-flow network-interdiction problem. Eur J Oper Res 211(2):241\u2013251. https:\/\/doi.org\/10.1016\/j.ejor.2010.12.011","journal-title":"Eur J Oper Res"},{"key":"472_CR4","first-page":"369","volume-title":"Probability, statistics and optimisation, chap. 27","author":"EJ Anderson","year":"1994","unstructured":"Anderson EJ, Philpott AB (1994) Optimisation of flows in networks over time. In: Kelly FP (ed) Probability, statistics and optimisation, chap. 27. Wiley, New York, pp 369\u2013382"},{"key":"472_CR5","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J Benders","year":"1962","unstructured":"Benders J (1962) Partioning procedures for solving mixed integer variables programming problems. Numer Math 4:238\u2013252","journal-title":"Numer Math"},{"issue":"1","key":"472_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01415527","volume":"37","author":"RE Burkard","year":"1993","unstructured":"Burkard RE, Dlaska K, Klinz B (1993) The quickest flow problem. ZOR Methods Models Oper Res 37(1):31\u201358","journal-title":"ZOR Methods Models Oper Res"},{"key":"472_CR7","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/nav.3800090303","volume":"9","author":"A Charnes","year":"1962","unstructured":"Charnes A, Cooper W (1962) Programming with linear fractional functionals. Nav Res Logist Q 9:181\u2013186","journal-title":"Nav Res Logist Q"},{"issue":"4","key":"472_CR8","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0167-6377(82)90020-7","volume":"1","author":"H Corley","year":"1982","unstructured":"Corley H, Sha D (1982) Most vital links and nodes in weighted networks. Oper Res Lett 1(4):157\u2013160","journal-title":"Oper Res Lett"},{"key":"472_CR9","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1287\/opre.46.2.184","volume":"46","author":"K Cormican","year":"1998","unstructured":"Cormican K, Morton D, Wood R (1998) Stochastic network interdiction. Oper Res 46:184\u2013197","journal-title":"Oper Res"},{"issue":"1","key":"472_CR10","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1137\/S1052623497327295","volume":"12","author":"LK Fleischer","year":"2001","unstructured":"Fleischer LK (2001) Faster algorithms for the quickest transshipment problem. SIAM J Optim 12(1):18\u201335","journal-title":"SIAM J Optim"},{"key":"472_CR11","first-page":"36","volume-title":"The quickest multicommodity flow problem","author":"L Fleischer","year":"2002","unstructured":"Fleischer L, Skutella M (2002) The quickest multicommodity flow problem. Springer, Berlin, pp 36\u201353"},{"issue":"6","key":"472_CR12","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1137\/S0097539703427215","volume":"36","author":"L Fleischer","year":"2007","unstructured":"Fleischer L, Skutella M (2007) Quickest flows over time. SIAM J Comput 36(6):1600\u20131630","journal-title":"SIAM J Comput"},{"issue":"3\u20135","key":"472_CR13","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0167-6377(98)00037-6","volume":"23","author":"L Fleischer","year":"1998","unstructured":"Fleischer L, Tardos \u00c9 (1998) Efficient continuous-time dynamic network flow algorithms. Oper Res Lett 23(3\u20135):71\u201380","journal-title":"Oper Res Lett"},{"key":"472_CR14","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"L Ford","year":"1958","unstructured":"Ford L, Fulkerson D (1958) Constructing maximal dynamic flows from static flows. Oper Res 6:419\u2013433","journal-title":"Oper Res"},{"key":"472_CR15","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/BF01584329","volume":"13","author":"D Fulkerson","year":"1977","unstructured":"Fulkerson D, Harding G (1977) Maximizing the minimum source-sink path subject to a budget constraint. Math Program 13:116\u2013118","journal-title":"Math Program"},{"key":"472_CR16","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1002\/nav.3800180103","volume":"18","author":"P Ghare","year":"1971","unstructured":"Ghare P, Montgomery D, Turner T (1971) Optimal interdiction policy for a flow network. Nav Res Logist Q 18:37\u201345","journal-title":"Nav Res Logist Q"},{"key":"472_CR17","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1002\/nav.3800250412","volume":"25","author":"B Golden","year":"1978","unstructured":"Golden B (1978) A problem in network interdiction. Nav Res Logist Q 25:711\u2013713","journal-title":"Nav Res Logist Q"},{"issue":"1","key":"472_CR18","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.25.1.36.15211","volume":"25","author":"B Hoppe","year":"2000","unstructured":"Hoppe B, Tardos \u00c9 (2000) The quickest transshipment problem. Math Oper Res 25(1):36\u201362","journal-title":"Math Oper Res"},{"issue":"4","key":"472_CR19","first-page":"69","volume":"I","author":"D Ionac","year":"2001","unstructured":"Ionac D (2001) Some duality theorems for linear-fractional programming having the coefficients in a subfield $$k$$ of real numbers. Studia Universitatis Babe\u015f-Bolyai Mathematica XLV I(4):69\u201373","journal-title":"Studia Universitatis Babe\u015f-Bolyai Mathematica XLV"},{"key":"472_CR20","unstructured":"Israeli E (1999) System interdiction and defense. Ph.D. thesis, Operations Research Department, Naval Postgraduate School, Monterey, California"},{"key":"472_CR21","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1002\/net.10039","volume":"40","author":"E Israeli","year":"2002","unstructured":"Israeli E, Wood R (2002) Shortest path network interdiction. Networks 40:97\u2013111","journal-title":"Networks"},{"key":"472_CR22","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1080\/07408170600729192","volume":"39","author":"C Lim","year":"2007","unstructured":"Lim C, Smith C (2007) Algorithms for discrete and continuous multicommodity flow network interdiction problems. IIE Trans 39:15\u201326","journal-title":"IIE Trans"},{"key":"472_CR23","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0165-0114(93)90508-F","volume":"58","author":"KC Lin","year":"1993","unstructured":"Lin KC, Chern MS (1993) The fuzzy shortest path problem and its most vital arcs. Fuzzy Sets Syst 58:343\u2013353","journal-title":"Fuzzy Sets Syst"},{"key":"472_CR24","doi-asserted-by":"crossref","unstructured":"Lin M, Jaillet P (2015) On the quickest flow problem in dynamic networks: a parametric min-cost flow approach. In: Proceedings of the twenty-sixth annual ACM-SIAM symposium on discrete algorithms","DOI":"10.1137\/1.9781611973730.89"},{"issue":"4","key":"472_CR25","doi-asserted-by":"publisher","first-page":"553","DOI":"10.15388\/Informatica.2010.305","volume":"21","author":"BJ Lunday","year":"2010","unstructured":"Lunday BJ, Sherali HD (2010) A dynamic network interdiction problem. Informatica 21(4):553\u2013574","journal-title":"Informatica"},{"key":"472_CR26","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0167-6377(89)90065-5","volume":"8","author":"K Malik","year":"1989","unstructured":"Malik K, Mittal A, Gupta S (1989) The k most vital arcs in the shortest path problem. Oper Res Lett 8:223\u2013227","journal-title":"Oper Res Lett"},{"key":"472_CR27","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1002\/nav.3800170302","volume":"17","author":"A McMasters","year":"1970","unstructured":"McMasters A, Mustin T (1970) Optimal interdiction of a supply network. Nav Res Logist 17:261\u2013268","journal-title":"Nav Res Logist"},{"issue":"2","key":"472_CR28","doi-asserted-by":"publisher","first-page":"173","DOI":"10.11121\/ijocta.01.2012.0098","volume":"2","author":"S Morowati-Shalilvand","year":"2012","unstructured":"Morowati-Shalilvand S, Mehri-Tekmeh J (2012) Finding most vital links over time in a flow network. Int J Optim Control Theor Appl 2(2):173\u2013186","journal-title":"Int J Optim Control Theor Appl"},{"key":"472_CR29","volume-title":"Linear programming","author":"KG Murty","year":"1983","unstructured":"Murty KG (1983) Linear programming. Wiley, New York"},{"issue":"2","key":"472_CR30","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1287\/ijoc.1060.0191","volume":"19","author":"JO Royset","year":"2007","unstructured":"Royset JO, Wood RK (2007) Solving the bi-objective maximum-flow network-interdiction problem. INFORMS J Comput 19(2):175\u2013184","journal-title":"INFORMS J Comput"},{"key":"472_CR31","volume-title":"Theory of linear and integer programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver A (1986) Theory of linear and integer programming. Wiley, New York"},{"key":"472_CR32","volume-title":"Research trends in combinatorial optimization","author":"M Skutella","year":"2009","unstructured":"Skutella M (2009) An introduction to network flows over time. In: Cook W, Lovasz L, Vygen J (eds) Research trends in combinatorial optimization. Springer, Berlin"},{"issue":"6","key":"472_CR33","first-page":"517","volume":"45","author":"IM Stancu-Minasian","year":"1993","unstructured":"Stancu-Minasian IM, Tigan S (1993) On some methods for solving fractional programming problems with inexact data. Studii si Cercetari Matematice 45(6):517\u2013532","journal-title":"Studii si Cercetari Matematice"},{"key":"472_CR34","doi-asserted-by":"publisher","first-page":"15","DOI":"10.5711\/morj.4.4.15","volume":"4","author":"P Whiteman","year":"1999","unstructured":"Whiteman P (1999) Improving single strike effectiveness for network interdiction. Mil Oper Res 4:15\u201330","journal-title":"Mil Oper Res"},{"key":"472_CR35","unstructured":"Wollmer RD (1963) Some methods for determining the most vital link in a railway network. RAND Memorandum RM-3321-ISA"},{"key":"472_CR36","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1287\/opre.18.3.497","volume":"18","author":"RD Wollmer","year":"1970","unstructured":"Wollmer RD (1970) Algorithm for targeting strikes in a lines-of-communication network. Oper Res 18:497\u2013515","journal-title":"Oper Res"},{"key":"472_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0895-7177(93)90236-R","volume":"17","author":"RK Wood","year":"1993","unstructured":"Wood RK (1993) Deterministic network interdiction. Math Comput Model 17:1\u201318","journal-title":"Math Comput Model"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-019-00472-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-019-00472-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-019-00472-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,21]],"date-time":"2021-05-21T09:30:24Z","timestamp":1621589424000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-019-00472-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,6]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["472"],"URL":"https:\/\/doi.org\/10.1007\/s12351-019-00472-6","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"type":"print","value":"1109-2858"},{"type":"electronic","value":"1866-1505"}],"subject":[],"published":{"date-parts":[[2019,4,6]]},"assertion":[{"value":"7 October 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}