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

Naoyuki Kamiyama, Naoki Katoh

Research output: Contribution to journalArticle

3 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)89-100
Number of pages12
JournalDiscrete Applied Mathematics
Volume178
DOIs
Publication statusPublished - Dec 11 2014

Fingerprint

Dynamic Networks
Path Length
Polynomials
Polynomial-time Algorithm
Arc of a curve
Maximise
Grid
Minimise
Class

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this

The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths. / Kamiyama, Naoyuki; Katoh, Naoki.

In: Discrete Applied Mathematics, Vol. 178, 11.12.2014, p. 89-100.

Research output: Contribution to journalArticle

@article{06e0b5f53b8549b1986146982fbee5a6,
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.",
author = "Naoyuki Kamiyama and Naoki Katoh",
year = "2014",
month = "12",
day = "11",
doi = "10.1016/j.dam.2014.06.008",
language = "English",
volume = "178",
pages = "89--100",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",

}

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

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

VL - 178

SP - 89

EP - 100

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

ER -