Minimum Cost Multicommodity Circulation Problem with Convex Arc-Costs
- 1 November 1974
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 8 (4) , 355-360
- https://doi.org/10.1287/trsc.8.4.355
Abstract
The minimum cost multicommodity circulation problem with convex arc-costs is solved by using the negative directed cycles approach. This algorithm is used to compute equilibrium flows in a transportation network with elastic demands and congestion effects.Keywords
This publication has 0 references indexed in Scilit: