An oracle-based framework for robust combinatorial optimization

DOI10.1007/S10898-023-01271-2arXiv2201.01077OpenAlexW4317932976MaRDI QIDQ6183084FDOQ6183084

Authors: Enrico Bettiol, Christoph Buchheim, M. De Santis, F. Rinaldi 

Publication date: 26 January 2024

Published in: Journal of Global Optimization (Search for Journal in Brave)

Abstract: 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 underlying problem is hard to solve, or only defined implicitly by a given software addressing the certain case. 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.

Full work available at URL: https://arxiv.org/abs/2201.01077

Recommendations

• A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization
• Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions
• Min-max-min robust combinatorial optimization

zbMATH Keywords

global optimizationrobust optimizationsimplicial decomposition

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• TSPLIB—A Traveling Salesman Problem Library
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Benchmarking optimization software with performance profiles.
• Convex optimization theory.
• Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
• Min-max-min robust combinatorial optimization
• Cutting plane versus compact formulations for uncertain (integer) linear programs
• Simplicial decomposition in nonlinear programming algorithms
• Cutting-set methods for robust convex optimization with pessimizing oracles
• Restricted simplicial decomposition for convex constrained problems
• Restricted simplicial decomposition: Computation and extensions
• An extension of the frank and Wolfe method of feasible directions
• Convex optimization algorithms
• A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization
• Robust combinatorial optimization under convex and discrete cost uncertainty
• A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization
• A unifying polyhedral approximation framework for convex optimization
• Oracle-based algorithms for binary two-stage robust optimization
• First-order and stochastic optimization methods for machine learning
• A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs

This page was built for publication: An oracle-based framework for robust combinatorial optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6183084)