Publicaciones en las que colabora con JOSE ANTONIO LOZANO ALONSO (24)

2024

  1. A revisited branch-and-cut algorithm for large-scale orienteering problems

    European Journal of Operational Research, Vol. 313, Núm. 1, pp. 44-68

  2. Characterization of rankings generated by pseudo-Boolean functions

    Swarm and Evolutionary Computation, Vol. 86

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

  4. The Natural Bias of Artificial Instances

    2023 IEEE Congress on Evolutionary Computation, CEC 2023

2022

  1. A mathematical analysis of EDAs with distance-based exponential models

    Memetic Computing, Vol. 14, Núm. 3, pp. 305-334

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

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

2021

  1. A General Framework Based on Walsh Decomposition for Combinatorial Optimization Problems

    2021 IEEE Congress on Evolutionary Computation, CEC 2021 - Proceedings

  2. On solving cycle problems with Branch-and-Cut: extending shrinking and exact subcycle elimination separation algorithms

    Annals of Operations Research, Vol. 305, Núm. 1-2, pp. 107-136

2020

  1. Journey to the center of the linear ordering problem

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

2019

  1. A mathematical analysis of edas with distance-based exponential models

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

  2. 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. An efficient evolutionary algorithm for the orienteering problem

    Computers and Operations Research, Vol. 90, pp. 42-59

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

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

  3. Estimating attraction basin sizes of combinatorial optimization problems

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

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

    2018 IEEE Congress on Evolutionary Computation, CEC 2018 - Proceedings

  5. 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)