Pages that link to "Item:Q3556579"
From MaRDI portal
The following pages link to Computing and Selecting ε-Efficient Solutions of {0, 1}-Knapsack Problems (Q3556579):
Displaying 4 items.
- Some computational results on real 0-1 knapsack problems (Q1079123) (← links)
- Comment on 'Some computational results on real 0-1 knapsack problems' (Q1089254) (← links)
- A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem (Q1208445) (← links)
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem (Q3116647) (← links)