A Fast Bandwidth Minimization Algorithm

• المؤلفون الرئيسيون: LIM, Andrew, RODRIGUES, Brian, XIAO, Fei
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2007
• الموضوعات: Sparse matrices; bandwidth; heuristics; Operations and Supply Chain Management
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/lkcsb_research/609; https://doi.org/10.1142/S0218213007003394

We propose a simple and direct node shifting method with hill climbing for the well-known matrix bandwidth minimization problem. Many heuristics have been developed for this NP-complete problem including the Cuthill-McKee (CM) and the Gibbs, Poole and Stockmeyer (GPS) algorithms. Recently, heuristic...