arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1312.6447cs.DMcs.DS
收藏

最大流增量网络设计

Incremental Network Design with Maximum Flows

Thomas Kalinowski, Dmytro Matsypura, Martin W. P. Savelsbergh

摘要:

我们研究了一个增量网络设计问题,在每个时间段的规划地平线的弧可以添加到网络和最大流问题得到解决,其目标是在整个规划地平线上的累积流量最大化。在提出了两个混合整数规划(MIP)配方这个NP-完全问题,我们描述了几个算法,并证明了一些特殊情况下的性能界限。在一系列的计算实验中,我们比较了MIP公式的性能以及算法。

英文摘要:

We study an incremental network design problem, where in each time period of the planning horizon an arc can be added to the network and a maximum flow problem is solved, and where the objective is to maximize the cumulative flow over the entire planning horizon. After presenting two mixed integer programming (MIP) formulations for this NP-complete problem, we describe several heuristics and prove performance bounds for some special cases. In a series of computational experiments, we compare the performance of the MIP formulations as well as the heuristics.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑