Error Bounds and the Applicability of the Greedy Solution to the Coin-Changing Problem

DOI10.1287/OPRE.25.3.404MaRDI QIDQ4149227zbMATH OpenOpenAlexFDO

Authors

Publication date 1977

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.25.3.404

Mathematics Subject Classification ID

Integer programming (90C10)

Cited in

(7)

• Combinatorics of the change-making problem
• Optimal and canonical solutions of the change making problem
• Heuristic methods and applications: A categorized survey
• Characterization of canonical systems with six types of coins for the change-making problem
• When greedy gives optimal: a unified approach
• The change-making problem for six coin values and beyond
• A new lower bound for the linear knapsack problem with general integer variables

This page was built for publication: Error Bounds and the Applicability of the Greedy Solution to the Coin-Changing Problem

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