An evolutionary neural network algorithm for max cut problems

IEEE International Conference on Neural Networks - Conference Proceedings

Volumn 2, Issue , 1997, Pages 1260-1265

  Funabiki, N ^a   Kitamichi, J ^a   Nishikawa, S ^a  

^a OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY NEURAL NETWORKS; DISJOINT SUBSETS; ENERGY MINIMIZATION; EVOLUTIONARY NEURAL NETWORK; GREEDY ALGORITHMS; MEAN FIELD ANNEALING; SOLUTION QUALITY; UNDIRECTED GRAPH;

COMPUTATIONAL COMPLEXITY; EVOLUTIONARY ALGORITHMS; GRAPH THEORY; SIMULATED ANNEALING; ALGORITHMS; COMPUTER SIMULATION; PROBLEM SOLVING; SET THEORY;

NEURAL NETWORKS;

EVOLUTIONARY NEURAL NETWORK (ENN) ALGORITHM; GREEDY SEARCH ALGORITHM (GS); MEAN FIELD ANNEALING (MFA);

EID: 0030660005     PISSN: 10987576     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNN.1997.616215     Document Type: Conference Paper

References (18)

1. M. R. Garey and D. S. Johnson, Computers and intractability, Freeman, San Francisco, 1979.
2. G. I. Orlova and Y. G. Dorfman, "Finding the maximum cut a graph," Eng. Cybern., 10, 502-506, 1972.
3. S. Poljak and D. Turzik, "Max-cut circulant graphs," Discrete Math., 108, 379-392, 1992.
4. C.-P. Hsu, "Minimum-via topological routing," IEEE Trans. Computer-Aided Design, CAD-2,. 4, 235-246, Oct. 1983.
5. F. Barahona, M. Grotschel, M. Junger, and G. Reinelt, "An application of combinatorial optimization to statistical physics and circuit layout design," Oper. Res., 36, 3, 493-513, May 1988.
6. C. Delorme and S. Poljak, "Laplacian eigenvalues and the maximum cut problem," Math. Program., 62, 557-574, 1993.
7. C. Delorme and S. Poljak, "The performance of an eigenvalue bound on the max-cut problem some classes of graphs," Discrete Math., Ill, 145-156, 1993.
8. S. Poljak and F. Rendl, "Node and edge relaxations of the max-cut problem," Computing, 52, 123-137, 1994.
9. C. Peterson and J. R. Anderson, "Neural networks and NP-complete optimization problems; a performance study on the graph bisection problem," Complex Systems, 2, 59-89, 1988.
10. Y. Takefuji, Neural network parallel computing, Kluwer Academic Publishers, 1992.
11. N. Funabiki, Y. Takefuji, and K. C. Lee, "A neural network model for finding a near-maximum clique," J. Parallel Distributed Computing, 14, 340-344, March 1992.
12. N. Funabiki, Y. Takefuji, K. C. Lee, and Y. B. Cho, "A neural network parallel algorithm for clique vertex-partition problems," Int. J. Elect., 72, 3, 357-372, March 1992.
13. N. Funabiki and S. Nishikawa, "Comparisons of energy-descent optimization algorithrnsfor maximum clique problems," IEICE Trans. Fundamentals., E79-A, 452-460, 1996.
14. N. Funabiki, S. Nishikawa, and S. Tajima, "A binary neural network approach for max cut problems," Proc. ICONIP '96, 631-635, 1996.
15. K. C. Lee, Y. Takefuji, and N. Funabiki, "A maximum neural network for the max cut problem," Proc. IJCNN, I-379-1-384, 1991.
16. K. C. Lee, N. Funabiki, and Y. Takefuji, "A parallel improvement algorithm for the bipartite subgraph problem," IEEE Trans. Neural Networks, 3, 1, 139-145, 1992.
17. T, Kurokawa and H. Yamashita, "Bus connected neural network hardware system," Electronics Letters, 30, 979-980, 1994.
18. D. E. Goldberg, Genetic algorithms search, optimization & machine learning, Addison-Wesley Publishing Company, 1989.