A Survey on Multiple Objective Minimum Spanning Tree Problems

A Survey on Multiple Objective Minimum Spanning Tree Problems
复制标题

多目标最小生成树问题综述

DOI:
--
复制
发表时间:
2009
期刊:
Algorithmics of Large and Complex Networks
影响因子:
--
通讯作者:
H. Hamacher
H. Hamacher
中科院分区:
--
文献类型:
--
作者:
Stefan Ruzika;H. Hamacher

文献摘要

被引文献

相似文献

我们回顾文献中的最小生成树问题的两个或两个以上的目标函数(MOST),其中每个是总和或瓶颈类型。不同类型的这个问题的理论方面进行了总结和可用的算法进行分类和解释。该文件包括一个简明的表格介绍了所有审查的文件。
We review the literature on minimum spanning tree problems with two or more objective functions (MOST) each of which is of the sum or bottleneck type. Theoretical aspects of different types of this problem are summarized and available algorithms are categorized and explained. The paper includes a concise tabular presentation of all the reviewed papers.