The Change-Making Problem

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 given total The solution given here employs dynamic programming Suggestions are made which reduce the volume of computation required m handling the recurmve equatmns The method can be apphed to the one-dimensional cargoloading and stock-cutting problem, and it can be extended to the two-dimensional problem. © 1975, ACM. All rights reserved.