Algorithmic Solution of the Change-Making Problem

DOI10.1145/321556.321567MaRDI QIDQ5592005zbMATH OpenOpenAlexFDO

Authors

Publication date 1970

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321556.321567

zbMATH Keywords

operations research

Cited in

(11)

• On a variant of the change-making problem
• What's in \textit{YOUR} wallet?
• Optimal and canonical solutions of the change making problem
• Two backtrack algorithms for the ratio frequency intermodulation problem
• On MDS convolutional codes over \(\mathbb{Z}_{p^r}\)
• Optimal bounds for the change-making problem
• Optimal bounds for the change-making problem
• A polynomial-time algorithm for the change-making problem
• Change-making problems revisited: a parameterized point of view
• Characterization of canonical systems with six types of coins for the change-making problem
• The change-making problem for six coin values and beyond

This page was built for publication: Algorithmic Solution of the Change-Making Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5592005)