The Quickest Transshipment Problem
Top Cited Papers
- 1 February 2000
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 25 (1) , 36-62
- https://doi.org/10.1287/moor.25.1.36.15211
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Efficient continuous-time dynamic network flow algorithmsOperations Research Letters, 1998
- Task Scheduling in NetworksSIAM Journal on Discrete Mathematics, 1997
- Algorithms for the quickest path problem and the enumeration of quickest pathsComputers & Operations Research, 1991
- The quickest path problemComputers & Operations Research, 1990
- A Fast Parametric Maximum Flow Algorithm and ApplicationsSIAM Journal on Computing, 1989
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- Modeling of building evacuation problems by network flows with side constraintsEuropean Journal of Operational Research, 1988
- Optimal dynamic routing in communication networks with continuous trafficNetworks, 1984
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983
- Optimal flows in networks with multiple sources and sinksMathematical Programming, 1974