.png){kind=icon}
返回
Robust min-max (regret) optimization using ordered weighted averaging
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2024.10.028.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In decision-making under uncertainty, several criteria have been studied to aggregate the performance of a solution over multiple possible scenarios. This paper introduces a novel variant of ordered weighted averaging (OWA) for optimization problems. It generalizes the classic OWA approach, which includes the robust min-max optimization as a special case, as well as the min-max regret optimization. We derive new complexity results for this setting, including insights into the inapproximability and approximability of this problem. In particular, we provide stronger positive approximation results that asymptotically improve the previously best-known bounds for the classic OWA approach.
Keyword:
Robust optimization
Ordered weighted averaging
Min-max regret
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
分享收藏Comparison among Methods for Induction Motor Low-Intrusive Efficiency Evaluation Including a New AGT Approach with a Modified Stator Resistance.png)
Energies
OAAI
EnergiesIF0
OAAI分享收藏Analysis of coherent laser echo characteristics back scattered from rough Gaussian targetOptik
OptikIF0
PREAI
分享收藏
查看更多内容