Integer Programming and [K]-th Shortest Paths.

by Bennett L. Fox

Purchase

Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback5 pages $20.00 $16.00 20% Web Discount

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.

This report is part of the RAND Corporation Paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.

The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.