Notes on Linear Programming: Part XX Maximal Flow Through a Network

Notes on Linear Programming: Part XX Maximal Flow Through a Network

$20.00 $20.00 Sale

A proof of the minimal cut theorem, for a general network, which determines a simple computational procedure for achieving a maximal flow in planar networks.