Notes on Linear Programming: Part XLI Constructing Maximal Dynamic Flows from Static Flows

Notes on Linear Programming: Part XLI Constructing Maximal Dynamic Flows from Static Flows

$20.00
{{option.name}}: {{selected_options[option.position]}}
{{value_obj.value}}

An outline of a method for constructing maximal dynamic flow from static flow and a presentation of a simple proof of maximality.

Show More Show Less