Back to Search
Start Over
An Algorithm for Globally-Optimal Nonlinear-Cost Multidimensional Flows in Networks and Some Special Applications.
- Source :
- Operations Research; Jan/Feb73, Vol. 21 Issue 1, p225-239, 15p
- Publication Year :
- 1973
-
Abstract
- This paper describes an algorithm that finds globally optimum flows in networks having nonlinear costs of arc flows, the flows being finite-dimensional vectors such as multicommodity flows. The algorithm is an extension of an idea of ALLSOP [Trans. Sci. 2, 1–13 (1968)] for minimizing total delays in a traffic network; it is also intimately related to results in nonserial dynamic programming. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 0030364X
- Volume :
- 21
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- Operations Research
- Publication Type :
- Academic Journal
- Accession number :
- 8735784
- Full Text :
- https://doi.org/10.1287/opre.21.1.225