Annealed replication: A new heuristic for the maximum clique problem
From MaRDI portal
Recommendations
Cites work
- A global optimization approach for solving the maximum clique problem
- An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology
- An Introduction to the Application of the Theory of Probabilistic Functions of a Markov Process to Automatic Speech Recognition
- Continuous Characterizations of the Maximum Clique Problem
- Efficient probabilistically checkable proofs and applications to approximations
- Evolution towards the maximum clique
- Evolutionarily stable strategies and game dynamics
- Exact bounds on the order of the maximum clique of a graph.
- Genetic engineering via negative fitness: Evolutionary dynamics for global optimization
- Growth transformations for functions on manifolds
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 43585 (Why is no real title available?)
- scientific article; zbMATH DE number 1256635 (Why is no real title available?)
- scientific article; zbMATH DE number 1256636 (Why is no real title available?)
- scientific article; zbMATH DE number 1306875 (Why is no real title available?)
- scientific article; zbMATH DE number 1057697 (Why is no real title available?)
- scientific article; zbMATH DE number 1552036 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 903638 (Why is no real title available?)
- scientific article; zbMATH DE number 1424203 (Why is no real title available?)
- scientific article; zbMATH DE number 3390587 (Why is no real title available?)
- scientific article; zbMATH DE number 956839 (Why is no real title available?)
- scientific article; zbMATH DE number 956845 (Why is no real title available?)
- Interactive proofs and the hardness of approximating cliques
- Lotka-Volterra equation and replicator dynamics: A two-dimensional classification
- Lotka-Volterra equation and replicator dynamics: New issues in classification
- Mathematical models, problems, and controversies of evolutionary theory
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Non-cooperative two-person games in biology: A classification
- Optimization by simulated annealing
- Stability of the center-stable manifold
- The dynamics of nonlinear relaxation labeling processes.
- The stable, center-stable, center, center-unstable, unstable manifolds
Cited in
(15)- Approximating the maximum vertex/edge weighted clique using local search
- An effective local search for the maximum clique problem
- Image labeling by assignment
- Metastability in stochastic replicator dynamics
- A simple simulated annealing algorithm for the maximum clique problem
- Exact and approximate algorithms for movement problems on (special classes of) graphs
- Breakout local search for maximum clique problems
- Solving maximum independent set by asynchronous distributed hopfield-type neural networks
- An improved algorithm to test copositivity
- scientific article; zbMATH DE number 1560332 (Why is no real title available?)
- scientific article; zbMATH DE number 1424203 (Why is no real title available?)
- A general regularized continuous formulation for the maximum clique problem
- Payoff-Monotonic Game Dynamics and the Maximum Clique Problem
- Regularized standard polynomial programming formulations for the maximum clique problem
- On generalized KKT points for the Motzkin-Straus program
This page was built for publication: Annealed replication: A new heuristic for the maximum clique problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1613385)
