A Finite Renewal Algorithm for the Knapsack and Turnpike Models

Jeremy F. Shapiro and Harvey M. Wagner
Additional contact information
Jeremy F. Shapiro: Stanford University, Stanford, California
Harvey M. Wagner: Stanford University, Stanford, California

Operations Research, 1967, vol. 15, issue 2, 319-341

Abstract: The mathematical and algorithmic connections between the knapsack problem and a fundamental renewal-type problem are established. The renewal point of view leads to an efficient computational result and is based in part on an extension of a turnpike theorem shown by Gilmore and Gomory. The distribution of effort model is examined briefly by means of the renewal approach so as to add new insight to the mathematical structure of this problem.

Date: 1967
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.15.2.319 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:15:y:1967:i:2:p:319-341

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().