{"type":"ScholarlyArticle","title":"A New Node Centroid Algorithm for Bandwidth Minimization","authors":[{"name":"Andrew Lim","slug":"andrew-lim","given":"Andrew","family":"Lim","affiliation":""},{"name":"Brian Rodrigues","slug":"brian-rodrigues","given":"Brian","family":"Rodrigues","affiliation":""},{"name":"Fei Xiao","slug":"fei-xiao","given":"Fei","family":"Xiao","affiliation":""}],"abstract":"We propose a Node Centroid method with HillClimbing to solve the well-known matrix bandwidth 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.","doi":null,"url":"https://ijcai.org/proceedings/2003/266","pdf":"https://ijcai.org/proceedings/2003/0266.pdf","markdown":"https://ijcai.org/proceedings/2003/266.md","bibtex":"https://ijcai.org/proceedings/2003/bibtex/266","volume":{"slug":"2003","title":"Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2003","url":"https://ijcai.org/proceedings/2003/","year":2003,"location":"Acapulco, Mexico","dates":"","editors":"Georg Gottlob","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":266,"pages":{"first":1544,"last":1544},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}