The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths
type: Item
instance of: scholarly article
title: The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths
zbMATH Open document ID: 1303.90014
author: Naoyuki Kamiyama
author: Naoki Katoh
published in: Discrete Applied Mathematics
publication date: 2014-09-12T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B20
zbMATH DE Number: 6343748
zbMATH Keywords: dynamic network flow
zbMATH Keywords: universally quickest transshipment
zbMATH Keywords: uniform path-lengths
MaRDI profile type: Publication
full work available at URL: j.dam.2014.06.008
OpenAlex ID: W2024965808
cites work: Q3056948
cites work: Earliest Arrival Flows with Multiple Sources
cites work: Faster algorithms for the quickest transshipment problem
cites work: Quickest Flows Over Time
cites work: Q3292914
cites work: Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
cites work: A Fast Parametric Maximum Flow Algorithm and Applications
cites work: A new approach to the maximum-flow problem
cites work: Optimal dynamic routing in communication networks with continuous traffic
cites work: Multicommodity flows over time: Efficient algorithms and complexity
cites work: Q2776597
cites work: The quickest transshipment problem
cites work: Note—Some Equivalent Objectives for Dynamic Network Flow Problems
cites work: The Minimum Weight In-Tree Cover Problem
cites work: An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths
cites work: An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
cites work: A good algorithm for lexicographically optimal flows in multi-terminal networks
cites work: Optimal flows in networks with multiple sources and sinks
cites work: Maximal, Lexicographic, and Dynamic Network Flows
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
DOI: 10.1016/J.DAM.2014.06.008
description: scientific article; zbMATH DE number 6343748