A Minimal-Path Algorithm for the "Money Changing Problem"

DOI10.2307/2320148zbMath0424.10016OpenAlexW4231475262MaRDI QIDQ3858337

Albert Nijenhuis

Publication date: 1979

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2320148

zbMATH Keywords

Frobenius problemmoney changing problemminimal-path algorithm

Mathematics Subject Classification ID

Linear Diophantine equations (11D04) Algorithms in computer science (68W99)

Related Items

Some Experimental Results on the Frobenius Problem, The diophantine problem of Frobenius: A close bound, Unnamed Item, Diameters of random circulant graphs, Computational complexity of the original and extended diophantine Frobenius problem, An enumeration algorithm for all integers nonrepresentable by some positive integers, A solution method for a knapsack problem and its variant, Frobenius Coin-Exchange Generating Functions, Geometric proof of Rødseth's formula for Frobenius numbers, Two algorithms to get strong Gomory cuts, Unnamed Item, On the number of solutions to linear Diophantine equation and Frobenius problem