Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 13, 2026

Available Issues

April 10, 2013 - May 13, 2026

Minimum Cost Multicommodity Circulation Problem with Convex Arc-Costs

Published Online:1 Nov 1974https://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.

Previous
Back to Top
Next
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.
Agree