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

B. N. Tien and T. C. Hu
Additional contact information
B. N. Tien: Burroughs Corporation, San Diego, California
T. C. Hu: University of California, La Jolla, California

Operations Research, 1977, vol. 25, issue 3, 404-418

Abstract: Necessary and sufficient conditions have been given that characterize the data for which a greedy algorithm solves the coin-changing problem. In this paper we study the problem of maximum percentage error when the greedy solution does not work. We also generalize a result of Johnson and Kernighan to the case for which each coin is of different weight.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.25.3.404 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:25:y:1977:i:3:p:404-418

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().