Combinatorics of the change-making problem (Q1041183): Difference between revisions

@@ Property / author @@
-Michał Adamaszek
@@ Property / author: Michał Adamaszek / rank @@
-Normal rank
@@ Property / author @@
+Michał Adamaszek
@@ Property / author: Michał Adamaszek / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2079740697
@@ Property / OpenAlex ID: W2079740697 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q56608115
@@ Property / Wikidata QID: Q56608115 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.0120
@@ Property / arXiv ID: 0801.0120 / rank @@
+Normal rank
@@ Property / cites work @@
+Totally greedy coin sets and greedy obstructions
@@ Property / cites work: Totally greedy coin sets and greedy obstructions / rank @@
+Normal rank
@@ Property / cites work @@
+Technical Note—Optimality of a Heuristic Solution for a Class of Knapsack Problems
+Normal rank
@@ Property / cites work @@
+Orderly Currencies
@@ Property / cites work: Orderly Currencies / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal bounds for the change-making problem
@@ Property / cites work: Optimal bounds for the change-making problem / rank @@
+Normal rank
@@ Property / cites work @@
+When the Greedy Solution Solves a Class of Knapsack Problems
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for the change-making problem
+Normal rank
@@ Property / cites work @@
+Error Bounds and the Applicability of the Greedy Solution to the Coin-Changing Problem
+Normal rank