![Integer Programming and [K]-th Shortest Paths.](https://cdn.shopify.com/s/files/1/2593/4634/products/b60865a52868a340075036aaf8c6aee1_1595b79b-0b17-4df3-86fd-4dee761f7ed2.jpg?v=1525997784)
Integer Programming and [K]-th Shortest Paths.
$20.00
{{option.name}}:
{{selected_options[option.position]}}
{{value_obj.value}}
Integer programs can be solved using a [K]-th shortest-path algorithm on a network due to Gomery. To assure finite convergence, a perturbed program is introduced that has the preferred optimal solution. 5 pp. Ref....
Show More
Show Less