The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths ?
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.
universally quickest transshipment uniform path-lengths dynamic network flow