Publicaciones en las que colabora con JOSU CEBERIO URIBE (27)

2024

  1. A roadmap for solving optimization problems with estimation of distribution algorithms

    Natural Computing, Vol. 23, Núm. 1, pp. 99-113

2023

  1. Neural Improvement Heuristics for Graph Combinatorial Optimization Problems

    IEEE Transactions on Neural Networks and Learning Systems

2021

  1. Exploratory analysis of the Monte Carlo tree search for solving the linear ordering problem

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

2018

  1. Algorithm 989: Perm_mateda: A matlab toolbox of estimation of distribution algorithms for permutation-based combinatorial optimization problems

    ACM Transactions on Mathematical Software, Vol. 44, Núm. 4

  2. Distance-based exponential probability models for constrained combinatorial problems

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

  3. Distance-based exponential probability models for constrained combinatorial problems: abstract

    XVIII Conferencia de la Asociación Española para la Inteligencia Artificial (CAEPIA 2018): avances en Inteligencia Artificial. 23-26 de octubre de 2018 Granada, España

  4. Distance-based exponential probability models on constrained combinatorial optimization problems

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

  5. Zorizko instantzia uniformeak sortzen al dira optimizazio konbinatorioan?

    Ekaia: Euskal Herriko Unibertsitateko zientzi eta teknologi aldizkaria, Núm. 34, pp. 261-277

2017

  1. A square lattice probability model for optimising the Graph Partitioning Problem

    2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings

  2. Are we generating instances uniformly at random?

    2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings

  3. Multi-objectivising combinatorial optimisation problems by means of elementary landscape decompositions

    Evolutionary Computation, Vol. 27, Núm. 2, pp. 291-311

2016

  1. A note on the Boltzmann distribution and the linear ordering problem

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

  2. Bayesian optimization for parameter tuning in evolutionary algorithms

    2016 IEEE Congress on Evolutionary Computation, CEC 2016

2015

  1. A review of distances for the Mallows and Generalized Mallows estimation of distribution algorithms

    Computational Optimization and Applications, Vol. 62, Núm. 2, pp. 545-564

  2. Kernels of Mallows models for solving permutation-based problems

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

  3. Mixtures of Generalized Mallows models for solving the quadratic assignment problem

    2015 IEEE Congress on Evolutionary Computation, CEC 2015 - Proceedings

  4. Multi-objectivising the quadratic assignment problem by means of an elementary landscape decomposition

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

  5. The linear ordering problem revisited

    European Journal of Operational Research, Vol. 241, Núm. 3, pp. 686-696

2014

  1. A distance-based ranking model estimation of distribution algorithm for the flowshop scheduling problem

    IEEE Transactions on Evolutionary Computation, Vol. 18, Núm. 2, pp. 286-300

  2. Extending distance-based ranking models in estimation of distribution algorithms

    Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014