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

DOI10.2307/2320148MaRDI QIDQ3858337zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(12)

• Diameters of random circulant graphs
• On the Frobenius problem
• Computational complexity of the original and extended Diophantine Frobenius problem
• scientific article; zbMATH DE number 7310235 (Why is no real title available?)
• An enumeration algorithm for all integers nonrepresentable by some positive integers
• Geometric proof of Rødseth's formula for Frobenius numbers
• The diophantine problem of Frobenius: A close bound
• Frobenius Coin-Exchange Generating Functions
• On the number of solutions to linear Diophantine equation and Frobenius problem
• Two algorithms to get strong Gomory cuts
• Some Experimental Results on the Frobenius Problem
• A solution method for a knapsack problem and its variant

This page was built for publication: A Minimal-Path 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 Q3858337)