Critical phenomena in a collective computation algorithm for combinatorial optimization problems

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.