Page
%P
![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow
The minimum-cost multicommodity flow problem involves si- multaneously ship** multiple commodities through a single network so that the total flow obeys arc capacity constraints and has minimum cost. Multicommo...