Heuristics for the strong generalized minimum label spanning tree problem
NETWORKS(2019)
摘要
In this work we introduce and study the strong generalized minimum label spanning tree (GMLST), a novel optimization problem defined on edge-labeled graphs. Given a label set associated to each edge of the input graph, the aim is to look for the spanning tree using the minimum number of labels. Differently from the previously introduced GMLST problem, including a given edge in the solution means that all its labels are used. We present a mathematical formulation, as well as three heuristic approaches to solve the problem. Computational results compare the performances of the proposed algorithms.
更多查看译文
关键词
carousel greedy,generalized problem,minimum label spanning tree,pilot method
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络