Title of article
An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths Original Research Article
Author/Authors
Naoyuki Kamiyama، نويسنده , , Naoki Katoh، نويسنده , , Atsushi Takizawa، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
13
From page
3665
To page
3677
Abstract
In this paper, we consider the evacuation problem in a network which consists of a directed graph with capacities and transit times on its arcs. This problem can be solved by the algorithm of Hoppe and Tardos [B. Hoppe, É. Tardos, The quickest transshipment problem, Math. Oper. Res. 25(1) (2000) 36–62] in polynomial time. However their running time is high-
Keywords
Evacuation problem , Dynamic network , Uniform path-length
Journal title
Discrete Applied Mathematics
Serial Year
2009
Journal title
Discrete Applied Mathematics
Record number
887301
Link To Document