Heuristics for matrix bandwidth reduction

European Journal of Operational Research

Volumn 174, Issue 1, 2006, Pages 69-91

  Lim, Andrew ^a   Rodrigues, Brian ^b   Xiao, Fei ^c  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Genetic algorithm; Hill climbing; Matrix bandwidth; Node adjustments

Indexed keywords

DATA REDUCTION; GENETIC ALGORITHMS; GLOBAL POSITIONING SYSTEM; HEURISTIC METHODS; NUMERICAL METHODS;

HILL CLIMBING; MATRIX BANDWIDTH REDUCTION PROBLEMS; NODE ADJUSTMENTS; PATH RELINKING;

BANDWIDTH;

EID: 33845256652     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.02.066     Document Type: Article

References (17)

1. Arany I., Smyth W.F., and Szoda L. An improved method for reducing the band-width of sparse symmetric matrices. Proceedings IFIP Conference (1971), North-Holland, Amsterdam 1246-1250
2. Berry M., Hendrickson B., and Raghavan P. Sparse matrix reordering schemes for browsing hypertext. In: Smale S., Renegar J., and Shub M. (Eds). Lectures in Applied Mathematics. 32: The Mathematics of Numerical Analysis (1996), AMS, Providence, RI 99-123
3. Chinn P., Chvatalova J., Dewdney A.K., and Gibbs N.E. The bandwidth problem for graphs and matrices-a survey. Journal of Graph Theory 6 (1982) 223-254
4. Cuthill E., and McKee J. Reducing the bandwidth of sparse symmetric matrices. Proceedings of the ACM National Conference (1969), Association for Computing Machinery, New York 157-172
5. Deuck G.H., and Jeffs J. A heuristic bandwidth minimization algorithm. Journal of Combinatorial Mathematics and Combinatorial Computing 18 (1995) 97-108
6. Esposito A., Catalano M.S., Malucelli F., and Tarricone L. Sparse matrix band-width reduction: Algorithms, applications and real industrial cases in electromagnetics, high performance algorithms for structured matrix problems. Advances in the theory of Computation and Computational Mathematics 2 (1998) 27-45
7. Feo T., and Resende M.G.C. Greedy randomized adaptive search procedures. Journal of Global Optimization 2 (1995) 1-27
8. Garey M., Graham R., Johnson D., and Knuth D. Complexity results for band-width minimization. SIAM Journal of Applied Mathematics 34 (1978) 477-495
9. Gibbs N.E., Poole W.G., and Stockmeyer P.K. An algorithm for reducing the bandwidth and profile of sparse matrix. SIAM Journal on Numerical Analysis 13 2 (1976) 236-250
10. Gibbs N.E., Poole W.G., and Stockmeyer P.K. A comparison of several bandwidth and profile recognition algorithms. ACM Transactions on Mathematical Software 2 4 (1976) 322-330
11. J. George, Computer implementation of the finite element method, Technical Report, STAT-CS-71-208, Computer Science Department, Stanford University, California, 1971.
12. George A., and Liu J. Computer Solution of Large Sparse Positive definite Systems (1981), Prentice-Hall, NJ
13. J. Torres-Jimenez, E. Rodriguez-Tello, A New Measure for the Bandwidth Minimization Problem, International Joint Conference, 7th Ibero-American Conference on AI, 15th Brazilian Symposium on AI, IBERAMIA-SBIA 2000, Atibaia, Brazil, 2000.
14. Luo J.C. Algorithms for reducing the bandwidth and profile of a sparse matrix. Computers and Structures 44 (1992) 535-548
15. Marti R., Laguna M., Glover F., and Campos V. Reducing the bandwidth of a sparse matrix with tabu search. European Journal of Operational Research 135 2 (2001) 211-220
16. Papadimitriou C.H. The NP-completeness of the bandwidth minimization problem. Computing 16 (1976) 263-270
17. Pinana E., Plana I., Campos V., and Marti R. GRASP and path relinking for the matrix bandwidth minimization. European Journal of Operational Research 153 1,16 (2004) 200-210