Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Recoverable Robust Optimization with Commitment (2306.08546v1)

Published 14 Jun 2023 in cs.DS

Abstract: We propose a model for recoverable robust optimization with commitment. Given a combinatorial optimization problem and uncertainty about elements that may fail, we ask for a robust solution that, after the failing elements are revealed, can be augmented in a limited way. However, we commit to preserve the remaining elements of the initial solution. We consider different polynomial-time solvable combinatorial optimization problems and settle the computational complexity of their robust counterparts with commitment. We show for the weighted matroid basis problem that an optimal solution to the nominal problem is also optimal for its robust counterpart. Indeed, matroids are provably the only structures with this strong property. Robust counterparts of other problems are NP-hard such as the matching and the stable set problem, even in bipartite graphs. However, we establish polynomial-time algorithms for the robust counterparts of the unweighted stable set problem in bipartite graphs and the weighted stable set problem in interval graphs, also known as the interval scheduling problem.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (29)
  1. Flexible graph connectivity: Approximating network design problems between 1-and 2-connectivity. Mathematical Programming, 192(1-2):409–441, 2022.
  2. Fault-tolerant edge-disjoint s-t paths - beyond uniform faults. In SWAT 2022, volume 227 of LIPIcs, pages 5:1–5:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
  3. Bulk-robust combinatorial optimization. Mathematical programming, 149:361–390, 2015.
  4. Extensions of the (p,q)𝑝𝑞(p,q)( italic_p , italic_q )-flexible-graph-connectivity model. arXiv preprint arXiv:2211.09747, 2022.
  5. Robust Optimization. Princeton Series in Applied Mathematics. Princeton University Press, 2009.
  6. Adjustable robust solutions of uncertain linear programs. Mathematical programming, 99(2):351–376, 2004.
  7. Approximation algorithms for flexible graph connectivity. arXiv preprint arXiv:2202.13298, 2022.
  8. Richard A Brualdi. Comments on bases in dependence structures. Bulletin of the Australian Mathematical Society, 1(2):161–167, 1969.
  9. Christina Büsing. Recoverable robust shortest path problems. Networks, 59(1):181–189, 2012.
  10. Stochastic and robust scheduling in the cloud. In APPROX-RANDOM, volume 40 of LIPIcs, pages 175–186. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015.
  11. Robert W Deming. Independence numbers of graphs-an extension of the könig-egerváry theorem. Discrete Mathematics, 27(1):23–33, 1979.
  12. How to pay, come what may: Approximation algorithms for demand-robust covering problems. In FOCS 2005, pages 367–376. IEEE, 2005.
  13. Robust recoverable perfect matchings. Networks, 66(3):210–213, 2015.
  14. Robust combinatorial optimization with exponential scenarios. In IPCO 2007, pages 439–453. Springer, 2007.
  15. An investigation of the recoverable robust assignment problem. In IPEC 2021, volume 214 of LIPIcs, pages 19:1–19:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
  16. Light robustness. Robust and online large-scale optimization, 5868:61–84, 2009.
  17. Andras Frank. Some polynomial algorithms for certain graphs and hypergraphs. Proc. 5th Br. comb. Conf., Aberdeen 1975, 211-226 (1976)., 1976.
  18. Matroids are immune to braess’ paradox. Mathematics of Operations Research, 42(3):745–761, 2017.
  19. On the recoverable traveling salesman problem. arXiv preprint arXiv:2111.09691, 2021.
  20. Thresholded covering algorithms for robust and max–min optimization. Mathematical Programming, 146(1-2):583–615, 2014.
  21. How to secure matchings against edge failures. SIAM Journal on Discrete Mathematics, 35(3):2265–2292, 2021.
  22. Recoverable robust spanning tree problem under interval uncertainty representations. Journal of Combinatorial Optimization, 34:554–573, 2017.
  23. A parameterized view to the robust recoverable base problem of matroids under structural uncertainty. Operations Research Letters, 50(3):370–375, 2022.
  24. Approximating the min–max (regret) selecting items problem. Information Processing Letters, 113(1-2):23–29, 2013.
  25. Joseph B Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical society, 7(1):48–50, 1956.
  26. A linear time algorithm for the robust recoverable selection problem. Discrete Applied Mathematics, 303:94–107, 2021.
  27. Matroid bases with cardinality constraints on the intersection. Mathematical Programming, pages 1–24, 2021.
  28. The concept of recoverable robustness, linear programming recovery, and railway applications. Robust and online large-scale optimization: Models and techniques for transportation systems, pages 1–27, 2009.
  29. Alexander Schrijver et al. Combinatorial optimization: polyhedra and efficiency, volume 24. Springer, 2003.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now