Pages that link to "Item:Q1041183"
From MaRDI portal
The following pages link to Combinatorics of the change-making problem (Q1041183):
Displaying 16 items.
- What's in \textit{YOUR} wallet? (Q297491) (← links)
- Totally greedy coin sets and greedy obstructions (Q1010817) (← links)
- Optimal bounds for the change-making problem (Q1314390) (← links)
- More on optimal denominations for coins and currency (Q1391063) (← links)
- Change-making problems revisited: a parameterized point of view (Q1679517) (← links)
- A polynomial-time algorithm for the change-making problem (Q1779695) (← links)
- Greedy routing in circulant networks (Q2127722) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Characterization of canonical systems with six types of coins for the change-making problem (Q2697436) (← links)
- Exact analysis of exact change: The \(k\)-payment problem (Q2706177) (← links)
- COIN EXCHANGE ALGORITHMS AND TORIC PROJECTIVE CURVES (Q2747124) (← links)
- Making change in 2048 (Q3301008) (← links)
- A Variation on the Money-Changing Problem (Q4908531) (← links)
- When greedy gives optimal: a unified approach (Q6122087) (← links)
- The Frobenius formula for \(A=(a,ha+d,ha+b_2 d, \ldots, ha+b_k d)\) (Q6536862) (← links)
- A combinatorial approach to Frobenius numbers of some special sequences (Q6564067) (← links)