Benchmarking problems for robust discrete optimization

Cites Work

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

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)