Title:
Choosing-Coins-To-Match-a-Given-Value
Download
- Category:
- matlab
- Tags:
-
[Text]
- File Size:
- 1kb
- Update:
- 2016-05-27
- Downloads:
- 0 Times
- Uploaded by:
- Yu Deyang
Description: The change making problem is given a target value C and a set of N coin denominations with value W. The task is to determine the minimum number of coins needed to form the given value.
In the unbounded change making problem, there are a limitless supply of coins of each denomination. In the bounded change making problem, each denomination is available only up to some given limit.
For some sets of denominations, there will be target values that cannot be formed. (This relates to Frobenius s problem.)
To Search:
File list (Check if you may need any files):
Choosing Coins To Match a Given Value.txt
