An approximation lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network
Published 2022 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
An approximation lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network
Authors
Keywords
-
Journal
JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS
Volume 359, Issue 12, Pages 6080-6098
Publisher
Elsevier BV
Online
2022-06-14
DOI
10.1016/j.jfranklin.2022.06.009
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- An opposition-based memetic algorithm for the maximum quasi-clique problem
- (2020) Qing Zhou et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Brain EEG Time-Series Clustering Using Maximum-Weight Clique
- (2020) Chenglong Dai et al. IEEE Transactions on Cybernetics
- An approximation algorithm for graph partitioning via deterministic annealing neural network
- (2019) Zhengtian Wu et al. NEURAL NETWORKS
- A Deterministic Annealing Neural Network Algorithm for the Minimum Concave Cost Transportation Problem
- (2019) Zhengtian Wu et al. IEEE Transactions on Neural Networks and Learning Systems
- Using Statistical Measures and Machine Learning for Graph Reduction to Solve Maximum Weight Clique Problems
- (2019) Yuan Sun et al. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
- NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover
- (2018) S. Cai et al. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH
- Towards faster local search for minimum weight vertex cover on massive graphs
- (2018) Shaowei Cai et al. INFORMATION SCIENCES
- A parameter selection method of the deterministic anti-annealing algorithm for network exploring
- (2017) Bianfang Chai et al. NEUROCOMPUTING
- Improved initial vertex ordering for exact maximum clique search
- (2016) Pablo San Segundo et al. APPLIED INTELLIGENCE
- A review on algorithms for maximum clique problems
- (2015) Qinghua Wu et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Parallel Maximum Clique Algorithms with Applications to Network Analysis
- (2015) Ryan A. Rossi et al. SIAM JOURNAL ON SCIENTIFIC COMPUTING
- A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational Experiments
- (2013) Etsuji TOMITA et al. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
- Multi-neighborhood tabu search for the maximum weight clique problem
- (2012) Qinghua Wu et al. ANNALS OF OPERATIONS RESEARCH
- Breakout Local Search for maximum clique problems
- (2012) Una Benlic et al. COMPUTERS & OPERATIONS RESEARCH
- WSVR-based fuzzy neural network with annealing robust algorithm for system identification
- (2012) Chia-Nan Ko JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS
- An adaptive multistart tabu search approach to solve the maximum clique problem
- (2011) Qinghua Wu et al. JOURNAL OF COMBINATORIAL OPTIMIZATION
- An improved bit parallel exact maximum clique algorithm
- (2011) Pablo San Segundo et al. Optimization Letters
- An exact bit-parallel algorithm for the maximum clique problem
- (2010) Pablo San Segundo et al. COMPUTERS & OPERATIONS RESEARCH
- Cooperating local search for the maximum clique problem
- (2010) Wayne Pullan et al. JOURNAL OF HEURISTICS
- A deterministic annealing algorithm for approximating a solution of the min-bisection problem
- (2008) Chuangyin Dang et al. NEURAL NETWORKS
Publish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn MoreCreate your own webinar
Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.
Create Now