A suggested computation for maximal multi-commodity network flows.
$15.00
{{option.name}}:
{{selected_options[option.position]}}
{{value_obj.value}}
A computation which uses the structure of one formulation of the multi-commodity problem within the framework of a simplex computation to determine maximal multi-commodity flows in networks. For this particular formulation, the number of variables is...
Show More
Show Less