Publisher
Springer Nature Switzerland
Reference41 articles.
1. Baum, E.B.: Iterated descent: a better algorithm for local search in combinatorial optimization problems. Technical report, Caltech, Pasadena, CA (1986)
2. Baxter, J.: Local optima avoidance in depot location. J. Oper. Res. Soc. 32(9), 815 (1981)
3. Chagas, G.O., Gonzaga de Oliveira, S.L.: Metaheuristic-based heuristics for symmetric-matrix bandwidth reduction: a systematic review. Procedia Comput. Sci. (ICCS 2015 International Conference on Computational Science) 51, 211–220 (2015)
4. Czibula, G., Crişan, G.C., Pintea, C.M., Czibula, I.G.: Soft computing approaches on the bandwidth problem. Informatica 24(2), 169–180 (2013)
5. Davis, T., Hu, Y.: The university of florida sparse matrix collection. ACM Trans. Math. Softw. 38, 1 (11 2011)