Technical Note—Optimality of a Heuristic Solution for a Class of Knapsack Problems

T. C. Hu and M. L. Lenard
Additional contact information
T. C. Hu: University of California, La Jolla, California
M. L. Lenard: University of Wisconsin, Madison, Wisconsin

Operations Research, 1976, vol. 24, issue 1, 193-196

Abstract: This paper presents a simpler proof for a result of Magazine, Nemhauser, and Trotter, which states recursive necessary and sufficient conditions for the optimality of a heuristic solution for a class of knapsack problems.

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.24.1.193 (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:24:y:1976:i:1:p:193-196

Access Statistics for this article

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