Leticia Hernando

Orcid: 0000-0003-2828-0748

According to our database1, Leticia Hernando authored at least 20 papers between 2011 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
A GRASP-based multi-objective approach for the tuna purse seine fishing fleet routing problem.
Comput. Oper. Res., 2025

2024
A fishing route optimization decision support system: The case of the tuna purse seiner.
Eur. J. Oper. Res., January, 2024

2023
On the Use of Second Order Neighbors to Escape from Local Optima.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023

New Knowledge about the Elementary Landscape Decomposition for Solving the Quadratic Assignment Problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023

2022
Transitions from P to NP-hardness: the case of the Linear Ordering Problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2022

2021
On the symmetry of the quadratic assignment problem through elementary landscape decomposition.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

2020
Journey to the center of the linear ordering problem.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

2019
Anatomy of the Attraction Basins: Breaking with the Intuition.
Evol. Comput., 2019

Taxonomization of Combinatorial Optimization Problems in Fourier Space.
CoRR, 2019

Characterising the rankings produced by combinatorial optimisation problems and finding their intersections.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

2018
Multi-start Methods.
Proceedings of the Handbook of Heuristics., 2018

Estimating attraction basin sizes of combinatorial optimization problems.
Prog. Artif. Intell., 2018

Hill-Climbing Algorithm: Let's Go for a Walk Before Finding the Optimum.
Proceedings of the 2018 IEEE Congress on Evolutionary Computation, 2018

2017
Local Optima Networks of the Permutation Flowshop Scheduling Problem: Makespan vs. total flow time.
Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 2017

2016
A Tunable Generator of Instances of Permutation-Based Combinatorial Optimization Problems.
IEEE Trans. Evol. Comput., 2016

Estimating Attraction Basin Sizes.
Proceedings of the Advances in Artificial Intelligence, 2016

2013
An Evaluation of Methods for Estimating the Number of Local Optima in Combinatorial Optimization Problems.
Evol. Comput., 2013

Generating Customized Landscapes in Permutation-Based Combinatorial Optimization Problems.
Proceedings of the Learning and Intelligent Optimization - 7th International Conference, 2013

Understanding Instance Complexity in the Linear Ordering Problem.
Proceedings of the Intelligent Data Engineering and Automated Learning - IDEAL 2013, 2013

2011
A study on the complexity of TSP instances under the 2-exchange neighbor system.
Proceedings of the IEEE Symposium on Foundations of Computational Intelligence, 2011


  Loading...