Breakout Local Search for maximum clique problems
Authors:
- 1 January 2013
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 40 (1) , 192-206
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- An adaptive multistart tabu search approach to solve the maximum clique problemJournal of Combinatorial Optimization, 2011
- Iterated local search for the quadratic assignment problemEuropean Journal of Operational Research, 2006
- An effective local search for the maximum clique problemInformation Processing Letters, 2005
- An Evolutionary Algorithm With Guided Mutation for the Maximum Clique ProblemIEEE Transactions on Evolutionary Computation, 2005
- Variable neighborhood search for the maximum cliqueDiscrete Applied Mathematics, 2004
- Annealed replication: a new heuristic for the maximum clique problemDiscrete Applied Mathematics, 2002
- A fast algorithm for the maximum clique problemDiscrete Applied Mathematics, 2002
- Reactive Local Search for the Maximum Clique Problem1Algorithmica, 2001
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computationsEuropean Journal of Operational Research, 2000
- Fitness Landscapes, Memetic Algorithms, and Greedy Operators for Graph BipartitioningEvolutionary Computation, 2000