A fast and simple algorithm for the money changing problem

DOI10.1007/S00453-007-0162-8MaRDI QIDQ995775zbMATH OpenOpenAlexFDO

Authors Sebastian Böcker, Zsuzsanna Lipták

Publication date 10 September 2007

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-007-0162-8

Mathematics Subject Classification ID

Linear Diophantine equations (11D04) Computer solution of Diophantine equations (11Y50) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Recommendations

• Computing and Combinatorics
• Faster algorithms for Frobenius numbers
• More on change-making and related problems
• Frobenius numbers by lattice point enumeration
• A polynomial-time algorithm for the change-making problem

Cited in

(16)

• Hulls of cyclic and negacyclic codes over finite fields
• The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases
• scientific article; zbMATH DE number 7233012 (Why is no real title available?)
• On the Sound Covering Cycle Problem in Paired de Bruijn Graphs
• Counting glycans revisited
• A Variation on the Money-Changing Problem
• The Frobenius problem for extended Thabit numerical semigroups
• Enumerating possible molecular formulae in mass spectrometry using a generating function based method
• scientific article; zbMATH DE number 7310235 (Why is no real title available?)
• scientific article; zbMATH DE number 7310252 (Why is no real title available?)
• Determination of Glycan Structure from Tandem Mass Spectra
• Inferring Peptide Composition from Molecular Formulas
• Computing and Combinatorics
• On the hulls of cyclic codes of oddly even length over \(\mathbb{Z}_4\)
• On -modular integer linear problems in the canonical form and equivalent problems
• On approximate jumbled pattern matching in strings

This page was built for publication: A fast and simple algorithm for the money changing problem

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