Publicaciones en las que colabora con LETICIA HERNANDO RODRIGUEZ (17)

2023

  1. Characterizing Permutation-Based Combinatorial Optimization Problems in Fourier Space

    Evolutionary computation, Vol. 31, Núm. 3, pp. 163-199

  2. New Knowledge about the Elementary Landscape Decomposition for Solving the Quadratic Assignment Problem

    GECCO 2023 - Proceedings of the 2023 Genetic and Evolutionary Computation Conference

  3. On the Use of Second Order Neighbors to Escape from Local Optima

    GECCO 2023 - Proceedings of the 2023 Genetic and Evolutionary Computation Conference

2022

  1. Transitions from P to NP-hardness: the case of the Linear Ordering Problem

    2022 IEEE Congress on Evolutionary Computation, CEC 2022 - Conference Proceedings

2020

  1. Journey to the center of the linear ordering problem

    GECCO 2020 - Proceedings of the 2020 Genetic and Evolutionary Computation Conference

2019

  1. Characterising the rankings produced by combinatorial optimisation problems and finding their intersections

    GECCO 2019 - Proceedings of the 2019 Genetic and Evolutionary Computation Conference

2018

  1. Anatomy of the attraction basins: Breaking with the intuition

    Evolutionary Computation, Vol. 27, Núm. 3, pp. 435-466

  2. Estimating attraction basin sizes of combinatorial optimization problems

    Progress in Artificial Intelligence, Vol. 7, Núm. 4, pp. 369-384

  3. Hill-Climbing Algorithm: Let's Go for a Walk before Finding the Optimum

    2018 IEEE Congress on Evolutionary Computation, CEC 2018 - Proceedings

  4. Multi-start methods

    Handbook of Heuristics (Springer International Publishing), pp. 155-175

2016

  1. A Tunable Generator of Instances of Permutation-Based Combinatorial Optimization Problems

    IEEE Transactions on Evolutionary Computation, Vol. 20, Núm. 2, pp. 165-179

  2. Estimating attraction basin sizes

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2013

  1. An evaluation of methods for estimating the number of local optima in combinatorial optimization problems

    Evolutionary Computation, Vol. 21, Núm. 4, pp. 625-658

  2. Generating customized landscapes in permutation-based combinatorial optimization problems

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  3. Understanding instance complexity in the linear ordering problem

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2011

  1. A study on the complexity of TSP instances under the 2-exchange neighbor system

    IEEE SSCI 2011 - Symposium Series on Computational Intelligence - FOCI 2011: 2011 IEEE Symposium on Foundations of Computational Intelligence