arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1302.5871cs.DS
收藏

运输问题

The Budgeted Transportation Problem

S. Kapoor, M. Sarwat

摘要:

考虑一个具有多个源和汇的运输问题。利润和价格都在边缘。目标是在满足以下约束的情况下实现利润最大化:从源流出的总流量不得超过其容量,汇上流入流量的总价格不得超过其预算。这个问题与广义流问题密切相关。我们提出了一个基于拍卖的原始对偶近似算法来解决这个问题。复杂度是$O(ε^{-1}(n^2+ n\log{m})m\log U)$,其中$n$是源的数量,$m$是汇的数量,$U$是最大利润/价格与最小利润/价格的比率。我们还展示了如何推广的计划,以解决更一般的版本的问题,有边缘的能力和/或利润函数是凹的和分段线性。该算法的复杂性取决于利润函数的线性段的数量,称为${\cal L}$。

英文摘要:

Consider a transportation problem with sets of sources and sinks. There are profits and prices on the edges. The goal is to maximize the profit while meeting the following constraints; the total flow going out of a source must not exceed its capacity and the total price of the incoming flow on a sink must not exceed its budget. This problem is closely related to the generalized flow problem. We propose an auction based primal dual approximation algorithm to solve the problem. The complexity is $O(ε^{-1}(n^2+ n\log{m})m\log U)$ where $n$ is the number of sources, $m$ is the number of sinks, $U$ is the ratio of the maximum profit/price to the minimum profit/price. We also show how to generalize the scheme to solve a more general version of the problem, where there are edge capacities and/or the profit function is concave and piece-wise linear. The complexity of the algorithm depends on the number of linear segments, termed ${\cal L}$, of the profit function.

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

↑