A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs.

Isma Dahmani Mhand Hifi

Published in: Ann. Oper. Res. (2021)

Keyphrases

knapsack problem
dynamic programming
clustering method
neural network
objective function
heuristic methods
cost function
support vector machine
mathematical model
combinatorial optimization
graph representation
genetic algorithm
computational complexity
optimization algorithm
linear programming relaxation