A Fast Bandwidth Minimization Algorithm

A Fast Bandwidth Minimization Algorithm

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...

Full description

Saved in:
Bibliographic Details
Main Authors: LIM, Andrew, RODRIGUES, Brian, XIAO, Fei
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2007
Subjects:
Sparse matrices
bandwidth
heuristics
Operations and Supply Chain Management
Online Access:https://ink.library.smu.edu.sg/lkcsb_research/609
https://doi.org/10.1142/S0218213007003394
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English

Internet

https://ink.library.smu.edu.sg/lkcsb_research/609
https://doi.org/10.1142/S0218213007003394

Similar Items