×

zbMATH — the first resource for mathematics

Optimal and canonical solutions of the change making problem. (English) Zbl 0436.90075

MSC:
90C10 Integer programming
65K05 Numerical mathematical programming methods
68Q60 Specification and verification (program logics, model checking, etc.)
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Chang, S.K.; Gill, A., Algorithmic solution of the change-making problem, J. ACM, 17, 113-122, (1970) · Zbl 0195.49303
[2] Chang, S.K.; Gill, A., Algorithm 397. an integer programming problem, Comm. ACM, 13, 620-621, (1970)
[3] Chang, L.; Korsh, J.F., Canonical coin-changing and greedy solutions, J. ACM, 23, 418-422, (1976) · Zbl 0346.90066
[4] Johnson, S.C.; Kernighan, B.W., Remarks on algorithm 397, Comm. ACM, 15, 469, (1972)
[5] Magazine, M.J.; Nemhauser, G.L.; Trotter, L.E., When the greedy solution solves a class of knapsack problems, Operations res., 23, 207-217, (1975) · Zbl 0305.90039
[6] Martello, S.; Toth, P., Solution of the bounded and unbounded change-making problem, () · Zbl 0389.90070
[7] Tien, B.N.; Hu, T.C., Error bounds and the applicability of the greedy solution to the coin-changing problem, Operations res., 25, 404-418, (1977) · Zbl 0372.90093
[8] Wright, J.W., The change-making problem, J. ACM, 22, 125-128, (1975) · Zbl 0314.90067
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.