A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
RAND CORP SANTA MONICA CA
Pagination or Media Count:
A very simple algorithm for finding a maximal flow and minimal cut in a transportation network is described it is then applied to obtain an efficient computational routine for the Hitchcock distribution problem.
- Theoretical Mathematics