An oracle-based framework for robust combinatorial optimization
From MaRDI portal
Publication:6183084
DOI10.1007/s10898-023-01271-2arXiv2201.01077OpenAlexW4317932976MaRDI QIDQ6183084
Christoph Buchheim, Marianna De Santis, Francesco Rinaldi, Enrico Bettiol
Publication date: 26 January 2024
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.01077
Cites Work
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Min-max-min robust combinatorial optimization
- Robust combinatorial optimization under convex and discrete cost uncertainty
- A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization
- Oracle-based algorithms for binary two-stage robust optimization
- A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
- First-order and stochastic optimization methods for machine learning
- Restricted simplicial decomposition for convex constrained problems
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- A Unifying Polyhedral Approximation Framework for Convex Optimization
- Cutting-set methods for robust convex optimization with pessimizing oracles
- Restricted simplicial decomposition: Computation and extensions
- Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
- TSPLIB—A Traveling Salesman Problem Library
- Simplicial decomposition in nonlinear programming algorithms
- An extension of the frank and Wolfe method of feasible directions
- An active set algorithm for robust combinatorial optimization based on separation oracles
- Benchmarking optimization software with performance profiles.
This page was built for publication: An oracle-based framework for robust combinatorial optimization
