Graph Partitioning Using Annealed Neural Networks

IEEE Transactions on Neural Networks

Volumn 1, Issue 2, 1990, Pages 192-203

  Van Den Bout, David E ^a   Miller, Thomas K ^a  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES--GRAPH THEORY; OPTIMIZATION; SYSTEMS SCIENCE AND CYBERNETICS--NEURAL NETS;

ANNEALED NEURAL NETWORKS; GRAPH PARTITIONING; MEAN FIELD ANNEALING;

COMPUTER PROGRAMMING;

EID: 0025446460     PISSN: 10459227     EISSN: 19410093     Source Type: Journal    
DOI: 10.1109/72.80231     Document Type: Article

References (25)

1. C. Fiduccia and R. Mattheyses, “A linear-time heuristic for improving network partitions,” in Proc. 19th Design Automation Conf., 1982, pp. 175-181.
2. E. L. Lawler and D. E. Wood, “Branch-and-bound methods: A survey,” Oper. Res., vol. 14, no. 4, pp. 679-719, 1966.
3. M. L. Fisher, “The Lagrangian relaxation method for solving integer programming problems,” Manag. Sci., vol. 27, no. 1, pp. 1-18, 1981.
4. S. Kirkpatrick, C. Gelatt, and M. Vecchi, “Optimization by simulated annealing,” Science, vol. 220‘4598’, pp. 671-680, May 13, 1983.
5. J. J. Hopfield, “Neural networks and physical systems with emergent collective computational abilities,” Proc. Nat. Acad. Sci. U.S., vol. 79, pp. 2554-2558, 1982.
6. J. J. Hopfield, “Neurons with graded response have collective computational properties like those of two-state neurons,” Proc. Nat. Acad. Sci. U.S., vol. 81, pp. 3088-3092, 1984.
7. J. Hopfield and D. Tank, “Neural computations of decisions in optimization problems,” Biolog. Cybern., vol. 52, pp. 141-152, 1985.
8. J. Hopfield and D. Tank, “Simple ‘neural’ optimization networks: An a/d converter, signal decision circuit, and a linear programming circuit,” IEEE Trans. Circuits Syst., vol. 33, no. 5, pp. 533-541, May 1986.
9. J. Hopfield and D. Tank, “Computing with neural circuits: A model,” Science, vol. 233, pp. 625-633, Aug. 8, 1986.
10. D. E. Van den Bout and T. K. Miller, III, “A traveling salesman objective function that works,” in Proc. IEEE Int. Conf. Neural Networks, 1988, pp. 11:299-11:303.
11. G. Bilbro, R. Mann, T. Miller, III, W. Snyder, D. E. Van den Bout, and M. White, “Mean field annealing and neural networks,” in Advances in Neural Information Processing Systems. Morgan-Kaufmann, 1989, pp. 91-98.
12. J. R. Anderson and C. Peterson, “Applicability of mean field theory neural network methods to the graph partitioning problem,” Microelectronics and Computer Technology Corp., Tech. Rep. ACA-ST-064-88, 1988.
13. D. J. Thouless, P. W. Anderson, and R. G. Palmer, “Solution of ‘solvable model of a spin glass’,” Phil. Mag., vol. 35, no. 3, pp. 593-601, 1977.
14. E. Bonomi and J. Lutton, “The N-city traveling salesman problem: Statistical mechanics and the metropolis algorithm,” SIAM Rev., vol. 26, no. 4, pp. 551-568, Oct. 1984.
15. C. Peterson and J. R. Anderson, “A mean field theory learning algorithm for neural networks,” Complex Syst., vol. 1, no. 5, pp. 995-1019, 1987.
16. B. Kernighan and S. Lin, “An efficient heuristic procedure for partitioning graphs,” Bell Syst. Tech. J., vol. 49, pp. 291-307, Feb. 1970.
17. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
18. D. E. Van den Bout and T. K. Miller, III, “Graph partitioning using annealed neural networks,” in Proc. IEEE Int. Conf. Neural Networks, 1989, pp. I:521-I:528.
19. C. Peterson and J. R. Anderson, “Neural networks and NP-complete optimization problems: A performance study on the graph bisection problem,” Microelectronics and Computer Technology Corp., Tech. Rep. MCC-EI-287-87, 1987.
20. D. E. Van den Bout and T. K. Miller, III, “A digital architecture employing stochasticism for the simulation of Hopfield neural nets,” IEEE Trans. Circuits Syst., vol. 36, no. 5, pp. 732-738, May 1989.
21. B. Kamgar-Parsi and B. Kamgar-Parsi, “An efficient model of neural networks for optimization,” in IEEE 1st Int. Conf. Neural Networks, vol. Ill, 1987, pp. 785-790.
22. D. E. Van den Bout and T. K. Miller, III, “Improving the performance of the Hopfield-Tank neural network through normalization and annealing,” Biolog. Cybern., vol. 62, pp. 129-139, 1989.
23. C. Peterson and B. Soderberg, “A new method for mapping optimization problems onto neural networks,” Int. J. Neural Syst., vol. 1, no. 3, 1989.
24. D. Johnson, C. Aragon, L. McGeoch, and C. Schevon, “Optimization by simulated annealing: An experimental evaluation, Part I ‘Graph partitioning’,” Oper. Res., to be published.
25. Y. Fu, “Application of statistical mechanics to NP-complete problems in combinatorial optimization,” J. Physics A, vol. 19, pp. 1605-1620, 1986.