An adaptive multistart tabu search approach to solve the maximum clique problem
- 9 December 2011
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 26 (1) , 86-108
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Reactive and dynamic local search for max-clique: Engineering effective building blocksComputers & Operations Research, 2010
- A new trust region technique for the maximum weight clique problemDiscrete Applied Mathematics, 2006
- A Novel Evolutionary Formulation of the Maximum Independent Set ProblemJournal of Combinatorial Optimization, 2004
- A Heuristic for the Maximum Independent Set Problem Based on Optimization of a Quadratic Over a SphereJournal of Combinatorial Optimization, 2002
- Reactive Local Search for the Maximum Clique Problem1Algorithmica, 2001
- Hybrid Evolutionary Algorithms for Graph ColoringJournal of Combinatorial Optimization, 1999
- Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability1996
- An exact algorithm for the maximum clique problemOperations Research Letters, 1990
- STABULUS: A technique for finding stable sets in large graphs with tabu searchComputing, 1989
- Finding a Maximum Clique in an Arbitrary GraphSIAM Journal on Computing, 1986