Pages that link to "Item:Q3354469"
From MaRDI portal
The following pages link to The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem (Q3354469):
Displaying 4 items.
- Largest-first sequential selection with a sum constraint (Q753676) (← links)
- Stochastic analysis of greedy algorithms for the subset sum problem (Q1806779) (← links)
- Average-case performance of rollout algorithms for knapsack problems (Q2349849) (← links)
- On the Optimality of the Backward Greedy Algorithm for the Subset Selection Problem (Q4943659) (← links)