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

DOI10.1287/OPRE.24.1.193MaRDI QIDQ4124599zbMATH OpenOpenAlexFDO

Authors

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

Mathematics Subject Classification ID

Integer programming (90C10)

Cited in

(10)

• A polynomially solvable special case of the unbounded knapsack problem
• On the Frobenius number and genus of a collection of semigroups generalizing repunit numerical semigroups
• Heuristic methods and applications: A categorized survey
• An extension of a greedy heuristic for the knapsack problem
• Combinatorics of the change-making problem
• Change-making problems revisited: a parameterized point of view
• Characterization of canonical systems with six types of coins for the change-making problem
• The Frobenius formula for \(A=(a,ha+d,ha+b_2 d, \ldots, ha+b_k d)\)
• The change-making problem for six coin values and beyond
• When greedy gives optimal: a unified approach

This page was built for publication: Technical Note—Optimality of a Heuristic Solution for a Class of Knapsack Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4124599)