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 |
---|---|
格式: | text |
語言: | English |
出版: |
Institutional Knowledge at Singapore Management University
2006
|
主題: | |
在線閱讀: | https://ink.library.smu.edu.sg/lkcsb_research/562 https://doi.org/10.1016/j.ejor.2005.02.066 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Singapore Management University |
語言: | English |
相似書籍
-
Ant Colony Optimization with Hill Climbing for the Bandwidth Minimization Problem
由: LIM, Andrew, et al.
出版: (2006) -
A Fast Bandwidth Minimization Algorithm
由: LIM, Andrew, et al.
出版: (2007) -
A New Heuristic Method for the Bandwidth Minimization Problem
由: LIM, Andrew, et al.
出版: (2003) -
Heuristic approaches to solve risk-adjusted and time-adjusted discrete asset allocation problem
由: WANG JUNZHE
出版: (2012) -
An Evolutionary Approach to Bandwidth Minimization
由: LIM, Andrew, et al.
出版: (2003)