Multicommodity network flows—A survey
- 1 March 1978
- Vol. 8 (1), 37-91
- https://doi.org/10.1002/net.3230080107
Abstract
No abstract availableKeywords
This publication has 63 references indexed in Scilit:
- A generalized upper bounding approach to a communications network planning problemNetworks, 1977
- The Gradient Projection Algorithm for Multiple Routing in Message-Switched NetworksIEEE Transactions on Communications, 1976
- A minimum‐cost multicommodity network flow problem concerning imports and exportsNetworks, 1975
- An algorithm for nonlinear multicommodity flow problemsNetworks, 1974
- Minimum cost routing for dynamic network modelsNetworks, 1973
- Minimal disconnecting sets in directed multi‐commodity networksNaval Research Logistics Quarterly, 1972
- The multicommodity network flow model revised to include vehicle per time period and node constraintsNaval Research Logistics Quarterly, 1972
- Minimum cost routing for static network modelsNetworks, 1971
- Routing in computer networksNetworks, 1971
- Optimal multicommodity network flows with resource allocationNaval Research Logistics Quarterly, 1970