arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1904.09397math.OCcs.DS
收藏

多商品流问题的组合算法

A Combinatorial Algorithm for the Multi-commodity Flow Problem

Pengfei Liu

摘要:

研究了多商品流问题的组合算法。我们放宽了容量限制,并引入了一个罚函数$h$为每个弧。如果流超过弧$a$上的容量,则弧$a$将具有惩罚成本。在罚函数$h$的基础上,引入了平衡拟流的概念。然后,我们设计了一个组合算法来获得平衡伪流。如果平衡伪流是非零平衡伪流,则多商品流问题不存在可行解;如果平衡伪流是零平衡伪流,则多商品流问题存在可行解,零平衡伪流就是可行解。最后,给出了多商品流问题的非线性描述,其解为均衡伪流。此外,本文的研究内容可以很容易地推广到最小费用多商品流问题。

英文摘要:

This paper researches combinatorial algorithms for the multi-commodity flow problem. We relax the capacity constraints and introduce a penalty function $h$ for each arc. If the flow exceeds the capacity on arc $a$, arc $a$ would have a penalty cost. Based on the penalty function $h$, a new conception, equilibrium pseudo-flow, is introduced. Then we design a combinatorial algorithm to obtain equilibrium pseudo-flow. If the equilibrium pseudo-flow is a nonzero-equilibrium pseudo-flow, there exists no feasible solution for the multi-commodity flow problem; if the equilibrium pseudo-flow is a zero-equilibrium pseudo-flow, there exists a feasible solution for the multi-commodity flow problem and the zero-equilibrium pseudo-flow is the feasible solution. At last, a non-linear description of the multi-commodity flow problem is given, whose solution is equilibrium pseudo-flow. Besides, the content in this paper can be easily generalized to minimum cost multi-commodity flow problem.

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

↑