Benchmarking problems for robust discrete optimization

Cites work

A Lagrangian dual method for two-stage robust optimization with binary uncertainties
A randomized algorithm for the min-Max selecting items problem with uncertain weights
Algorithms and uncertainty sets for data-driven robust shortest path problems
An exact algorithm for the robust shortest path problem with interval data
An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem
Approximability of the robust representatives selection problem
Approximating combinatorial optimization problems with the ordered weighted averaging criterion
Combinatorial two-stage minmax regret problems under interval uncertainty
Complexity and in-approximability of a selection problem in robust optimization
Data-driven robust optimization
Exact solution of the robust knapsack problem
Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios
Fast robust shortest path computations
Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem
Generating hard instances for robust combinatorial optimization
Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
High-performance heuristics for optimization in stochastic traffic engineering problems
scientific article; zbMATH DE number 1183717 (Why is no real title available?)
scientific article; zbMATH DE number 7803597 (Why is no real title available?)
Introduction to stochastic programming.
Investigating the recoverable robust single machine scheduling problem under interval uncertainty
Min-max and min-max (relative) regret approaches to representatives selection problem
Min-max and min-max regret versions of combinatorial optimization problems: A survey
Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
Mixed uncertainty sets for robust combinatorial optimization
On recoverable and two-stage robust selection problems with budgeted uncertainty
On scenario aggregation to approximate robust combinatorial optimization problems
On the complexity of a class of combinatorial optimization problems with uncertainty
On the recoverable robust traveling salesman problem
Recoverable robust knapsacks: the discrete scenario case
Representative scenario construction and preprocessing for robust combinatorial optimization problems
Robust discrete optimization and network flows
Robust optimization
Robust recoverable and two-stage selection problems
Robust solutions of uncertain linear programs
Solving two-stage robust optimization problems using a column-and-constraint generation method
Technical note -- two-stage sample robust optimization

This page was built for publication: Benchmarking problems for robust discrete optimization

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