{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T05:37:07Z","timestamp":1761889027586,"version":"build-2065373602"},"reference-count":37,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[2016,9,1]],"date-time":"2016-09-01T00:00:00Z","timestamp":1472688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2016,9,1]],"date-time":"2016-09-01T00:00:00Z","timestamp":1472688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung (DE)","doi-asserted-by":"publisher","award":["13N12229"],"award-info":[{"award-number":["13N12229"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche (FR)","doi-asserted-by":"publisher","award":["ANR-11-SECU-002-01"],"award-info":[{"award-number":["ANR-11-SECU-002-01"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s13675-016-0067-x","type":"journal-article","created":{"date-parts":[[2016,5,10]],"date-time":"2016-05-10T05:55:01Z","timestamp":1462859701000},"page":"241-270","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Robust flows with losses and improvability in evacuation planning"],"prefix":"10.1016","volume":"4","author":[{"given":"Marc","family":"Goerigk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"IsmailaAbderhamane","family":"Ndiaye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1007\/s13675-016-0067-x_CR1","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.ejor.2008.09.012","article-title":"Minmax and minmax regret versions of combinatorial optimization problems: a survey","volume":"197","author":"Aissi","year":"2009","journal-title":"Eur J Oper Res"},{"issue":"3","key":"10.1007\/s13675-016-0067-x_CR2","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1016\/j.cor.2012.10.002","article-title":"The robust vehicle routing problem with time windows","volume":"40","author":"Agra","year":"2013","journal-title":"Comput Oper Res"},{"issue":"1","key":"10.1007\/s13675-016-0067-x_CR3","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.ejor.2005.05.016","article-title":"OR\/MS research in disaster operations management","volume":"175","author":"Altay","year":"2006","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-016-0067-x_CR4","unstructured":"Ayoub J, Poss M (2015) Decomposition for adjustable robust linear optimization subject to uncertainty polytope. http:\/\/www.optimization-online.org\/DB_HTML\/2015\/11\/5207.html"},{"issue":"2","key":"10.1007\/s13675-016-0067-x_CR5","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10107-003-0454-y","article-title":"Adjustable robust solutions of uncertain linear programs","volume":"99","author":"Ben-Tal","year":"2004","journal-title":"Math Program"},{"year":"2009","series-title":"Robust optimization","author":"Ben-Tal","key":"10.1007\/s13675-016-0067-x_CR6"},{"issue":"3","key":"10.1007\/s13675-016-0067-x_CR7","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1023\/A:1009635226865","article-title":"Rollout algorithms for combinatorial optimization","volume":"3","author":"Bertsekas","year":"1997","journal-title":"J Heuristics"},{"key":"10.1007\/s13675-016-0067-x_CR8","doi-asserted-by":"crossref","first-page":"2003","DOI":"10.1007\/s10107-003-0396-4","article-title":"Robust discrete optimization and network flows","volume":"98","author":"Bertsimas","year":"2003","journal-title":"Math Program Ser B"},{"issue":"1","key":"10.1007\/s13675-016-0067-x_CR9","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","article-title":"The price of robustness","volume":"52","author":"Bertsimas","year":"2004","journal-title":"Oper Res"},{"key":"10.1007\/s13675-016-0067-x_CR10","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.dam.2014.01.017","article-title":"2-Stage robust MILP with continuous recourse variables","volume":"170","author":"Billionnet","year":"2014","journal-title":"Discrete Appl Math"},{"key":"10.1007\/s13675-016-0067-x_CR11","doi-asserted-by":"crossref","unstructured":"B\u00fcsing C, Koster AMCA, Kutschka M (2011) Recoverable robust knapsacks: \u0393-scenarios. In: Network optimization. Springer, New York, pp 583\u2013588","DOI":"10.1007\/978-3-642-21527-8_65"},{"issue":"2","key":"10.1007\/s13675-016-0067-x_CR12","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1002\/net.20097","article-title":"Upgrading arcs to minimize the maximum travel time in a network","volume":"47","author":"Campbell","year":"2006","journal-title":"Networks"},{"issue":"1","key":"10.1007\/s13675-016-0067-x_CR13","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/BF02993491","article-title":"Network models for building evacuation","volume":"18","author":"Chalmet","year":"1982","journal-title":"Fire Technol"},{"issue":"1","key":"10.1007\/s13675-016-0067-x_CR14","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/0377-2217(88)90382-7","article-title":"Modeling of building evacuation problems by network flows with side constraints","volume":"35","author":"Choi","year":"1988","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-016-0067-x_CR15","doi-asserted-by":"crossref","unstructured":"Demgensky I, Noltemeier H, Wirth H-C (2004) Optimizing cost flows by edge cost and capacity upgrade. J Discrete Algorithms 2(4):407 \u2013 423. The 26th international workshop on graph-theoretic concepts in computer science (WG 2000)","DOI":"10.1016\/j.jda.2004.04.003"},{"key":"10.1007\/s13675-016-0067-x_CR16","series-title":"Integration of AI and OR techniques in constraint programming for combinatorial optimization problems","first-page":"76","article-title":"Upgrading shortest paths in networks","author":"Dilkina","year":"2011"},{"key":"10.1007\/s13675-016-0067-x_CR17","doi-asserted-by":"crossref","unstructured":"Gabrel V, Lacroix M, Murat C, Remli N (2014) Robust location transportation problems under uncertain demands. Discrete Appl Math 164 Part 1(0):100\u2013111","DOI":"10.1016\/j.dam.2011.09.015"},{"key":"10.1007\/s13675-016-0067-x_CR18","doi-asserted-by":"crossref","unstructured":"Goerigk M, Sch\u00f6bel A (2015) Algorithm engineering in robust optimization. In: LNCS state-of-the-art surveys. Springer, New York","DOI":"10.1007\/978-3-319-49487-6_8"},{"key":"10.1007\/s13675-016-0067-x_CR19","unstructured":"Hamacher HW, Tjandra SA (2001) Mathematical modeling of evacuation problems: a state of the art. In: Schreckenberg M, Sharma SD (eds) Pedestrian and evacuation dynamics 1964:227\u2013266"},{"key":"10.1007\/s13675-016-0067-x_CR20","series-title":"Pedestrian and evacuation dynamics","first-page":"503","article-title":"A sandwich approach for evacuation time bounds","author":"Hamacher","year":"2011"},{"key":"10.1007\/s13675-016-0067-x_CR21","doi-asserted-by":"crossref","unstructured":"Kouvelis P, Yu G (1997) Robust discrete optimization and its applications. Kluwer Academic Publishers, New York","DOI":"10.1007\/978-1-4757-2620-6"},{"key":"10.1007\/s13675-016-0067-x_CR22","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1090\/dimacs\/040\/15","article-title":"Network improvement problems. Network design: connectivity and facilities location","volume":"40","author":"Krumke","year":"1998","journal-title":"AMSDIMACS Vol Ser Discrete Math Theor Comput Sci"},{"key":"10.1007\/s13675-016-0067-x_CR23","series-title":"Pedestrian and evacuation dynamics","first-page":"287","article-title":"Risk minimizing evacuation strategies under uncertainty","author":"L\u00e4mmel","year":"2011"},{"key":"10.1007\/s13675-016-0067-x_CR24","unstructured":"Lemoine A et\u00a0al (2014) Pligurian earthquake: seismic and tsunami scenario modeling, from hazard to risk assessment towards evacuations planning. In: Proceedings of the second European conference on earthquake engineering and seismology"},{"key":"10.1007\/s13675-016-0067-x_CR25","doi-asserted-by":"crossref","unstructured":"Liebchen C, L\u00fcbbecke M, M\u00f6hring RH, Stiller S (2009) The concept of recoverable robustness, linear programming recovery, and railway applications. In: Ahuja RK, M\u00f6hring RH, Zaroliagis CD (eds) Robust and online large-scale optimization. Lecture note on computer science, vol 5868. Springer, New York, pp 1\u201327","DOI":"10.1007\/978-3-642-05465-5_1"},{"key":"10.1007\/s13675-016-0067-x_CR26","series-title":"Advances in spatial and temporal databases","first-page":"223","article-title":"Best upgrade plans for large road networks","author":"Lin","year":"2013"},{"key":"10.1007\/s13675-016-0067-x_CR27","doi-asserted-by":"crossref","unstructured":"Ndiaye IA, Neron E, Linot A, Monmarche N, Goerigk M (2014) A new model for macroscopic pedestrian evacuation planning with safety and duration criteria. Transp Res Proc 2(0):486\u2013494. The conference on pedestrian and evacuation dynamics 2014 (PED 2014), 22\u201324 October 2014, Delft","DOI":"10.1016\/j.trpro.2014.09.064"},{"issue":"1","key":"10.1007\/s13675-016-0067-x_CR28","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1006\/jagm.2000.1130","article-title":"Combinatorial approximation algorithms for generalized flow problems","volume":"38","author":"Oldham","year":"2001","journal-title":"J Algorithms"},{"key":"10.1007\/s13675-016-0067-x_CR29","doi-asserted-by":"crossref","first-page":"1749","DOI":"10.1057\/jors.2008.122","article-title":"The safest escape problem","volume":"60","author":"Opasanon","year":"2009","journal-title":"J Oper Res Soc"},{"issue":"2","key":"10.1007\/s13675-016-0067-x_CR30","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1002\/net.20183","article-title":"Robust capacity expansion of network flows","volume":"50","author":"Ordez","year":"2007","journal-title":"Networks"},{"issue":"1","key":"10.1007\/s13675-016-0067-x_CR31","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1287\/moor.23.1.69","article-title":"Faster algorithms for the generalized network flow problem","volume":"23","author":"Radzik","year":"1998","journal-title":"Math Oper Res"},{"issue":"6","key":"10.1007\/s13675-016-0067-x_CR32","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0020-0190(98)00070-2","article-title":"On budget-constrained flow improvement","volume":"66","author":"Schwarz","year":"1998","journal-title":"Inf Process Lett"},{"key":"10.1007\/s13675-016-0067-x_CR33","unstructured":"Wayne KD (1999) Generalized maximum flow algorithms. PhD Thesis. Cornell University, New York"},{"issue":"1","key":"10.1007\/s13675-016-0067-x_CR34","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.trc.2010.03.007","article-title":"Lane-based evacuation network optimization: an integrated lagrangian relaxation and Tabu search approach","volume":"19","author":"Xie","year":"2011","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"3","key":"10.1007\/s13675-016-0067-x_CR35","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/j.tre.2009.11.004","article-title":"A dynamic evacuation network optimization problem with lane reversal and crossing elimination strategies","volume":"46","author":"Xie","year":"2010","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"10","key":"10.1007\/s13675-016-0067-x_CR36","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1080\/00207729608929296","article-title":"A network flow approach to a city emergency evacuation planning","volume":"27","author":"Yamada","year":"1996","journal-title":"Int J Syst Sci"},{"issue":"5","key":"10.1007\/s13675-016-0067-x_CR37","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.orl.2013.05.003","article-title":"Solving two-stage robust optimization problems using a column-and-constraint generation method","volume":"41","author":"Zeng","year":"2013","journal-title":"Oper Res Lett"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-016-0067-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-016-0067-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000642?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000642?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-016-0067-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:47:04Z","timestamp":1761882424000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621000642"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9]]},"references-count":37,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["S2192440621000642"],"URL":"https:\/\/doi.org\/10.1007\/s13675-016-0067-x","relation":{},"ISSN":["2192-4406"],"issn-type":[{"type":"print","value":"2192-4406"}],"subject":[],"published":{"date-parts":[[2016,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Robust flows with losses and improvability in evacuation planning","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-016-0067-x","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2016 The author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}