Fast combinatorial optimization with parallel digital computers.
This paper presents an algorithm which realizes fast search for the solutions of combinatorial optimization problems with parallel digital computers.With the standard weight matrices designed for combinatorial optimization, many iterations are required before convergence to a quasioptimal solution even when many digital processors can be used in parallel. By removing the components of the eingenvectors with eminent negative eigenvalues of the weight matrix, the proposed algorithm avoids oscillation and realizes energy reduction under synchronous discrete dynamics, which enables parallel digital computers to obtain quasi-optimal solutions with much less time than the conventional algorithm.
Kakeya
H
H
Communications Research Laboratory, Ministry of Posts and Telecommunications, Tokyo 184-8795, Japan. kake@crl.go.jp
Okabe
Y
Y