用于设计鲁棒网络的公式。风力发电中的应用
Formulations for designing robust networks. An application to wind power collection
摘要:
我们感兴趣的是生存能力限制根Steiner网络的设计。给定一个图G =(V,E),E上的容量和代价函数,根r,V的终端子集T和整数k,我们寻找一个最小代价子集E $\subset$ E,覆盖T和r,使得由E导出的网络是k-生存的:去掉任意k条边后,仍然存在从r到T的可行流.我们还考虑了保护给定数量的边缘的可能性。我们提出了三种不同的配方:一个割集,一个流和一个双层配方,其中第二层是一个最小-最大问题(与攻击者和防御者)。我们提出的算法,每个问题的制定,并比较其效率。
英文摘要:
We are interested in the design of survivable capacitated rooted Steiner networks. Given a graph G = (V, E), capacity and cost functions on E, a root r, a subset T of V of terminals and an integer k, we search for a minimum cost subset E $\subset$ E, covering T and r, such that the network induced by E is k-survivable: after the removal of any k edges, there still exists a feasible flow from r to T. We also consider the possibility of protecting a given number of edges. We propose three different formulations: a cut-set, a flow and a bi-level formulation where the second-level is a min-max problem (with an attacker and a defender). We propose algorithms for each problem formulation and compare their efficiency.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。