Notes on Linear Programming: Part XLV A Network-Flow Feasibility Theorem and Combinatorial Applications
$20.00
{{option.name}}:
{{selected_options[option.position]}}
{{value_obj.value}}
An establishment of necessary and sufficient conditions for the existence of a flow in a network (e.g., a railway network) satisfying prescribed bounds on the net flow leaving certain nodes and entering other nodes.
Show More
Show Less