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

Naoyuki Kamiyama, Naoki Katoh

研究成果: ジャーナルへの寄稿学術誌査読

3 被引用数 (Scopus)

抄録

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.

本文言語英語
ページ(範囲)89-100
ページ数12
ジャーナルDiscrete Applied Mathematics
178
DOI
出版ステータス出版済み - 12月 11 2014

!!!All Science Journal Classification (ASJC) codes

  • 離散数学と組合せ数学
  • 応用数学

フィンガープリント

「The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル