Folgen
Leticia Hernando
Leticia Hernando
Bestätigte E-Mail-Adresse bei ehu.eus
Titel
Zitiert von
Zitiert von
Jahr
An evaluation of methods for estimating the number of local optima in combinatorial optimization problems
L Hernando, A Mendiburu, JA Lozano
Evolutionary computation 21 (4), 625-658, 2013
342013
A tunable generator of instances of permutation-based combinatorial optimization problems
L Hernando, A Mendiburu, JA Lozano
IEEE Transactions on Evolutionary Computation 20 (2), 165-179, 2015
242015
Towards a framework for fishing route optimization decision support systems: Review of the state-of-the-art and challenges
I Granado, L Hernando, I Galparsoro, G Gabina, C Groba, R Prellezo, ...
Journal of Cleaner Production 320, 128661, 2021
232021
Local optima networks of the permutation flowshop scheduling problem: Makespan vs. total flow time
L Hernando, F Daolio, N Veerapen, G Ochoa
2017 IEEE Congress on Evolutionary Computation (CEC), 1964-1971, 2017
202017
Hill-Climbing algorithm: let's go for a walk before finding the optimum
L Hernando, A Mendiburu, JA Lozano
2018 IEEE Congress on Evolutionary Computation (CEC), 1-7, 2018
162018
Anatomy of the attraction basins: Breaking with the intuition
L Hernando, A Mendiburu, JA Lozano
Evolutionary computation 27 (3), 435-466, 2019
122019
A study on the complexity of TSP instances under the 2-exchange neighbor system
L Hernando, JA Pascual, A Mendiburu, JA Lozano
2011 IEEE Symposium on Foundations of Computational Intelligence (FOCI), 15-21, 2011
112011
Journey to the center of the linear ordering problem
L Hernando, A Mendiburu, JA Lozano
Proceedings of the 2020 Genetic and Evolutionary Computation Conference, 201-209, 2020
82020
Characterizing permutation-based combinatorial optimization problems in Fourier space
A Elorza, L Hernando, JA Lozano
Evolutionary Computation 31 (3), 163-199, 2023
72023
Characterising the rankings produced by combinatorial optimisation problems and finding their intersections
L Hernando, A Mendiburu, JA Lozano
Proceedings of the Genetic and Evolutionary Computation Conference, 266-273, 2019
72019
On the symmetry of the quadratic assignment problem through elementary landscape decomposition
X Benavides, J Ceberio, L Hernando
Proceedings of the Genetic and Evolutionary Computation Conference Companion …, 2021
62021
Transitions from P to NP-hardness: the case of the Linear Ordering Problem
A Elorza, L Hernando, JA Lozano
2022 IEEE Congress on Evolutionary Computation (CEC), 1-8, 2022
52022
Estimating attraction basin sizes
L Hernando, A Mendiburu, JA Lozano
Advances in Artificial Intelligence: 17th Conference of the Spanish …, 2016
52016
Generating customized landscapes in permutation-based combinatorial optimization problems
L Hernando, A Mendiburu, JA Lozano
Learning and Intelligent Optimization: 7th International Conference, LION 7 …, 2013
52013
Taxonomization of combinatorial optimization problems in Fourier space
A Elorza, L Hernando, JA Lozano
arXiv preprint arXiv:1905.10852, 2019
42019
A fishing route optimization decision support system: The case of the tuna purse seiner
I Granado, L Hernando, Z Uriondo, JA Fernandes-Salvador
European Journal of Operational Research 312 (2), 718-732, 2024
32024
Estimating attraction basin sizes of combinatorial optimization problems
A Elorza, L Hernando, A Mendiburu, JA Lozano
Progress in artificial intelligence 7 (4), 369-384, 2018
32018
Understanding instance complexity in the linear ordering problem
J Ceberio, L Hernando, A Mendiburu, JA Lozano
Intelligent Data Engineering and Automated Learning–IDEAL 2013: 14th …, 2013
32013
New knowledge about the Elementary Landscape Decomposition for solving the Quadratic Assignment Problem
X Benavides, J Ceberio, L Hernando, JA Lozano
Proceedings of the Genetic and Evolutionary Computation Conference, 239-247, 2023
2023
On the Use of Second Order Neighbors to Escape from Local Optima
M Torralbo, L Hernando, E Contreras-Torres, JA Lozano
Proceedings of the Genetic and Evolutionary Computation Conference, 375-383, 2023
2023
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20