The Change-Making Problem
- 1 January 1975
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 22 (1) , 125-128
- https://doi.org/10.1145/321864.321874
Abstract
A cashier has a number of coins of different denominatmns at his disposal and wishes to make a selection, using the least number of corns, to meet a g~ven total The solution given here employs dynamic programming Suggestions are made which reduce the volume of computation re- quired m handling the recurmve equatmns The method can be apphed to the one-dimensional cargo- loading and stock-cutting problem, and ~t can be extended to the two-dimensional problem.Keywords
This publication has 2 references indexed in Scilit:
- Algorithmic Solution of the Change-Making ProblemJournal of the ACM, 1970
- Applied Dynamic ProgrammingPublished by Walter de Gruyter GmbH ,1962