arrow
返回

Using the WOWA operator in robust discrete optimization problems

delete2016-01-01
delete6
delete
OA
AI
A
Adam Kasperski *
P
Paweł Zieliński
DOI:10.1016/j.ijar.2015.10.005delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
In this paper a class of discrete optimization problems with uncertain costs is discussed. The uncertainty is modeled by introducing a scenario set containing a finite number of cost scenarios. A probability distribution over the set of scenarios is available. In order to choose a solution the weighted OWA criterion (WOWA) is applied. This criterion allows decision makers to take into account both probabilities for scenarios and the degree of pessimism/optimism. In this paper the complexity of the considered class of discrete optimization problems is described and some exact and approximation algorithms for solving it are proposed. Applications to the selection and the assignment problems, together with results of computational tests are shown. (C) 2015 Elsevier Inc. All rights reserved.
Keyword:
Robust optimization
Weighted OWA
Computational complexity
Approximation algorithms
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

International Journal of Approximate Reasoning 封面图
International Journal of Approximate Reasoning
IF:
3
论文数:
3.0K
被引数:
5.1K

机构

W
wroclaw university of science & technology
学者数:
7.4K
论文数: 7.1K
被引数: 2
引用论文

引用论文

err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
学者 查看更多内容