Using an evolutionary algorithm for bandwidth minimization
暂无分享,去创建一个
[1] Norman E. Gibbs,et al. The bandwidth problem for graphs and matrices - a survey , 1982, J. Graph Theory.
[2] J.-C. Luo,et al. Algorithms for reducing the bandwidth and profile of a sparse matrix , 1992 .
[3] Christos H. Papadimitriou,et al. The NP-Completeness of the bandwidth minimization problem , 1976, Computing.
[4] E. Cuthill,et al. Reducing the bandwidth of sparse symmetric matrices , 1969, ACM '69.
[5] Luciano Tarricone,et al. A new matrix bandwidth reduction algorithm , 1998, Oper. Res. Lett..
[6] Prabhakar Raghavan,et al. Sparse matrix reordering schemes for browsing hypertext , 1996 .
[7] Giovanni Manzini,et al. Finding Exact Solutions to the Bandwidth Minimization Problem , 1999, Computing.
[8] William F. Smyth,et al. An Improved Method for Reducing the Bandwidth of Sparse Symmetric Matrices , 1971, IFIP Congress.
[9] Fred W. Glover,et al. Reducing the bandwidth of a sparse matrix with tabu search , 2001, Eur. J. Oper. Res..
[10] David S. Johnson,et al. COMPLEXITY RESULTS FOR BANDWIDTH MINIMIZATION , 1978 .
[11] William G. Poole,et al. An algorithm for reducing the bandwidth and profile of a sparse matrix , 1976 .