| Article ID: | iaor20003005 |
| Country: | United Kingdom |
| Volume: | 37 |
| Issue: | 11/12 |
| Start Page Number: | 213 |
| End Page Number: | 223 |
| Publication Date: | Jun 1999 |
| Journal: | Computers & Mathematics with Applications |
| Authors: | Fukao T., Wu J., Ikeda K. |
| Keywords: | artificial intelligence, programming: travelling salesman |
This paper discusses the critical temperature (control parameter) of an annealed neural network, a typical collective computation for combinatorial optimization problems. It is shown that the theoretical critical temperatures determined by our estimation agree with those derived by computational experiments in graph partitioning problems and in the travelling salesman problem.