Annealed replication: a new heuristic for the maximum clique problem.
Immanuel M. BomzeMarco BudinichMarcello PelilloClaudio RossiPublished in: Discret. Appl. Math. (2002)
Keyphrases
- benchmark instances
- optimal solution
- fault tolerant
- particle filter
- solution quality
- search algorithm
- heuristic solution
- distributed databases
- job shop scheduling problem
- fault tolerance
- sampling procedure
- neural network
- branch and bound algorithm
- feasible solution
- simulated annealing
- search strategies
- particle filtering
- markov chain
- data partitioning
- dynamic programming