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

关于最快最小费用转运问题的注记

A Note on the Quickest Minimum Cost Transshipment Problem

Martin Skutella

摘要:

Klinz和Woeginger(1995)证明了最小费用最快流问题是NP难问题。另一方面,最快最小费用流问题可以有效地解决了通过一个简单的最快流问题,没有费用。更一般地说,我们展示了如何最快的最小成本转运问题可以减少到有效地解决最快的转运问题,从而增加了另一个马赛克瓷砖丰富的复杂性景观流随着时间的推移。

英文摘要:

Klinz and Woeginger (1995) prove that the minimum cost quickest flow problem is NP-hard. On the other hand, the quickest minimum cost flow problem can be solved efficiently via a straightforward reduction to the quickest flow problem without costs. More generally, we show how the quickest minimum cost transshipment problem can be reduced to the efficiently solvable quickest transshipment problem, thus adding another mosaic tile to the rich complexity landscape of flows over time.

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

↑