A Parallel Simulated Annealing Algorithm in PC-Cluster Environments
Yue ZHAO, Fei Qian, Jijun Wu, 秀樹 青井, Aiguo He · IEEJ Transactions on Electronics Information and Systems · 2000
Parallel Simulated Annealing (PSA) is an effective method for some commbinatorial optimization problems. In this letter, We apply PSA to the graph partitioning problem and the maximum clique problem in a PC-cluster environment, and show the results of our simulations.