论文信息 - New method to the solution of maximum clique problem: mean-field approximation algorithm and its experimentation

New method to the solution of maximum clique problem: mean-field approximation algorithm and its experimentation

Our experiments show that for maximum clique problem mean-field approximation algorithm provides better results than those of simulated annealing or RaCLIQUE. For shortening computation time, we examine the characteristics of critical temperature and suggest a new way of temperature scheduling.<<ETX>>

T. Fukao | Tetsuya Harada | Jijun Wu

[1] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.

[2] David E. van den Bout,et al. Graph partitioning using annealed neural networks , 1990, International 1989 Joint Conference on Neural Networks.

[3] Tetsuya Harada,et al. Continuous modelling of discrete optimization problems , 1992 .

[4] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[5] Etsuji Tomita,et al. A randomized algorithm for finding a near-maximum clique and its experimental evaluations , 1994, Systems and Computers in Japan.