Parallel and synchronous search for combinatory quasi-optimum solutions

Presents an algorithm which realizes fast search for the solutions of combinatorial optimization problems with digital and parallel processors. By modifying the weight matrix, the proposed model avoids oscillation and realizes energy reduction under the synchronous discrete dynamics. As a result, the proposed model realizes quasi-optimum solutions with much fewer iterations than the existing models.