A chaotic maximum neural network for maximum clique problem

IEICE Transactions on Information and Systems

Volumn E87-D, Issue 7, 2004, Pages 1953-1961

  Wang, Jiahai ^a   Tang, Zheng ^a   Wang, Ronglong ^b  

^a UNIVERSITY OF TOYAMA   (Japan)

^b UNIVERSITY OF FUKUI   (Japan)

Author keywords

Maximum clique problem; Maximum neural network; NP complete problem; Transient chaos

Indexed keywords

ALGORITHMS; ANNEALING; APPROXIMATION THEORY; CHAOS THEORY; COMPUTATIONAL METHODS; COMPUTER SIMULATION; DYNAMICS; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING; QUADRATIC PROGRAMMING; RANDOM PROCESSES;

MAXIMUM CLIQUE PROBLEM; MAXIMUM NEURAL NETWORK; NP-COMPLETE PROBLEM; TRANSIENT CHAOS;

NEURAL NETWORKS;

EID: 3142726978     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (40)

1. R.M. Karp, "Reducibility among combinatorial problems," in Complexity of Computer Computations, pp.85-104, Plenum, New York, 1972.
2. P. Crescenzi, C. Fiorini, and R. Silvetri, "A note on the approximation of the MAX CLIQUE problem," Inf. Process Lett., vol.40, no. 1, pp.1-5, 1991.
3. E. Balas and C.S. Yu, "Finding a maximum clique in an arbitrary graph," SIAM J. Comput., vol.15, no.4, pp.1054-1068, Nov. 1986.
4. P.M. Pardalos and J. Xue, "The maximum clique problem," J. Global Opt., vol.4, pp.301-328, 1994.
5. D.S. Johnson, "Approximation algorithms for combinatorial problem," J. Comput. Syst. Sci., vol.9, pp.256-278, 1974.
6. J.E. Lecy, O.J. Murphy, and R.G. Absher, "Graph theoretic algorithms for PLA folding problem," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol.8, no.9, pp.1014-1021, 1989.
7. E. Tomita, H. Takahashi, and S. Mitsuma, "A polynomial-time algorithm for finding a near-maximum clique and its experimental evaluation," IEICE Trans. Inf. & Syst. (Japanese Edition), vol.J74-D-I, no.4, pp.307-310, April 1991.
8. E. Tomita and T. Fujii, "Efficient algorithms for finding a maximum clique and their experimental evaluation," IEICE Trans. Inf. & Syst. (Japanese Edition), vol.J68-D, no.3, pp.221-228, March 1985.
9. R. Carraghan and P.M. Pardalos, "An exact algorithm for maximum clique problem," Oper. Res. Lett., vol.9, pp.375-382, 1990.
10. P.M. Pardalos and A.T. Phillips, "A global optimization approach for solving the maximum clique problem," Int. J. Comput. Math., vol.33, pp.209-216, 1990.
11. P.M. Pardalos and G.P. Rodgers, "A branch and bound algorithm for the maximum clique problem," Comput. Oper. Res., vol.19, no.5, pp.363-375, 1992.
12. J.J. Hopfield and D.W. Tank, "'Neural' computation of decisions in optimization problems," Biol. Cybern., vol.52, pp.142-152, 1985.
13. Y. Yamada, E. Tomita, and H. Takahashi, "A randomized algorithm for finding a near-maximum clique and its experimental evaluations," IEICE Trans. Inf. & Syst. (Japanese Edition), vol.J76-D-I, no.2, pp.46-53, Feb. 1993.
14. A. Jagota, "Approximating maximum clique with Hopfield network," IEEE Trans. Neural Netw., vol.6, no.3, pp.724-735, 1995.
15. D.S. Johnson, M.A. Trick, and D.J. Johnson, "Cliques, coloring, and satisfiability: Second dimacs implementation challenge," Dimacs Series in Discrete Mathematics and Theoretical Computer Science, vol.26, pp.11-13, 1993.
16. N. Funabiki and S. Nishikawa, "Comparisons of energy-descent optimization algorithms for maximum clique problems," IEICE Trans. Fundamentals, vol.E79-A, no.4, pp.452-460, April 1996.
17. Y. Takefuji and J. Wang, Neural computing for optimization and combinatorics, Chapter 3, World Scientific, Singapore, 1996.
18. Y. Takefuji, K. Lee, and H. Aiso, "An artificial maximum neural network: A winner-take-all neuron model forcing the state of the system in a solution domain," Biol. Cybern., vol.67, no.3, pp.243-251, 1992.
19. Y. Takenaka, N. Funabiki, and T. Higashino, "A proposal neural filter: A constraint resolution scheme of neural networks for combinatorial optimization problems," IEICE Trans. Fundamentals, vol.E83-A, no.9, pp. 1815-1823, Sept. 2000.
20. S. Oka, T. Ogawa, T. Oda, and Y. Takefuji, "A new self-organization classification algorithm for remote-sensing image," IEICE Trans. Inf. & Syst., vol.E81-D, no.1, pp.132-135, Jan. 1998.
21. R.L. Wang, Z. Tang, and Q.P. Cao, "An efficient approximation algorithm for finding a maximum clique using Hopfield network learning," Neural Comput., vol.15, no.7, pp.1605-1619, 2003.
22. H. Nozawa, "A neural network model as a globally coupled and applications based on chaos," Chaos, vol,2, no.3, pp.377-386, 1992.
23. K. Aihara, T. Takabe, and M. Toyoda, "Chaotic neural networks," Phys. Lett. A, vol.144, pp.333-340, 1990.
24. M. Inoue and A. Nagayoshi, "A chaos neuro-computer," Phys. Lett. A, vol.158, pp.373-376, 1991.
25. T. Yamada, K. Aihara, and M. Kotani, "Chaotic neural networks and the traveling salesman problem," Proc. International Joint Conference on Neural Network, vol.2, pp.1549-1552, 1993.
26. L. Chen and K. Aihara, "Chaotic simulated annealing by a neural network model with transient chaos," Neural Netw., vol.8, no.6, pp.915-930, 1995.
27. L. Wang and K. Smith, "On chaotic simulated annealing," IEEE Trans. Neural Netw., vol.9, no.4, pp.716-718, 1998.
28. L. Chen and K. Aihara, "Global searching ability of chaotic neural networks," IEEE Trans. Circuits Syst., vol.46, no.8, pp.974-993, 1999.
29. L. Chen and K. Aihara, "Chaos and asymptotical stability in discrete-time neural networks," Physica, vol.104, pp.286-325, June 1997.
30. M. Hasegawa, T. Ikeguchi, and K. Aihara, "Combination of chaotic neurodynamics with the 2-opt algorithm to solve traveling salesman problems," Phys. Rev. Lett., vol.79, no.12, pp.2344-2347, 1997.
31. M. Hasegawa, T. Ikeguchi, K. Aihara, and K. Itoh, "A novel chaotic search for quadratic assignment problems," European Journal of Operational Research, vol.139, no.3, pp.543-556, 2002.
32. F. Tian and L. Wang, "Solving optimization problems using transiently chaotic neural networks: Choices of network parameters," Proc. Second International Conference on Information, Communications & Signal Processing, Singapore, Dec. 1999.
33. P.L. Hammer, "Some network flow problems solved with pseudo-Boolean programming," Oper. Res., vol.13, pp.388-399, 1965.
34. F. Barahona, M. Junger, and G. Reinelt, "Experiments in quadratic 0-1 programming," Math. Program., vol.44, no.2, pp.127-137, 1986.
35. N. Funabiki, Y. Takenaka, and S. Nishikawa, "A maximum neural network approach for N-queens problems," Biol. Cybern., vol.76, no.4, pp.251-255, 1997.
36. T. Kwok and K.A. Smith, "Experimental analysis of chaotic neural network models for combinatorial optimization under a unifying framework," Neural Netw., vol.13, no.7, pp.731-744, 2003.
37. T. Yamada, K. Aihara, and M. Kotani, "Traveling salesman problem using angel's staircases model," Proc. IEICE International Sym posium on Nonlinear Theory and Its Applications, vol.4, pp.1173-1176, 1993.
38. M. Hasegawa, T. Ikeguchi, T. Matozaki, and K. Aihara, "An analysis on additive effects of nonlinear dynamics for combinatorial optimization," IEICE Trans. Fundamentals, vol.E80-A, no.1, pp.206-212, Jan. 1997.
39. N.J.A. Sloane, "Unsolved problem in graph theory arising from the study of codes," Graph Theory Notes of New York XVIII, 1989.
40. J.C. Lagarias and P.W. Shor, "Keller's cube-tiling conjecture is false in high dimensions," Bullettin AMS, vol.27, no.2, pp.279-283, 1992.