Combinatorics of the change-making problem (Q1041183): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Totally greedy coin sets and greedy obstructions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Technical Note—Optimality of a Heuristic Solution for a Class of Knapsack Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Orderly Currencies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal bounds for the change-making problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: When the Greedy Solution Solves a Class of Knapsack Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A polynomial-time algorithm for the change-making problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Error Bounds and the Applicability of the Greedy Solution to the Coin-Changing Problem / rank | |||
Normal rank |
Latest revision as of 06:25, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Combinatorics of the change-making problem |
scientific article |
Statements
Combinatorics of the change-making problem (English)
0 references
1 December 2009
0 references