An oracle-based framework for robust combinatorial optimization

• Published in: Journal of global optimization Vol. 88; no. 1; pp. 27 - 51
• Main Authors: Bettiol, Enrico, Buchheim, Christoph, De Santis, Marianna, Rinaldi, Francesco
• Format: Journal Article
• Language: English
• Published: New York Springer US 2024
• Subjects: Computer Science; Mathematics; Mathematics and Statistics; Operations Research/Decision Theory; Optimization; Real Functions; Global optimization; Robust optimization; Simplicial decomposition
• ISSN: 0925-5001; 1573-2916
• DOI: 10.1007/s10898-023-01271-2

We propose a general solution approach for min-max-robust counterparts of combinatorial optimization problems with uncertain linear objectives. We focus on the discrete scenario case, but our approach can be extended to other types of uncertainty sets such as polytopes or ellipsoids. Concerning the underlying certain problem, the algorithm is entirely oracle-based, i.e., our approach only requires a (primal) algorithm for solving the certain problem. It is thus particularly useful in case the certain problem is well-studied but its combinatorial structure cannot be directly exploited in a tailored robust optimization approach, or in situations where the underlying problem is only defined implicitly by a given software. The idea of our algorithm is to solve the convex relaxation of the robust problem by a simplicial decomposition approach, the main challenge being the non-differentiability of the objective function in the case of discrete or polytopal uncertainty. The resulting dual bounds are then used within a tailored branch-and-bound framework for solving the robust problem to optimality. By a computational evaluation, we show that our method outperforms straightforward linearization approaches on the robust minimum spanning tree problem. Moreover, using the Concorde solver for the certain oracle, our approach computes much better dual bounds for the robust traveling salesman problem in the same amount of time.