Pages that link to "Item:Q1779695"
From MaRDI portal
The following pages link to A polynomial-time algorithm for the change-making problem (Q1779695):
Displaying 17 items.
- What's in \textit{YOUR} wallet? (Q297491) (← links)
- Fractal patterns related to dividing coins (Q340462) (← links)
- A fast and simple algorithm for the money changing problem (Q995775) (← links)
- Totally greedy coin sets and greedy obstructions (Q1010817) (← links)
- Combinatorics of the change-making problem (Q1041183) (← links)
- Optimal bounds for the change-making problem (Q1314390) (← links)
- Change-making problems revisited: a parameterized point of view (Q1679517) (← links)
- More on change-making and related problems (Q2051861) (← links)
- Greedy routing in circulant networks (Q2127722) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Research and development of fringe projection-based methods in 3D shape reconstruction (Q2508235) (← links)
- Characterization of canonical systems with six types of coins for the change-making problem (Q2697436) (← 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)
- Classifying primitive solvable permutation groups of rank \(5\) and \(6\) (Q6634499) (← links)