A Feasible Method for Solving an SDP Relaxation of the Quadratic Knapsack Problem.

Tianyun Tang Kim-Chuan Toh

Published in: Math. Oper. Res. (2024)

Keyphrases

clustering method
similarity measure
objective function
computational complexity
significant improvement
high accuracy
pairwise
dynamic programming
computational cost
combinatorial optimization
data sets
neural network
kernel function
distance function
feasible solution
quadratic programming