Skip to search formSkip to main contentSkip to account menu

Change-making problem

Known as: Change making problem 
The change-making problem addresses the following question: how can a given amount of money be made with the least number of coins of given… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations

Broader (1)

Combinatorial optimization
Dynamic programmingFast Fourier transformGreedy algorithmKnapsack problem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Diseño del encofrado para muros usando encofrados modulares
El concreto u hormigón es uno de los materiales más versátiles usados en la construcción.  En la actualidad, se usa… 
2018
2018
Transition Matrix
  • D. Gleich
  • Encyclopedia of Social Network Analysis and…
  • 2018
  • Corpus ID: 16488130
1 Ways to Describe a Stochastic Process We will use the biased coin example to illustrate three ways with which we can describe a… 
2015
2015
Probabilistic logic programming on the web
We present the web application ‘cplint on SWI‐Prolog for SHaring that allows the user to write (SWISH)' Probabilistic Logic… 
2015
2015
Exploring the KD45 Property of a Kripke Model After the Execution of an Action Sequence
The paper proposes a condition for preserving the KD45 property of a Kripke model when a sequence of update models is applied… 
2008
2008
Canonical Coin Systems for CHANGE-MAKING Problems
The Change-Making problem is to represent a given value with the fewest coins under a given coin system. As a variation of the… 
2004
2004
Technology mapping and packing for coarse-grained, anti-fuse based FPGAs
We present a new synthesis flow for antifuse based FPGAs with multiple-output logic cells. The flow consists of two steps… 
Highly Cited
1997
Highly Cited
1997
Statistical Inference, Distinguishability of Quantum States, And Quantum Entanglement
We argue from the point of view of statistical inference that the quantum relative entropy is a good measure for distinguishing… 
Highly Cited
1991
Highly Cited
1991
Knapsack Problems: Algorithms and Computer Implementations
(1991). Knapsack Problems: Algorithms and Computer Implementations. Journal of the Operational Research Society: Vol. 42, No. 6… 
1975
1975
The Change-Making Problem
A cashier has a number of coins of different denominatmns at his disposal and wishes to make a selection, using the least number… 
1970
1970
Algorithmic Solution of the Change-Making Problem
The change-making problem (assemble a to ta l of C cents using the least number of coins) is r epresen ta t ive of a f requent ly… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)