A simple algorithm for finding maximal network flows and an application to the Hitchcock problem.

A simple algorithm for finding maximal network flows and an application to the Hitchcock problem.

$15.00 $15.00 Sale

A solution for finding a maximal flow and minimal cut in a transportation network in order to determine an efficient computational routine for the Hitchcock distribution problem....