@article{PMFA_2017_62_2_a2,
author = {Dvo\v{r}\'akov\'a, \v{L}ubom{\'\i}ra and Dohnalov\'a, Marie},
title = {Mince zaj{\'\i}maj{\'\i} nejen numismatiky},
journal = {Pokroky matematiky, fyziky a astronomie},
pages = {110--120},
year = {2017},
volume = {62},
number = {2},
language = {cs},
url = {http://geodesic.mathdoc.fr/item/PMFA_2017_62_2_a2/}
}
Dvořáková, Ľubomíra; Dohnalová, Marie. Mince zajímají nejen numismatiky. Pokroky matematiky, fyziky a astronomie, Tome 62 (2017) no. 2, pp. 110-120. http://geodesic.mathdoc.fr/item/PMFA_2017_62_2_a2/
[1] Adamaszek, M., Niewiarowska, A.: Combinatorics of the change-making problem. Eur. J. Comb. 31 (2010), 47–63. | DOI | MR
[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 | Zbl
[5] Heuberger, C., Prodinger, H.: On minimal expansions in redundant number systems: Algorithms and quantitative analysis. Computing 66 (2001), 377–393. | DOI | MR | Zbl
[6] Kleber, M., Shallit, J., Vakil, R.: What this country needs is an 18¢ piece. Math. Intell. 25 (2003), 20–23.
[7] Kozen, D., Zaks, S.: Optimal bounds for the change-making problem. Theoret. Comput. Sci. 123 (1994), 377–388. | DOI | MR | Zbl
[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 | Zbl
[10] Wright, J. W.: The change-making problem. J. Assoc. Comput. Mach. 22 (1975), 125–128. | DOI | Zbl