Pages that link to "Item:Q1010817"
From MaRDI portal
The following pages link to Totally greedy coin sets and greedy obstructions (Q1010817):
Displaying 9 items.
- 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)
- A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem (Q2065777) (← 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)
- COIN EXCHANGE ALGORITHMS AND TORIC PROJECTIVE CURVES (Q2747124) (← links)
- Making change in 2048 (Q3301008) (← links)
- The Frobenius formula for \(A=(a,ha+d,ha+b_2 d, \ldots, ha+b_k d)\) (Q6536862) (← links)