An approximation lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network

JOURNAL ARTICLE

Year: 2022 Journal: Journal of the Franklin Institute Vol: 359 (12)Pages: 6080-6098 Publisher: Elsevier BV

DOI: 10.1016/j.jfranklin.2022.06.009

Keywords:

Lagrange multiplier Mathematical optimization Mathematics Clique problem Simulated annealing Lagrangian relaxation Algorithm Graph Combinatorics

Metrics

Cited By

0.78

FWCI (Field Weighted Citation Impact)

Refs

0.70

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Machine Learning and Algorithms

Physical Sciences → Computer Science → Artificial Intelligence

Complexity and Algorithms in Graphs

Physical Sciences → Computer Science → Computational Theory and Mathematics

Advanced Optimization Algorithms Research

Physical Sciences → Mathematics → Numerical Analysis