Ant colony optimization with hill climbing for the bandwidth minimization problem
暂无分享,去创建一个
Andrew Lim | Jing Lin | Fei Xiao | Brian Rodrigues | A. Lim | B. Rodrigues | Fei Xiao | Jing Lin
[1] Fred W. Glover,et al. Reducing the bandwidth of a sparse matrix with tabu search , 2001, Eur. J. Oper. Res..
[2] Anahí Gallardo Velázquez,et al. Conference , 1969, Journal of Neuroscience Methods.
[3] Isaac Plana,et al. GRASP and path relinking for the matrix bandwidth minimization , 2004, Eur. J. Oper. Res..
[4] Piero Mussio,et al. Toward a Practice of Autonomous Systems , 1994 .
[5] Marco Dorigo,et al. Distributed Optimization by Ant Colonies , 1992 .
[6] E. Cuthill,et al. Reducing the bandwidth of sparse symmetric matrices , 1969, ACM '69.
[7] Christos H. Papadimitriou,et al. The NP-Completeness of the bandwidth minimization problem , 1976, Computing.
[8] Walter Unger,et al. The complexity of the approximation of the bandwidth problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[9] Ian P. King,et al. An automatic reordering scheme for simultaneous equations derived from network systems , 1970 .
[10] William G. Poole,et al. An algorithm for reducing the bandwidth and profile of a sparse matrix , 1976 .
[11] Luca Maria Gambardella,et al. Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..