Pages that link to "Item:Q1115799"
From MaRDI portal
The following pages link to An improved direct descent algorithm for binary knapsack problems (Q1115799):
Displaying 6 items.
- A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs (Q829173) (← links)
- A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem (Q1894383) (← links)
- Evolution of new algorithms for the binary knapsack problem (Q2003461) (← links)
- Improved approximation algorithms for a bilevel knapsack problem (Q2354770) (← links)
- Improved Generic Algorithms for Hard Knapsacks (Q3003392) (← links)
- (Q5399855) (← links)