Integer Programming and [K]-th Shortest Paths.
ResearchPublished 1971
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.
Document Details
- Copyright: RAND Corporation
- Availability: Available
- Year: 1971
- Print Format: Paperback
- Paperback Pages: 5
- Paperback Price: $20.00
- Document Number: P-4592
Citation
RAND Style Manual
Chicago Manual of Style
Fox, Bennett L., Integer Programming and [K]-th Shortest Paths. RAND Corporation, P-4592, 1971. As of September 5, 2024: https://www.rand.org/pubs/papers/P4592.html
Fox, Bennett L., Integer Programming and [K]-th Shortest Paths. Santa Monica, CA: RAND Corporation, 1971. https://www.rand.org/pubs/papers/P4592.html. Also available in print form.
This publication is part of the RAND paper series. The paper series was a product of RAND 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.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
RAND 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.