You are not currently logged in.
Access JSTOR through your library or other institution:
Earliest Arrival Flows with Multiple Sources
Nadine Baumann and Martin Skutella
Mathematics of Operations Research
Vol. 34, No. 2 (May, 2009), pp. 499-512
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/40538395
Page Count: 14
You can always find the topics here!Topics: Transshipment, Mathematical problems, Mathematical functions, Polynomials, Algorithms, Mathematics, Operations research, Supply and demand, Mathematical intervals, Mathematical theorems
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
Earliest arrival flows capture the essence of evacuation planning. Given a network with capacities and transit times on the arcs, a subset of source nodes with supplies and a sink node, the task is to send the given supplies from the sources to the sink "as quickly as possible." The latter requirement is made more precise by the earliest arrival property, which requires that the total amount of flow that has arrived at the sink is maximal for all points in time simultaneously. It is a classical result from the 1970s that, for the special case of a single source node, earliest arrival flows do exist and can be computed by essentially applying the successive shortest-path algorithm for min-cost flow computations. Although it has previously been observed that an earliest arrival flow still exists for multiple sources, the problem of computing one efficiently has been open for many years. We present an exact algorithm for this problem whose running time is strongly polynomial in the input plus output size of the problem.
Mathematics of Operations Research © 2009 INFORMS