[2] Balková, Ľ., Šťastná, A.: Jsou české mince optimální?. Rozhledy matematicko-fyzikální 90 (2015), 14–22.
[3] Cai, X.: Canonical coin systems for change-making problems. International Conference on Hybrid Intelligent Systems 1 (2009), 499–504.
[4] Heuberger, C.:
Minimal expansions in redundant number systems: Fibonacci bases and greedy algorithms. Period. Math. Hung. 49 (2004), 65–89.
MR 2106466 |
Zbl 1072.11007
[6] Kleber, M., Shallit, J., Vakil, R.: What this country needs is an 18¢ piece. Math. Intell. 25 (2003), 20–23.
[8] Lueker, G. S.: Two NP-complete problems in nonnegative integer programming. Technical Report TR-178, Computer Science Laboratory, Department of Electrical Engineering, Princeton University, March 1975.
[9] Pearson, D.:
A polynomial-time algorithm for the change-making problem. Oper. Res. Lett. 33 (2005), 231–234.
MR 2108270 |
Zbl 1177.90350