The robust selection problem with information discovery
From MaRDI portal
Cites work
- A branch and bound algorithm for robust binary optimization with budget uncertainty
- A class of stochastic programs with decision dependent random elements
- A linear time algorithm for the robust recoverable selection problem
- A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- Bulk-robust combinatorial optimization
- Cardinality constrained combinatorial optimization: complexity and polyhedra
- Combinatorial robust optimization with decision-dependent information discovery and polyhedral uncertainty
- Computing minimum spanning trees with uncertainty
- Computing shortest paths with uncertainty
- Exact and approximate schemes for robust optimization problems with decision-dependent information discovery
- On recoverable and two-stage robust selection problems with budgeted uncertainty
- Optimization of R\&D project portfolios under endogenous uncertainty
- Optimization under decision-dependent uncertainty
- Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
- Recycling inequalities for robust combinatorial optimization with budget uncertainty
- Robust combinatorial optimization with variable budgeted uncertainty
- Robust discrete optimization and network flows
- Robust recoverable and two-stage selection problems
- The Price of Robustness
- The robust knapsack problem with queries
- Time bounds for selection
- Uncertainty reduction in robust optimization
- K-adaptability in two-stage robust binary programming
This page was built for publication: The robust selection problem with information discovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6859875)
