Mic2003: the Fifth Metaheuristics International Conference Particle Swarm Optimization and Hill Climbing to Solve the Bandwidth Minimization Problem
暂无分享,去创建一个
[1] James Kennedy,et al. Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.
[2] Fred W. Glover,et al. Reducing the bandwidth of a sparse matrix with tabu search , 2001, Eur. J. Oper. Res..
[3] Russell C. Eberhart,et al. A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.
[4] William G. Poole,et al. An algorithm for reducing the bandwidth and profile of a sparse matrix , 1976 .
[5] E. Cuthill,et al. Reducing the bandwidth of sparse symmetric matrices , 1969, ACM '69.
[6] Harriet Black Nembhard,et al. EUROPEAN JOURNAL OF OPERATIONAL , 1998 .