A bicriteria approach to robust optimization
From MaRDI portal
Publication:342179
DOI10.1016/j.cor.2015.08.007zbMath1349.90602OpenAlexW1856777849MaRDI QIDQ342179
Marc Goerigk, André B. Chassein
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/76493/1/Paper.pdf
linear programmingcolumn generationrobust optimizationbicriteria optimizationminimum cost flow problem
Related Items (8)
A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty ⋮ Algorithms and uncertainty sets for data-driven robust shortest path problems ⋮ On Lagrangian relaxation for constrained maximization and reoptimization problems ⋮ Ranking robustness and its application to evacuation planning ⋮ Min max min robust (relative) regret combinatorial optimization ⋮ 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 ⋮ Robustness of solutions to the capacitated facility location problem with uncertain demand
Uses Software
Cites Work
- Unnamed Item
- Minmax robustness for multi-objective optimization problems
- Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
- \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Robust solutions of uncertain linear programs
- Robust discrete optimization and its applications
- Robust solutions of linear programming problems contaminated with uncertain data
- Robust Convex Optimization
- Theory and Applications of Robust Optimization
- The Price of Robustness
- Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
This page was built for publication: A bicriteria approach to robust optimization
