The NP-completeness column: an ongoing guide
Journal of Algorithms
Relaxation labeling networks for the maximum clique problem
Journal of Artificial Neural Networks - Special issue: neural networks for optimization
Feasible and infeasible maxima in a quadratic program for maximum clique
Journal of Artificial Neural Networks - Special issue: neural networks for optimization
Continuous characterizations of the maximum clique problem
Mathematics of Operations Research
Matching Hierarchical Structures Using Association Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Evolution towards the Maximum Clique
Journal of Global Optimization
Global Escape Strategies for Maximizing QuadraticForms over a Simplex
Journal of Global Optimization
Optimization Using Replicators
Proceedings of the 6th International Conference on Genetic Algorithms
Parallelizable Evolutionary Dynamics Principles for Solving the Maximum Clique Problem
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Replicator Equations, Maximal Cliques, and Graph Isomorphism
Neural Computation
Approximating the maximum weight clique using replicator dynamics
IEEE Transactions on Neural Networks
Hi-index | 0.00 |
Replicator equations are a class of dynamical systems developed and studied in the context of evolutionary game theory, a discipline pioneered by J. Maynard Smith which aims to model the evolution of animal behavior using the principles and tools of noncooperative game theory. Because of their dynamical properties, they have been recently applied with significant success to a number of combinatorial optimization problems. It is the purpose of this article to provide a summary and an up-to-date bibliography of these applications.