Stochastic Sensitivity Analysis of Maximum Flow and Shortest Route Networks.
$20.00
{{option.name}}:
{{selected_options[option.position]}}
{{value_obj.value}}
An expansion of earlier work to show the equivalence of (1) the interdiction problem of minimizing flow on a network, and (2) the improvement problem of shortening a route as much as possible. The breakdowns (in the first case) and improvements (in ...
Show More
Show Less