Faster Algorithms for the Quickest Transshipment Problem
From MaRDI portal
Publication:2719247
DOI10.1137/S1052623497327295zbMath0992.68071MaRDI QIDQ2719247
Publication date: 21 June 2001
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27)
Related Items (13)
Earliest Arrival Flows in Networks with Multiple Sinks ⋮ Dynamic resource allocation problem for transportation network evacuation ⋮ Lexicographically optimal earliest arrival flows ⋮ An Introduction to Network Flows over Time ⋮ Algorithms for Finding Optimal Flows in Dynamic Networks ⋮ Unnamed Item ⋮ An introduction to dynamic generative networks: minimum cost flow ⋮ Earliest arrival flows in networks with multiple sinks ⋮ Universally maximum flow with piecewise-constant capacities ⋮ A heuristic algorithm for the earliest arrival flow with multiple sources ⋮ A survey on models and algorithms for discrete evacuation planning network problems ⋮ The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths ⋮ Traffic Networks and Flows over Time
This page was built for publication: Faster Algorithms for the Quickest Transshipment Problem
