Author:
Ceberio Josu,Mendiburu Alexander,Lozano Jose A.
Publisher
Springer International Publishing
Reference19 articles.
1. Bui, T.N., Jones, C.: Finding good approximate vertex and edge partitions is NP-hard. Inf. Process. Lett. 42(3), 153–159 (1992)
2. Ceberio, J.: Solving permutation problems with estimation of distribution algorithms and extensions thereof. Ph.D. thesis, University of the Basque Country, December 2014
3. Ceberio, J., Irurozki, E., Mendiburu, A., Lozano, J.A.: A distance-based ranking model estimation of distribution algorithm for the flowshop scheduling problem. IEEE Trans. Evol. Comput. 18(2), 286–300 (2014)
4. Ceberio, J., Mendiburu, A., Lozano, J.A.: A square lattice probability model for optimising the graph partitioning problem. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 1629–1636. IEEE (2017)
5. Dror, M.: Arc Routing: Theory Solutions and Applications. Springer, Heidelberg (2012). https://doi.org/10.1007/978-1-4615-4495-1