Sign in
An approximation lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network.
Jinyu Dai
Zhengtian Wu
Hamid Reza Karimi
Baoping Jiang
Guangquan Lu
Published in:
J. Frankl. Inst. (2022)
Keyphrases
</>
neural network
k means
cost function
learning algorithm
dynamic programming
closed form
deterministic annealing
optimal solution
free energy
worst case
expectation maximization
energy function
objective function
linear programming
particle swarm optimization
approximation algorithms