Notes on Linear Programming: Part XXXIV A Primal Dual Algorithm for the Capacitated Hitchcock Problem
$20.00
{{option.name}}:
{{selected_options[option.position]}}
{{value_obj.value}}
An algorithm for solving capacitated Hitchcock problems and a proof of convergence in a finite number of steps. The proposed algorithm is a generalization of a combinatorial method discovered by Kuhn for the optimal assignment problem.
Show More
Show Less