.png){kind=icon}
返回
Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: An algorithm with reoptimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2011.09.006.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper addresses multicriteria combinatorial optimization problems involving one cost and several bottleneck objective functions. An algorithm is developed which generates the minimal complete set of Pareto-optimal solutions. This algorithm runs in polynomial time as long as the single objective problem considering only the cost function can be solved polynomially. A reoptimization procedure is used to accelerate the convergence of the algorithm. Applications are given. Computational results on randomly generated instances and planar grid graphs concerning the minimum cost spanning tree and the shortest path problem are presented. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Multicriteria combinatorial optimization
Pareto-optimal solution
Bottleneck function
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
PREAI
分享收藏Risk Factors Analysis for 90-Day Mortality of Adult Patients with Mild Traumatic Brain Injury in an Italian Emergency Department.png)
Geriatrics
OAAI
GeriatricsIF0
OAAI分享收藏
查看更多内容