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

T. C. Hu, Melanie L. Lenard

Operations Research · 1976 · 13 citations · 1 references

Concepts

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.

References

1