Explicit sets with ideal robustness are achievable in combinatorial optimization problems with cost uncertainty

2023/03/31 by Alejandro Crema, Crema, Alejandro
Decision Sciences · #Auction Theory and Applications

paper · pdf · doi:10.48550/arxiv.2303.17901

Abstract

We present an standard constraints generation algorithm to find an explicit set whose robustness is equal to the robustness of the feasible solution set of a combinatorial optimization problem with cost uncertainty. Computational experience shows that for problems with moderate dimensions the running time of the algorithm may be tolerable and in many cases the number of solutions required to achieve near-ideal robustness may be manageable for decision makers.

Related

• Robust Combinatorial Optimization Problems Under Budgeted Interdiction Uncertainty
• Faster Algorithms for Min-max-min Robustness for Combinatorial Problems with Budgeted Uncertainty
• An oracle-based framework for robust combinatorial optimization
• Robust two-stage combinatorial optimization problems under convex\n uncertainty
• Min-Max-Min Robustness for Combinatorial Problems with Discrete Budgeted Uncertainty