COMPUTATIONAL EXPERIENCE WITH A MULTICOMMODITY NETWORK FLOW ALGORITHM
This paper discusses the computational results achieved with an experimental implementation of an algorithm for solving the minimum cost multicommodity flow problem for directed graphs. As programmed, the method combines aspects of network flow, partition programming, working bases and the use of secondary constraints. Computationally, this approach is particularly attractive within the multicommodity framework. The experimental results reveal the efficiency of the algorithm as solution strategies and problem parameters are varied. A comparison is also made with the corresponding linear programming solutions.
- NATO Conference on Appl of Optim Methods for Large-Scale Resour Allocation, Proc, Pap, Elsinore, Denver, July 5-9 1971.
Crane, Russak, and CompanyNew York, NY USA
- Grigoriadis, M D
- White, W W
- Publication Date: 1974
- Features: References;
- Pagination: p. 205-226
- TRT Terms: Commodities; Demand; Freight transportation; Mathematical models; Network analysis (Planning); Statistics
- Old TRIS Terms: Commodity statistics
- Subject Areas: Data and Information Technology; Freight Transportation; Railroads;
- Accession Number: 00096604
- Record Type: Publication
- Files: TRIS
- Created Date: Jul 29 1975 12:00AM