Technical Note—Optimality of a Heuristic Solution for a Class of Knapsack Problems
From MaRDI portal
Publication:4124599
DOI10.1287/opre.24.1.193zbMath0353.90056OpenAlexW1994780801MaRDI QIDQ4124599
No author found.
Publication date: 1976
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.24.1.193
Related Items (7)
Change-making problems revisited: a parameterized point of view ⋮ When greedy gives optimal: a unified approach ⋮ Characterization of canonical systems with six types of coins for the change-making problem ⋮ An extension of a greedy heuristic for the knapsack problem ⋮ A polynomially solvable special case of the unbounded knapsack problem ⋮ Heuristic methods and applications: A categorized survey ⋮ Combinatorics of the change-making problem
This page was built for publication: Technical Note—Optimality of a Heuristic Solution for a Class of Knapsack Problems
