2000 character limit reached
Recoverable robust shortest path problem under interval budgeted uncertainty representations (2401.05715v2)
Published 11 Jan 2024 in cs.DS
Abstract: In this paper, the recoverable robust shortest path problem under interval uncertainty representations is discussed. This problem is known to be strongly NP-hard and also hard to approximate in general digraphs. In this paper, the class of acyclic digraphs is considered. It is shown that for the traditional interval uncertainty, the problem can be solved in polynomial time for all natural, known from the literature, neighborhoods. Efficient algorithms for various classes of acyclic digraphs are constructed. Some negative results for general digraphs are strengthened. Finally, some exact and approximate methods of solving the problem under budgeted interval uncertainty are proposed.
- Network Flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs, New Jersey, 1993.
- D. Bertsimas and M. Sim. Robust discrete optimization and network flows. Mathematical Programming, 98:49–71, 2003.
- D. Bertsimas and M. Sim. The price of robustness. Operations research, 52:35–53, 2004.
- M. Bold and M. Goerigk. Investigating the recoverable robust single machine scheduling problem under interval uncertainty. Discrete Applied Mathematics, 313:99–114, 2022.
- M. Bold and M. Goerigk. Recoverable Robust Single Machine Scheduling with Polyhedral Uncertainty. Technical report, arXiv:2011.06284, 2022.
- C. Büsing. Recoverable robustness in combinatorial optimization. PhD thesis, Technical University of Berlin, Berlin, 2011.
- C. Büsing. Recoverable robust shortest path problems. Networks, 59:181–189, 2012.
- Formulations and algorithms for the recoverable γ𝛾\gammaitalic_γ-robust knapsack problem. EURO Journal on Computational Optimization, 7:15–45, 2019.
- Recoverable robust knapsacks: ΓΓ\Gammaroman_Γ-scenarios. In Network Optimization, pages 583–588. Springer, 2011.
- A. Chassein and M. Goerigk. On the recoverable robust traveling salesman problem. Optimization Letters, 10:1479–1492, 2016.
- On recoverable and two-stage robust selection problems with budgeted uncertainty. European Journal of Operational Research, 265:423–436, 2018.
- Incremental network optimization: theory and algorithms. Operations Research, 57:586–594, 2009.
- An investigation of the recoverable robust assignment problem. In 16th International Symposium on Parameterized and Exact Computation, IPEC 2021, pages 19:1–19:14, 2021.
- J. Flum and M. Grohe. Parameterized Complexity Theory. Springer-Verlag, 2006.
- The directed subgraph homeomorphism problem. Theoretical Computer Science, 10:111–121, 1980.
- Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
- On the recoverable travling salesman problem. Technical report, arXiv:2111.09691, 2021.
- On the complexity of robust multi-stage problems with discrete recourse. Discrete Applied Mathematics, 343:355–370, 2024.
- R. Hassin. Approximation Schemes for the Restricted Shortest Path Problem. Mathematics of Operations Research, 17:36–42, 1992.
- Recoverable robust spanning tree problem under interval uncertainty representations. Journal of Combinatorial Optimization, 34:554–573, 2017.
- The recoverable robust spanning tree problem with interval costs is polynomially solvable. Optimization Letters, 11:17–30, 2017.
- Robust recoverable 0–1 optimization problems under polyhedral uncertainty. European Journal of Operational Research, 278:136–148, 2019.
- A parameterized view to the robust recoverable base problem of matroids under structural uncertainty. Operations Research Letters, 50:370–375, 2022.
- A. Kasperski and P. Zieliński. Robust recoverable and two-stage selection problems. Discrete Applied Mathematics, 233:52–64, 2017.
- P. Kouvelis and G. Yu. Robust Discrete Optimization and its Applications. Kluwer Academic Publishers, 1997.
- A linear time algorithm for the robust recoverable selection problem. Discrete Applied Mathematics, 303:94–107, 2021.
- T. Lee and C. Kwon. A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty. 4OR, 12:373–378, 2014.
- Matroid bases with cardinality constraints on the intersection. Mathematical Programming, marzec 2021.
- The concept of recoverable robustness, linear programming recovery, and railway applications. In Robust and Online Large-Scale Optimization, volume 5868 of Lecture Notes in Computer Science, pages 1–27. Springer-Verlag, 2009.
- E. Nasrabadi and J. B. Orlin. Robust optimization with incremental recourse. CoRR, abs/1312.4075, 2013.
- G. Naves and A. Sebő. Multiflow feasibility: An annotated tableau. In W. Cook, L. Lovász, and J. Vygen, editors, Research Trends in Combinatorial Optimization, pages 261–283. Springer Berlin Heidelberg, 2009.
- The recognition of series parallel digraphs. SIAM Journal on Computing, 11:298–313, 1982.
- B. Zeng and L. Zhao. Solving two-stage robust optimization problems using a column and constraint generation method. Operation Research Letters, 41:457–461, 2013.