Integer Programming and [K]-th Shortest Paths.

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....