On continuous network flows
- 28 February 1995
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 17 (1) , 27-36
- https://doi.org/10.1016/0167-6377(94)00035-5
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Minimum weight paths in time‐dependent networksNetworks, 1991
- Continuous-Time Flows in NetworksMathematics of Operations Research, 1990
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-lengthJournal of the ACM, 1990
- Optimal Dynamic Routing in Single Commodity Networks by Iterative MethodsIEEE Transactions on Communications, 1987
- A Class of Continuous Network Flow ProblemsMathematics of Operations Research, 1982
- A generalized dynamic flows problemNetworks, 1979
- Shortest route with time dependent length of edges and limited delay possibilities in nodesMathematical Methods of Operations Research, 1977
- The Modeling of Adaptive Routing in Data-Communication NetworksIEEE Transactions on Communications, 1977
- Transient flows in networks.The Michigan Mathematical Journal, 1959
- Constructing Maximal Dynamic Flows from Static FlowsOperations Research, 1958