Reactive and dynamic local search for max-clique: Engineering effective building blocks

Computers and Operations Research

Volumn 37, Issue 3, 2010, Pages 534-542

  Battiti, Roberto ^a   Mascia, Franco ^a  

^a UNIVERSITY OF TRENTO   (Italy)

Author keywords

Algorithm engineering; Dynamic local search; Hybrid metaheuristics; Reactive local search; Stochastic local search

Indexed keywords

ALGORITHM ENGINEERING; BUILDING BLOCKES; COMPLEX SCHEMES; CPU TIME; HYBRID METAHEURISTICS; LOCAL SEARCH; LONG TERM MEMORY; MAXIMUM CLIQUE PROBLEMS; ON DYNAMICS; REACTIVE LOCAL SEARCH; RLS ALGORITHMS; STATISTICAL PROPERTIES; STOCHASTIC LOCAL SEARCH;

ALGORITHMS;

EID: 70349290825     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.02.013     Document Type: Article

References (15)

1. Barabasi A.L., and Albert R. Emergence of scaling in random networks. Science 286 (1999) 509-512
2. Batagelj V., and Brandes U. Efficient generation of large random networks. Physical Review E 71 3 (2005) 036113
3. Battiti R, Protasi M. Reactive local search for the maximum clique problem. Technical Report TR-95-052, ICSI, 1947 Center St. - Suite 600 - Berkeley, California, September 1995.
4. Battiti R., and Tecchiolli G. The reactive tabu search. ORSA Journal on Computing 6 2 (1994) 126-140
5. Battiti R., and Bertossi A.A. Greedy, prohibition, and reactive heuristics for graph partitioning. IEEE Transactions on Computers 48 4 (1999) 361-385
6. Battiti R., and Protasi M. Reactive local search for the maximum clique problem. Algorithmica 29 4 (2001) 610-637
7. Brockington M., and Culberson J.C. Camouflaging independent sets in quasi-random graphs. In: Johnson D.S., and Trick M.A. (Eds). Cliques, coloring, and satisfiability: second DIMACS implementation challenge vol. 26 (1996), American Mathematical Society 75-88
8. Butenko S., and Wilhelm W. Clique-detection models in computational biochemistry and genomics. Journal of Operational Research 173 (2006) 1-17
9. 1 - ε{lunate}. In: Proceedings of 37th annual IEEE symposium on foundations of computer science, IEEE Computer Society; 1996. p. 627-36.
10. Hagberg A, Schult D, Swart P. NetworkX library developed at the Los Alamos National Laboratory Labs Library (DOE) by the University of California, 2004. Code available at:〈https://networkx.lanl.gov/〉.
11. Ji Y., Xu X., and Stormo G.D. A graph theoretical approach to predict common RNA secondary structure motifs including pseudoknots in unaligned sequences. Bioinformatics 20 10 (2004) 1591-1602
12. Matula D.W. The largest clique size in a random graph (1976), Southern Methodist University
13. Pardalos P.M., and Xue J. The maximum clique problem. Journal of Global Optimization 4 (1994) 301-328
14. Pullan W., and Hoos H.H. Dynamic local search for the maximum clique problem. Journal of Artificial Intelligence Research 25 (2006) 159-185
15. Battiti R, Brunato M, Mascia F. Reactive search and intelligent optimization operations research/computer science interfaces series, vol. 45. Springer, November 2008.