Login / Signup
An Iterated Variable Neighborhood Descent Hyperheuristic for the Quadratic Multiple Knapsack Problem.
Takwa Tlili
Hiba Yahyaoui
Saoussen Krichen
Published in:
SNPD (revised selected papers) (2015)
Keyphrases
</>
knapsack problem
combinatorial optimization problems
optimal solution
optimization problems
dynamic programming
np hard
objective function
computational complexity
global optimization
greedy algorithm
test problems
exact algorithms
neural network
cost function
multi start
variable neighborhood descent