A polynomial-time algorithm for the change-making problem (Q1779695): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2001816150 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithmic Solution of the Change-Making Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal bounds for the change-making problem / rank | |||
Normal rank | |||
Latest revision as of 12:05, 10 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time algorithm for the change-making problem |
scientific article |
Statements
A polynomial-time algorithm for the change-making problem (English)
0 references
1 June 2005
0 references
Change-making
0 references
Coin systems
0 references
Greedy algorithm
0 references
