Notes on Linear Programming: Part XXIX A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem

Notes on Linear Programming: Part XXIX A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem

Regular price $20.00 $20.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.