Heuristics for Matrix Bandwidth Reduction
In this work, we provide two heuristic algorithms for the matrix bandwidth reduction problem. The first is a genetic algorithm and the second uses node label adjustments. Experiments show these heuristics improve solution quality when compared with the well-known GPS algorithm and recently-developed...
Saved in:
Main Authors: | LIM, Andrew, RODRIGUES, Brian, XIAO, Fei |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2006
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/lkcsb_research/562 https://doi.org/10.1016/j.ejor.2005.02.066 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Ant Colony Optimization with Hill Climbing for the Bandwidth Minimization Problem
by: LIM, Andrew, et al.
Published: (2006) -
A Fast Bandwidth Minimization Algorithm
by: LIM, Andrew, et al.
Published: (2007) -
Heuristic approaches to solve risk-adjusted and time-adjusted discrete asset allocation problem
by: WANG JUNZHE
Published: (2012) -
A New Heuristic Method for the Bandwidth Minimization Problem
by: LIM, Andrew, et al.
Published: (2003) -
An Evolutionary Approach to Bandwidth Minimization
by: LIM, Andrew, et al.
Published: (2003)