Recommendations
Cites work
- Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Minmax robustness for multi-objective optimization problems
- Robust convex optimization
- Robust discrete optimization and its applications
- Robust optimization
- Robust solutions of linear programming problems contaminated with uncertain data
- Robust solutions of uncertain linear programs
- Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
- The Price of Robustness
- Theory and applications of robust optimization
- \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows
Cited in
(9)- A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty
- On Lagrangian relaxation for constrained maximization and reoptimization problems
- Robustness of solutions to the capacitated facility location problem with uncertain demand
- Complexity of strict robust integer minimum cost flow problems: an overview and further results
- The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems
- Ranking robustness and its application to evacuation planning
- Algorithms and uncertainty sets for data-driven robust shortest path problems
- Bi-level optimization approach for robust mean-variance problems
- Min max min robust (relative) regret combinatorial optimization
This page was built for publication: A bicriteria approach to robust optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342179)