抽象流随时间变化:解决动态包装问题的第一步
Abstract flows over time: A first step towards solving dynamic packing problems
摘要:
随时间变化的流通过引入时间的概念来推广经典网络流。每个弧都配备了一个通行时间,指定了流需要多长时间才能穿过它,而流量可能会随着时间的推移而变化,在给定的边缘容量。在本文中,我们扩展了这个概念的动态优化问题的抽象流的更一般的设置。在这个模型中,底层网络被线性有序集合的抽象系统所取代,称为“路径”,满足一个简单的切换性质:当两条路径P和Q相交时,必须有另一条路径包含在P的开始和Q的结束。我们表明,随着时间的推移,最大的抽象流可以通过解决加权抽象流问题,并从其解决方案构建一个时间上重复的流。在证明的过程中,我们还表明,抽象网络的相对适度的切换属性已经捕获了经典网络的许多基本属性。
英文摘要:
Flows over time generalize classical network flows by introducing a notion of time. Each arc is equipped with a transit time that specifies how long flow takes to traverse it, while flow rates may vary over time within the given edge capacities. In this paper, we extend this concept of a dynamic optimization problem to the more general setting of abstract flows. In this model, the underlying network is replaced by an abstract system of linearly ordered sets, called "paths" satisfying a simple switching property: Whenever two paths P and Q intersect, there must be another path that is contained in the beginning of P and the end of Q. We show that a maximum abstract flow over time can be obtained by solving a weighted abstract flow problem and constructing a temporally repeated flow from its solution. In the course of the proof, we also show that the relatively modest switching property of abstract networks already captures many essential properties of classical networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。