Restricted robust uniform matroid maximization under interval uncertainty
From MaRDI portal
Recommendations
- Robust approach to restricted items selection problem
- On the complexity of a class of combinatorial optimization problems with uncertainty
- Minmax regret bottleneck problems with solution-induced interval uncertainty structure
- Short paper -- A note on robust combinatorial optimization with generalized interval uncertainty
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
Cites work
- scientific article; zbMATH DE number 4083375 (Why is no real title available?)
- A branch and bound algorithm for the robust shortest path problem with interval data.
- A branch and bound algorithm for the robust spanning tree problem with interval data
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- On the complexity of a class of combinatorial optimization problems with uncertainty
- On the complexity of the robust spanning tree problem with interval data
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Robust convex optimization
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- The Price of Robustness
- The computational complexity of the relative robust shortest path problem with interval data
- The robust spanning tree problem with interval data
Cited in
(13)- Portfolio selection under uncertainty: a new methodology for computing relative‐robust solutions
- Robust approach to restricted items selection problem
- Formulation and algorithms for the robust maximal covering location problem
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
- A capacitated hub location problem under hose demand uncertainty
- Minmax regret bottleneck problems with solution-induced interval uncertainty structure
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
- A unified approach to uncertain optimization
- Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets
- A double oracle approach to minmax regret optimization problems with interval data
- Robust optimization of contaminant sensor placement for community water systems
- A minmax regret approach to the critical path method with task interval times
This page was built for publication: Restricted robust uniform matroid maximization under interval uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879971)
