Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty

DOI10.1016/J.EJOR.2017.12.018zbMath1403.90585arXiv1701.06317OpenAlexW2582217285MaRDI QIDQ723948

Lisa Thom, Andrea Raith, Anita Schöbel, Marie E. Schmidt

Publication date: 25 July 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.06317

zbMATH Keywords

combinatorial optimizationrobust optimizationmultiple objective programmingshortest path problemmulti-objective robust optimization

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Combinatorial optimization (90C27)

Related Items (11)

Dominance for multi-objective robust optimization concepts ⋮ A fully polynomial time approximation scheme for the probability maximizing shortest path problem ⋮ Algorithms for the minmax regret path problem with interval data ⋮ Robust optimality conditions for multiobjective programming problems under data uncertainty and its applications ⋮ Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty ⋮ Min-ordering and max-ordering scalarization methods for multi-objective robust optimization ⋮ Facing robustness as a multi-objective problem: a bi-objective shortest path problem in smart regions ⋮ Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach ⋮ Extensions of labeling algorithms for multi‐objective uncertain shortest path problems ⋮ The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems ⋮ Pareto solutions in multicriteria optimization under uncertainty

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• GitHub
• Minmax robustness for multi-objective optimization problems
• Bi-objective robust optimisation
• Robust multiple objective game theory
• Generalized multiple objective bottleneck problems
• An aggregate label setting policy for the multi-objective shortest path problem
• On a multicriteria shortest path problem
• Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Robust discrete optimization and network flows
• Decision uncertainty in multiobjective optimization
• A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty
• The relationship between multi-objective robustness concepts and set-valued optimization
• An application of deterministic and robust optimization in the wood cutting industry
• On robust multiobjective optimization
• Robust multiobjective optimization \& applications in portfolio optimization
• The Price of Robustness
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Optimality and duality for robust multiobjective optimization problems
• Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts

This page was built for publication: Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty