References
- 1. P. Arbenz, A. Cleary, J. Dongarra, and Heglan. M., Parallel numerical linear algebra.chapter A comparison of parallel solvers for diagonally dominant and general narrowbanded linear systems, Nova Science Publishers, Inc., Commack, NY, USA, 2001
- 2. A. Caprara and J. Salazar-Gonzalez, Laying out sparse graphs with provably minimum bandwidth, INFORMS J. on Computing, 17/3, (2005), 356-373.
- 3. E. Cuthill and J. McKee, Reducing the bandwidth of sparse symmetric matrices, Proc. of ACM, (1969), 157-172.
- 4. G. M. Del Corso and G. Manzini, Finding exact solutions to the bandwidth minimization problem, Computing, (1999), 189-203.
- 5. N. E. Gibbs, W. G. Poole, and P. K. Stockmeyer, An algorithm for reducing the bandwidth and profile of a sparse matrix, SIAM Journal on Numerical Analysis, (1976), 236-250.
- 6. A. Lim, J. Lin, and F. Xiao, Particle swarm optimization and hill climbing for the bandwidth minimization problem, Applied Intelligence, 26/3, (2007), 175-182.
- 7. A. Lim, B. Rodrigues, and F. Xiao, Heuristics for matrix bandwidth reduction, European Journal of Operational Research, 174/1, (2006), 69-91.
- 8. L. O. Mafteiu-Scai, Bandwidth reduction on sparse matrix, West University of Timisoara Annals, XLVIII/3, (2010.)
- 9. R. Marti, V. Campos, and E. Pinana, A branch and bound algorithm for the matrix bandwidth minimization, European Journal of Operational Research, 186, (2008), 513-528.
- 10. R. Marti, M. Laguna, F. Glover, and V. Campos, Reducing the bandwidth of a sparse matrix with tabu search, European Journal of Operational Research, 135, (2001), 450-459.
- 11. N. Mladenovic, D. Urosevic, D. Perez-Brito, and C. Garcia-Gonzalez, Variable neighbourhood search for bandwidth reduction, European Journal of Operational Research, 200, (2010), 14-27.
- 12. C. Pintea, G. Crisan, and C. Chira, A Hybrid ACO Approach to the Matrix Bandwidth Minimization Problem, M. Graa Romay et al., Springer-Verlag Berlin Heidelberg, 2010
- 13. L. O. Mafteiu-Scai, V. Negru, D. Zaharie, and O. Aritoni, Average bandwidth reduction in sparse matrices using hybrid heuristics, Studia Universitatis Babes-Bolyai University, Cluj Napoca, 3/2011, (2011.)
- 14. R. Mart, V. Campos, and E. Piana, A Branch and Bound Algorithm for the Matrix Bandwidth Minimization, European Journal of Operational Research 186, (2010), 513-528.
- 15. Eduardo Rodriguez-Tello, Jin-Kao Hao, and Jose Torres-Jimenez, An Improved Simulated Annealing Algorithm for Bandwidth Minimization, European Journal of Operational Research, 185(3): 1319-1335, Elsevier, (2008.)