Robust Minimum-Cost Flow Problems Under Multiple Ripple Effect Disruptions

References

• Álvarez-Miranda E, Sinnl M (2019) An exact solution framework for the multiple gradual cover location problem. Comput. Oper. Res. 108:82–96.Crossref, Google Scholar
• Ansari M, Borrero JS, Lozano L (2022) Robust minimum-cost flow problems under multiple-ripple effect disruptions online repository. Accessed August 16, 2022, https://github.com/mehdi-ansari/Robust_minimum_cost_flow_ripple_disruptions.Google Scholar
• Bagherinejad J, Bashiri M, Nikzad H (2018) General form of a cooperative gradual maximal covering location problem. J. Industrial Engrg. Internat. 14(2):241–253.Crossref, Google Scholar
• Ben-Tal A, Nemirovski A (1998) Robust convex optimization. Math. Oper. Res. 23(4):769–805.Link, Google Scholar
• Ben-Tal A, Nemirovski A (1999) Robust solutions to uncertain linear programs. Oper. Res. Lett. 25:1–13.Crossref, Google Scholar
• Ben-Tal A, Nemirovski A (2002) Robust optimization: Methodology and applications. Math. Programming 92(3):453–480.Crossref, Google Scholar
• Ben-Tal A, Boyd S, Nemirovski A (2006) Extending scope of robust optimization: Comprehensive robust counterparts of uncertain problems. Math. Programming 107(1-2):63–89.Crossref, Google Scholar
• Ben-Tal A, El-Ghaoui L, Nemirovski A (2009) Robust Optimization (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• Ben-Tal A, Do Chung B, Mandala SR, Yao T (2011) Robust optimization for emergency logistics planning: Risk mitigation in humanitarian relief supply chains. Transportation Res. Part B: Methodological 45(8):1177–1189.Crossref, Google Scholar
• Ben-Tal A, Golany B, Nemirovski A, Vial JP (2005) Retailer-supplier flexible commitments contracts: A robust optimization approach. Manufacturing Service Oper. Management 7(3):248–271.Link, Google Scholar
• Ben-Tal A, Hazan E, Koren T, Mannor S (2015) Oracle-based robust optimization via online learning. Oper. Res. 63(3):628–638.Link, Google Scholar
• Berman O, Krass D (2002) The generalized maximal covering location problem. Comput. Oper. Res. 29(6):563–581.Crossref, Google Scholar
• Berman O, Drezner Z, Krass D (2009) Cooperative cover location problems: The planar case. IIE Trans. 42(3):232–246.Crossref, Google Scholar
• Berman O, Drezner Z, Krass D (2010) Generalized coverage: New developments in covering location models. Comput. Oper. Res. 37(10):1675–1687.Crossref, Google Scholar
• Berman O, Drezner Z, Krass D (2019) The multiple gradual cover location problem. J. Oper. Res. Soc. 70(6):931–940.Crossref, Google Scholar
• Berman O, Krass D, Drezner Z (2003) The gradual covering decay location problem on a network. Eur. J. Oper. Res. 151(3):474–480.Crossref, Google Scholar
• Bertsimas D, Brown DB (2009) Constructing uncertainty sets for robust linear optimization. Oper. Res. 57(6):1483–1495.Link, Google Scholar
• Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 52(1):35–53.Link, Google Scholar
• Bertsimas D, Thiele A (2006) A robust optimization approach to inventory theory. Oper. Res. 54(1):150–168.Link, Google Scholar
• Bertsimas D, Dunning I, Lubin M (2016) Reformulation vs. cutting-planes for robust optimization. Comput. Management Sci. 13(2):195–217.Crossref, Google Scholar
• Bertsimas D, Pachamanova D, Sim M (2004) Robust linear optimization under general norms. Oper. Res. Lett. 32(6):510–516.Crossref, Google Scholar
• Bomze IM, Budinich M, Pardalos PM, Pelillo M (1999) The maximum clique problem. Handbook of Combinatorial Optimization (Springer, Berlin), 1–74.Google Scholar
• Borrero JS, Lozano L (2021) Modeling defender–attacker problems as robust linear programs with mixed–integer uncertainty sets. INFORMS J. Comput. 33(4):1570–1589.Google Scholar
• Cappanera P, Scaparra MP (2011) Optimal allocation of protective resources in shortest-path networks. Transportation Sci. 45(1):64–80.Link, Google Scholar
• Chazelle BM, Lee DT (1986) On a circle placement problem. Computing 36(1–2):1–16.Crossref, Google Scholar
• Church R, ReVelle C (1974) The maximal covering location problem. Paper Regional Sci. Assoc. 32:101–118.Crossref, Google Scholar
• Church RL (1984) Symposium on location problems: in memory of Leon Cooper: The planar maximal covering location problem. J. Regional Sci. 24(2):185–201.Crossref, Google Scholar
• Cross K, Dullum O, Jenzen-Jones N, Garlasco M (2016) Explosive Weapons in Populated Areas: Technical Considerations Relevant to Their Use and Effects (Armament Research Services, Perth, Australia).Google Scholar
• De M, Nandy SC, Roy S (2014) In-place algorithms for computing a largest clique in geometric intersection graphs. Discrete Appl. Math. 178:58–70.Crossref, Google Scholar
• Dempe S, Kalashnikov V, Pérez-Valdés GA, Kalashnykova N(2015) Bilevel Programming Problems (Springer, Heidelberg, Germany).Crossref, Google Scholar
• DeNegre ST, Ralphs TK (2009) A branch-and-cut algorithm for integer bilevel linear programs. Chinneck JW, Kristjansson B, Saltzman MJ, eds. Operations Research and Cyber-Infrastructure (Springer, New York), 65–78.Crossref, Google Scholar
• Dourado MC, Protti F, Szwarcfiter JL (2012) Complexity aspects of the helly property: Graphs and hypergraphs. Electronic J. Combinatorics DS17.Google Scholar
• Drezner Z, Wesolowsky GO, Drezner T (2004) The gradual covering problem. Naval Res. Logist. 51(6):841–855.Crossref, Google Scholar
• Fischetti M, Ljubić I, Monaci M, Sinnl M (2017) A new general-purpose algorithm for mixed-integer bilevel linear programs. Oper. Res. 65(6):1615–1637.Link, Google Scholar
• Fowler RJ, Paterson MS, Tanimoto SL (1981) Optimal packing and covering in the plane are np-complete. Inform. Processing Lett. 12(3):133–137.Crossref, Google Scholar
• Gorissen BL, Yan Ikoğlu İ, den Hertog D (2015) A practical guide to robust optimization. Omega 53:124–137.Crossref, Google Scholar
• Gregory C, Darby-Dowman K, Mitra G (2011) Robust optimization and portfolio selection: The cost of robustness. Eur. J. Oper. Res. 212(2):417–428.Crossref, Google Scholar
• Ho-Nguyen N, Kilinç-Karzan F (2018) Online first-order framework for robust convex optimization. Oper. Res. 66(6):1670–1692.Link, Google Scholar
• Imai H, Asano T (1983) Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane. J. Algorithms 4(4):310–323.Crossref, Google Scholar
• Israeli E, Wood RK (2002) Shortest-path network interdiction. Networks 40(2):97–111.Crossref, Google Scholar
• Karatas M, Dasci A (2020) A two-level facility location and sizing problem for maximal coverage. Comput. Industrial Engrg. 139:106204.Crossref, Google Scholar
• Karduni A, Kermanshah A, Derrible S (2016) A protocol to convert spatial polyline data to network formats and applications to world urban road networks. Sci. Data 3(1):1–7.Crossref, Google Scholar
• Laporte G, Louveaux FV (1993) The integer l-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 13(3):133–142.Crossref, Google Scholar
• Li Z, Ding R, Floudas CA (2011) A comparative theoretical and computational study on robust counterpart optimization: I. Robust linear optimization and robust mixed integer linear optimization. Industry Engrg. Chemical Res. 50(18):10567–10603.Crossref, Google Scholar
• Lin X, Janak SL, Floudas CA (2004) A new robust optimization approach for scheduling under uncertainty: I. Bounded uncertainty. Comput. Chemical Engrg. 28(6-7):1069–1085.Crossref, Google Scholar
• Lozano L, Smith JC (2017a) A backward sampling framework for interdiction problems with fortification. INFORMS J. Comput. 29(1):123–139.Link, Google Scholar
• Lozano L, Smith JC (2017b) A value-function-based exact approach for the bilevel mixed-integer programming problem. Oper. Res. 65(3):768–786.Link, Google Scholar
• Mitsos A (2010) Global solution of nonlinear mixed-integer bilevel programs. J. Global Optim. 47(4):557–582.Crossref, Google Scholar
• Moon Y, Yao T (2011) A robust mean absolute deviation model for portfolio optimization. Comput. Oper. Res. 38(9):1251–1258.Crossref, Google Scholar
• Mutapcic A, Boyd S (2009) Cutting-set methods for robust convex optimization with pessimizing oracles. Optim. Methods Software 24(3):381–406.Crossref, Google Scholar
• Natarajan K, Pachamanova D, Sim M (2009) Constructing risk measures from uncertainty sets. Oper. Res. 57(5):1129–1141.Link, Google Scholar
• Nohadani O, Sharma K (2018) Optimization under decision-dependent uncertainty. SIAM J. Optim. 28(2):1773–1795.Crossref, Google Scholar
• Patel MH, Horowitz AJ (1994) Optimal routing of hazardous materials considering risk of spill. Transportation Res. Part A: Policy and Practice (Elsevier) 28(2):119–132.Google Scholar
• Poss M (2014) Robust combinatorial optimization with variable cost uncertainty. Eur. J. Oper. Res. 237(3):836–845.Crossref, Google Scholar
• Sengul H, Santella N, Steinberg LJ, Cruz AM (2012) Analysis of hazardous material releases due to natural hazards in the united states. Disasters 36(4):723–743.Crossref, Google Scholar
• Soyster AL (1973) Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21:1154–1157.Link, Google Scholar
• Tahernejad S, Ralphs TK, DeNegre ST (2020) A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation. Math. Programming Comput. 12(4):529–568.Crossref, Google Scholar
• Verma M, Verter V (2007) Railroad transportation of dangerous goods: Population exposure to airborne toxins. Comput. Oper. Res. (Elsevier), 34(5):1287–1303.Google Scholar
• Xiong P, Jirutitijaroen P, Singh C (2017) A distributionally robust optimization model for unit commitment considering uncertain wind power generation. IEEE Trans. Power Systems 32(1):39–49.Crossref, Google Scholar
• Xu P, Wang L (2014) An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions. Comput. Oper. Res. 41(1):309–318.Crossref, Google Scholar
• Yao T, Mandala SR, Do Chung B (2009) Evacuation transportation planning under uncertainty: A robust optimization approach. Network Spatial Econom. 9(2):171.Crossref, Google Scholar
• Zhang J, Hodgson J, Erkut E (2000) Using GIS to assess the risks of hazardous materials transport in networks. Eur. J. Oper. Res. (Elsevier) 121(2):316–329.Google Scholar