The quickest flow problem
- 1 February 1993
- journal article
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 37 (1) , 31-58
- https://doi.org/10.1007/bf01415527
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- ORSEP (Operations research software exchange program)European Journal of Operational Research, 1990
- The quickest path problemComputers & Operations Research, 1990
- A survey of dynamic network flowsAnnals of Operations Research, 1989
- Implementing Goldberg's max-flow-algorithm ? A computational investigationMathematical Methods of Operations Research, 1989
- Dual Algorithms for Pure Network ProblemsOperations Research, 1989
- Shortest path algorithmsAnnals of Operations Research, 1988
- The relax codes for linear minimum cost network flow problemsAnnals of Operations Research, 1988
- An efficient implementation of the network simplex methodPublished by Springer Nature ,1986
- Complexity of some parametric integer and network programming problemsMathematical Programming, 1983
- Network Models for Building EvacuationManagement Science, 1982