Optimization Problems in Graphs with Locational Uncertainty

References

• Aissi H, Bazgan C, Vanderpooten D (2009) Min-max and min-max regret versions of combinatorial optimization problems: A survey. Eur. J. Oper. Res. 197(2):427–438.Crossref, Google Scholar
• Ayoub J, Poss M (2016) Decomposition for adjustable robust linear optimization subject to uncertainty polytope. Comput. Management Sci. 13(2):219–239.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, Goryashko AP, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math. Programming 99(2):351–376.Crossref, Google Scholar
• Bertsimas D, Dunning I (2016) Multistage robust mixed-integer optimization with adaptive partitions. Oper. Res. 64(4):980–998.Link, Google Scholar
• Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math. Programming 98(1–3):49–71.Crossref, Google Scholar
• Bertsimas D, Dunning I, Lubin M (2016) Reformulation vs. cutting-planes for robust optimization. Comput. Managment Sci. 13(2):195–217.Crossref, Google Scholar
• Bezanson J, Karpinski S, Shah VB, Edelman A (2012) Julia: A fast dynamic language for technical computing. Preprint, submitted September 24, https://arxiv.org/abs/1209.5145.Google Scholar
• Bougeret M, Omer J, Poss M (2022) Approximating optimization problems in graphs with locational uncertainty. Preprint, submitted June 16, https://arxiv.org/abs/2206.08187.Google Scholar
• Buchheim C, Kurtz J (2018) Robust combinatorial optimization under convex and discrete cost uncertainty. EURO J. Comput. Optim. 6(3):211–238.Crossref, Google Scholar
• Citovsky G, Mayer T, Mitchell JSB (2017) TSP with locational uncertainty: The adversarial model. Aronov B, Katz MJ, eds. Proc. 33rd Internat. Sympos. on Computat. Geometry, vol. 77 of Leibniz International Proceedings in Informatics (Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany), 32:1–32:16.Google Scholar
• Correia I, da Gama FS (2015) Facility location under uncertainty. Location Science (Springer), 177–203.Crossref, Google Scholar
• Crescenzi P (1997) A short guide to approximation preserving reductions. Proc. 12th Annual IEEE Conf. on Comput. Complexity (IEEE, New York), 262–273.Google Scholar
• Daskin M (1993) Genrand2: A Random Network Generator (Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL).Google Scholar
• de Ruiter F, Ben-Tal A (2017) Tractable nonlinear decision rules for robust optimization. Technical report.Google Scholar
• Dunning I, Huchette J, Lubin M (2017) Jump: A modeling language for mathematical optimization. SIAM Rev. 59(2):295–320.Crossref, Google Scholar
• Fellows MR, Fomin FV, Lokshtanov D, Rosamond F, Saurabh S, Szeider S, Thomassen C (2011) On the complexity of some colorful problems parameterized by treewidth. Inform. Comput. 209(2):143–153.Crossref, Google Scholar
• Fischetti M, Monaci M (2012) Cutting plane vs. compact formulations for uncertain (integer) linear programs. Math. Programming Comput. 4(3):239–273.Crossref, Google Scholar
• Gutiérrez-Jarpa G, Obreque C, Laporte G, Marianov V (2013) Rapid transit network design for optimal cost and origin–destination demand capture. Comput. Oper. Res. 40(12):3000–3009.Google Scholar
• Hanasusanto GA, Kuhn D, Wiesemann W (2015) K-adaptability in two-stage robust binary programming. Oper. Res. 63(4):877–891.Link, Google Scholar
• Kasperski A, Zieliński P (2009) On the approximability of minmax (regret) network optimization problems. Inform. Processing Lett. 109(5):262–266.Crossref, Google Scholar
• Kasperski A, Zieliński P (2016) Robust discrete optimization under discrete and interval uncertainty: A survey. Robustness Analysis in Decision Aiding, Optimization, and Analytics (Springer, Berlin), 113–143.Crossref, Google Scholar
• Kouvelis P, Yu G (2013) Robust Discrete Optimization and its Applications, vol. 14 (Springer Science & Business Media, New York).Google Scholar
• Magnanti TL, Wong RT (1984) Network design and transportation planning: Models and algorithms. Transportation Sci. 18(1):1–55.Link, Google Scholar
• Marín A, Pelegrín M (2019) P-median problems. Location Science (Springer, Berlin), 25–50.Crossref, Google Scholar
• Melkote S, Daskin MS (2001) An integrated model of facility location and transportation network design. Transportation Res. Part A: Policy Practice 35(6):515–538.Crossref, Google Scholar
• Naoum-Sawaya J, Buchheim C (2016) Robust critical node selection by benders decomposition. INFORMS J. Comput. 28(1):162–174.Link, Google Scholar
• Postek K, Den Hertog D (2016) Multistage adjustable robust mixed-integer optimization via iterative splitting of the uncertainty set. INFORMS J. Comput. 28(3):553–574.Link, Google Scholar
• Roos E, Den Hertog D, Ben-Tal A, de Ruiter FJ, Zhen J (2018) Approximation of Hard Uncertain Convex Inequalities (Optimization Online).Google Scholar
• Shang Y, Ruml W, Zhang Y, Fromherz MP (2003) Localization from mere connectivity. Proc. 4th ACM Internat. Sympos. on Mobile Ad Hoc Networking & Comput. (ACM, New York), 201–212.Google Scholar
• Subramanyam A, Gounaris CE, Wiesemann W (2019) K-adaptability in two-stage mixed-integer robust optimization. Math. Programming Comput. 12:193–224.Google Scholar
• Yaman H, Karasan OE, Pinar MÇ (2001) The robust spanning tree problem with interval data. Oper. Res. Lett. 29(1):31–40.Crossref, Google Scholar
• Zeng B, Zhao L (2013) Solving two-stage robust optimization problems using a column-and-constraint generation method. Oper. Res. Lett. 41(5):457–461.Crossref, Google Scholar
• Zhen J, Hertog DD, Sim M (2018) Adjustable robust optimization via Fourier-Motzkin elimination. Oper. Res. 66(4):1086–1100.Link, Google Scholar
• Zhen J, de Ruiter FJ, Roos E, den Hertog D (2021) Robust optimization for models with uncertain second-order cone and semidefinite programming constraints. INFORMS J. Comput. 34(1):196–210.Google Scholar