A polynomial-time algorithm for the change-making problem
From MaRDI portal
Publication:1779695
DOI10.1016/j.orl.2004.06.001zbMath1177.90350MaRDI QIDQ1779695
Publication date: 1 June 2005
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/6219
90C60: Abstract computational complexity for mathematical programming problems
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
What's in \textit{YOUR} wallet?, Fractal patterns related to dividing coins, Combinatorics of the change-making problem, Change-making problems revisited: a parameterized point of view, Greedy routing in circulant networks, Knapsack problems -- an overview of recent advances. I: Single knapsack problems, Research and development of fringe projection-based methods in 3D shape reconstruction, Characterization of canonical systems with six types of coins for the change-making problem, Unnamed Item
Cites Work