Pages that link to "Item:Q502417"
From MaRDI portal
The following pages link to An effective GRASP and tabu search for the 0-1 quadratic knapsack problem (Q502417):
Displaying 13 items.
- Asymptotic behavior of the quadratic knapsack problem (Q323537) (← links)
- Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem (Q342188) (← links)
- Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case (Q1595283) (← links)
- Dual mean field search for large scale linear and quadratic knapsack problems (Q1620646) (← links)
- An iterated ``hyperplane exploration'' approach for the quadratic knapsack problem (Q1652040) (← links)
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem (Q1652289) (← links)
- A matheuristic for the 0--1 generalized quadratic multiple knapsack problem (Q2070116) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Dual mean field annealing scheme for binary optimization under linear constraints (Q2183203) (← links)
- Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm (Q2345653) (← links)
- 0-1 quadratic knapsack problem solved with VNS algorithm (Q2631284) (← links)
- (Q4244993) (← links)
- Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits (Q6659822) (← links)
