Operations Research · 1976 · 13 citations · 1 references
Natural SciencesDecision SciencesOptimizationCombinatorial OptimizationConstrained OptimizationHeuristic OptimizationHeuristic SearchInteger ProgrammingOptimization TheoryBin Packing ProblemCombinatorial Optimization HeuristicsEnumerative AlgorithmsHeuristic AlgorithmsKnapsack ProblemsOptimality CriteriaScheduling Problems
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.
1