TY - JOUR

T1 - The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths

AU - Kamiyama, Naoyuki

AU - Katoh, Naoki

N1 - Publisher Copyright:
© 2014 Elsevier Ltd. All rights reserved.

PY - 2014/12/11

Y1 - 2014/12/11

N2 - In the universally quickest transshipment problem, we are given a network with a transit time function on its arc set. The goal is to minimize the time when the last supply reaches the sink and to maximize the amount of supplies which have reached the sink at every time step. In this paper, we consider this problem in a class of dynamic networks which is a generalization of grid networks with uniform capacity and uniform transit time, and present a polynomial-time algorithm for this case.

AB - In the universally quickest transshipment problem, we are given a network with a transit time function on its arc set. The goal is to minimize the time when the last supply reaches the sink and to maximize the amount of supplies which have reached the sink at every time step. In this paper, we consider this problem in a class of dynamic networks which is a generalization of grid networks with uniform capacity and uniform transit time, and present a polynomial-time algorithm for this case.

UR - http://www.scopus.com/inward/record.url?scp=84907712180&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84907712180&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2014.06.008

DO - 10.1016/j.dam.2014.06.008

M3 - Article

AN - SCOPUS:84907712180

SN - 0166-218X

VL - 178

SP - 89

EP - 100

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

ER -