Paper Info
Title
The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths.
Abstract
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.
Year
DOI
Venue
2014
10.1016/j.dam.2014.06.008
Discrete Applied Mathematics
Keywords
Field
DocType
Dynamic network flow,Universally quickest transshipment,Uniform path-lengths
Mathematical optimization,Combinatorics,Arc (geometry),Transshipment problem,Sink (computing),Grid,Mathematics,Time function
Journal
Volume
ISSN
Citations 
178
0166-218X
0
PageRank 
References 
Authors
0.34
10
2
Name
Order
Citations
PageRank
Naoyuki Kamiyama111.05
naoki katoh21101187.43