区间费用Steiner树问题的最小-最大后悔方法
A min-max regret approach for the Steiner Tree Problem with Interval Costs
摘要:
设G=(V,E)是一个连通图,其中V和E分别表示图的点集和边集.此外,设Q \subseteq V是一组终端节点,r \in Q是图的根节点。给定与每条边(i,j)\in E相关联的权重c_{ij} \in \mathbb{N},图中的斯坦纳树问题(STP)在于找到G的跨越Q中所有节点的最小权重子图。在本文中,我们考虑的最小-最大后悔Steiner树问题的区间成本(MMR-STP),STP的一个强大的变种。在该变型中,边的权重不是预先已知的,而是假定在区间[ l_{ij},u_{ij} ]中变化。我们开发了一个ILP配方,一个精确的算法,和三个算法。经典STP实例的推广上进行的计算实验,评估所提出的方法的效率和限制。
英文摘要:
Let G=(V,E) be a connected graph, where V and E represent, respectively, the node-set and the edge-set. Besides, let Q \subseteq V be a set of terminal nodes, and r \in Q be the root node of the graph. Given a weight c_{ij} \in \mathbb{N} associated to each edge (i,j) \in E, the Steiner Tree Problem in graphs (STP) consists in finding a minimum-weight subgraph of G that spans all nodes in Q. In this paper, we consider the Min-max Regret Steiner Tree Problem with Interval Costs (MMR-STP), a robust variant of STP. In this variant, the weight of the edges are not known in advance, but are assumed to vary in the interval [l_{ij}, u_{ij}]. We develop an ILP formulation, an exact algorithm, and three heuristics for this problem. Computational experiments, performed on generalizations of the classical STP instances, evaluate the efficiency and the limits of the proposed methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。