.png){kind=icon}
返回
Computing all efficient solutions of the biobjective minimum spanning tree problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2006.02.023.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A common way of computing all efficient (Pareto optimal) solutions for a biobjective combinatorial optimisation problem is to compute first the extreme efficient solutions and then the remaining, non-extreme solutions. The second phase, the computation of non-extreme solutions, can be based on a k-best algorithm for the single-objective version of the problem or on the branch-and-bound method. A k-best algorithm computes the k-best solutions in order of their objective values. We compare the performance of these two approaches applied to the biobjective minimum spanning tree problem. Our extensive computational experiments indicate the overwhelming superiority of the k-best approach. We propose heuristic enhancements to this approach which further improve its performance. (C) 2006 Elsevier Ltd. All rights reserved.
Keyword:
multiple objective programming
combinatorial optimisation
minimum spanning tree
k-best algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions
OAAI
OAAI分享收藏Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
PREAI
分享收藏分享收藏
查看更多内容