R-EVO: A Reactive Evolutionary Algorithm for the Maximum Clique Problem
暂无分享,去创建一个
[1] William H. Press,et al. Numerical Recipes in C, 2nd Edition , 1992 .
[2] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[3] H. Mühlenbein,et al. From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.
[4] Donald R. Jones,et al. Efficient Global Optimization of Expensive Black-Box Functions , 1998, J. Glob. Optim..
[5] Roberto Battiti,et al. Reactive Local Search for the Maximum Clique Problem1 , 2001, Algorithmica.
[6] Elena Marchiori. A simple heuristic based genetic algorithm for the maximum clique problem , 1998, SAC '98.
[7] Anders Krogh,et al. Introduction to the theory of neural computation , 1994, The advanced book program.
[8] Mauro Birattari,et al. Model-based Search for Combinatorial Optimization , 2001 .
[9] Rich Caruana,et al. Removing the Genetics from the Standard Genetic Algorithm , 1995, ICML.
[10] David E. Goldberg,et al. A Survey of Optimization by Building and Using Probabilistic Models , 2002, Comput. Optim. Appl..
[11] Heinz Mühlenbein,et al. The Equation for Response to Selection and Its Use for Prediction , 1997, Evolutionary Computation.
[12] Qingfu Zhang,et al. An evolutionary algorithm with guided mutation for the maximum clique problem , 2005, IEEE Transactions on Evolutionary Computation.
[13] Wilbert E. Wilhelm,et al. Clique-detection models in computational biochemistry and genomics , 2006, Eur. J. Oper. Res..
[14] Johan Håstad,et al. Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[15] Martin Pelikan,et al. Bayesian Optimization Algorithm , 2005 .
[16] J. Håstad. Clique is hard to approximate within n 1-C , 1996 .
[17] Maurice Clerc,et al. The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..
[18] Fred W. Glover,et al. Tabu Search - Part I , 1989, INFORMS J. Comput..
[19] F. Glover. Scatter search and star-paths: beyond the genetic metaphor , 1995 .
[20] Elena Marchiori,et al. Genetic, Iterated and Multistart Local Search for the Maximum Clique Problem , 2002, EvoWorkshops.
[21] G. Stormo,et al. A graph theoretical approach for predicting common RNA secondary structure motifs including pseudoknots in unaligned sequences. , 2004, Bioinformatics.
[22] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .
[23] Paul A. Viola,et al. MIMIC: Finding Optima by Estimating Probability Densities , 1996, NIPS.
[24] Johan Håstad,et al. Clique is hard to approximate within n1-epsilon , 1996, Electron. Colloquium Comput. Complex..
[25] Mauro Birattari,et al. Model-Based Search for Combinatorial Optimization: A Critical Survey , 2004, Ann. Oper. Res..
[26] J. A. Lozano,et al. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .
[27] Roberto Battiti,et al. Reactive local search for maximum clique: A new implementation , 2007 .
[28] Pablo Moscato,et al. A Gentle Introduction to Memetic Algorithms , 2003, Handbook of Metaheuristics.
[29] Pablo Moscato,et al. On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .
[30] Xing Xu,et al. A graph theoretical approach for predicting common RNA secondary structure motifs including pseudoknots in unaligned sequences , 2004, Bioinform..
[31] Panos M. Pardalos,et al. The maximum clique problem , 1994, J. Glob. Optim..
[32] J. Jeffry Howbert,et al. The Maximum Clique Problem , 2007 .
[33] Fernando G. Lobo,et al. A Survey of Optimization by Building and Using Probabilistic Models , 2000, Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334).
[34] Shumeet Baluja,et al. A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .
[35] Roberto Battiti,et al. The Reactive Tabu Search , 1994, INFORMS J. Comput..
[36] D. Goldberg,et al. BOA: the Bayesian optimization algorithm , 1999 .
[37] Roberto Battiti,et al. Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning , 1999, IEEE Trans. Computers.
[38] William H. Press,et al. Numerical recipes in C , 2002 .
[39] Mauro Brunato,et al. Reactive Search and Intelligent Optimization , 2008 .
[40] Wayne J. Pullan,et al. Dynamic Local Search for the Maximum Clique Problem , 2011, J. Artif. Intell. Res..