A polynomial-time algorithm for the change-making problem

DOI10.1016/J.ORL.2004.06.001MaRDI QIDQ1779695zbMATH OpenOpenAlexFDO

Authors Niranjan Chakravarthy

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

zbMATH Keywords

Change-makingCoin systemsGreedy algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Optimal bounds for the change-making problem
• Optimal bounds for the change-making problem
• Combinatorics of the change-making problem
• Orderly Currencies
• Change-making problems revisited: a parameterized point of view

Cites work

• Algorithmic Solution of the Change-Making Problem
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Optimal bounds for the change-making problem

Cited in

(24)

• Totally greedy coin sets and greedy obstructions
• Combinatorics of the change-making problem
• Optimal bounds for the change-making problem
• Change-making problems revisited: a parameterized point of view
• More on change-making and related problems
• 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
• COIN EXCHANGE ALGORITHMS AND TORIC PROJECTIVE CURVES
• What's in \textit{YOUR} wallet?
• Making change in 2048
• Fractal patterns related to dividing coins
• Optimal bounds for the change-making problem
• A Variation on the Money-Changing Problem
• Can our coinage system be improved?
• When greedy gives optimal: a unified approach
• Classifying primitive solvable permutation groups of rank \(5\) and \(6\)
• On the orbits of a finite solvable primitive linear group
• The change-making problem for six coin values and beyond
• On a variant of the change-making problem
• Greedy sets and greedy numerical semigroups
• Some families of greedy numerical semigroups
• A fast and simple algorithm for the money changing problem

This page was built for publication: A polynomial-time algorithm for the change-making problem

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