Pages that link to "Item:Q1679517"
From MaRDI portal
The following pages link to Change-making problems revisited: a parameterized point of view (Q1679517):
Displaying 8 items.
- Totally greedy coin sets and greedy obstructions (Q1010817) (← links)
- A polynomial-time algorithm for the change-making problem (Q1779695) (← links)
- More on change-making and related problems (Q2051861) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Knapsack problems: a parameterized point of view (Q2419116) (← 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)
- When greedy gives optimal: a unified approach (Q6122087) (← links)