Conference Proceeding Article
We propose a Node Centroid method with Hill-Climbing to solve the well-known matrix band-width minimization problem, which is to permute rows and columns of the matrix to minimize its bandwidth. Many heuristics have been developed for this NP-complete problem including the Cuthill-McKee (CM) and the Gibbs, Poole and Stockmeyer (GPS) algorithms. Recently, heuristics such as Simulated Annealing, Tabu Search and GRASP have been used, where Tabu Search and the GRASP with Path Relinking have achieved significantly better solution quality than the CM and GPS algorithms. Experimentation shows that the Node Centroid method achieves the best solution quality when compared with these while being much faster than the newly-developed algorithms
Operations and Supply Chain Management
18th International Joint Conference on Artificial Intelligence, ( IJCAI 2003, Acapulco, Mexico)
Rodrigues, Brian; Xiao, F.; and Lim, A..
A New Node Centroid Algorithm for Bandwidth Minimization. (2003). 18th International Joint Conference on Artificial Intelligence, ( IJCAI 2003, Acapulco, Mexico). 1544-1545. Research Collection Lee Kong Chian School Of Business.
Available at: http://ink.library.smu.edu.sg/lkcsb_research/2066