.png){kind=icon}
返回
Exact algorithms for OWA-optimization in multiobjective spanning tree problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2011.09.003.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper deals with the multiobjective version of the optimal spanning tree problem. More precisely, we are interested in determining the optimal spanning tree according to an Ordered Weighted Average (OWA) of its objective values. We first show that the problem is weakly NP-hard. We then propose different mixed integer programming formulations, according to different subclasses of OWA functions. Furthermore, we provide various preprocessing procedures, the validity scopes of which depend again on the considered subclass of OWA functions. For designing such procedures, we propose generalized optimality conditions and efficiently computable bounds. These procedures enable to reduce the size of the instances before launching an off-the-shelf software for solving the mixed integer program. Their impact on the resolution time is evaluated on the basis of numerical experiments. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Multiobjective spanning tree problem
Ordered weighted average
MIP formulation
Optimality conditions
Bounding procedure
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Effects of Group Counseling Transmitted Through Videoconferencing on Changes in Eating Behaviors
.png){kind=icon}
PREAI
分享收藏分享收藏分享收藏
查看更多内容