Josu Ceberio

According to our database1, Josu Ceberio authored at least 39 papers between 2007 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Kernels of Mallows Models under the Hamming Distance for solving the Quadratic Assignment Problem.
Swarm Evol. Comput., 2020

Virtual Network Function Placement Optimization With Deep Reinforcement Learning.
IEEE J. Sel. Areas Commun., 2020

Constrained Combinatorial Optimization with Reinforcement Learning.
CoRR, 2020

Using pairwise precedences for solving the linear ordering problem.
Appl. Soft Comput., 2020

Gradient search in the space of permutations: an application for the linear ordering problem.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

An adaptive neuroevolution-based hyperheuristic.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

Alternative Representations for Codifying Solutions in Permutation-Based Problems.
Proceedings of the IEEE Congress on Evolutionary Computation, 2020

2019
Multi-Objectivising Combinatorial Optimisation Problems by Means of Elementary Landscape Decompositions.
Evol. Comput., 2019

Evolving Neural Networks in Reinforcement Learning by means of UMDAc.
CoRR, 2019

Bayesian performance analysis for black-box optimization benchmarking.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Approaching the quadratic assignment problem with kernels of mallows models under the hamming distance.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

On the definition of dynamic permutation problems under landscape rotation.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Hybrid Heuristics for the Linear Ordering Problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2019

2018
Algorithm 989: perm_mateda: A Matlab Toolbox of Estimation of Distribution Algorithms for Permutation-based Combinatorial Optimization Problems.
ACM Trans. Math. Softw., 2018

A decomposition-based kernel of Mallows models algorithm for bi- and tri-objective permutation flowshop scheduling problem.
Appl. Soft Comput., 2018

Distance-based exponential probability models on constrained combinatorial optimization problems.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

Bayesian inference for algorithm ranking analysis.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

A Decomposition-Based Local Search Algorithm for Multi-Objective Sequence Dependent Setup Times Permutation Flowshop Scheduling.
Proceedings of the 2018 IEEE Congress on Evolutionary Computation, 2018

Are the Artificially Generated Instances Uniform in Terms of Difficulty?
Proceedings of the 2018 IEEE Congress on Evolutionary Computation, 2018

Balancing the Diversification-Intensification Trade-off Using Mixtures of Probability Models.
Proceedings of the 2018 IEEE Congress on Evolutionary Computation, 2018

Distance-Based Exponential Probability Models for Constrained Combinatorial Problems.
Proceedings of the Advances in Artificial Intelligence, 2018

2017
Evolutionary algorithms to optimize low-thrust trajectory design in spacecraft orbital precession mission.
Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 2017

Are we generating instances uniformly at random?
Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 2017

A square lattice probability model for optimising the Graph Partitioning Problem.
Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 2017

2016
Bayesian optimization for parameter tuning in evolutionary algorithms.
Proceedings of the IEEE Congress on Evolutionary Computation, 2016

A Note on the Boltzmann Distribution and the Linear Ordering Problem.
Proceedings of the Advances in Artificial Intelligence, 2016

2015
The linear ordering problem revisited.
Eur. J. Oper. Res., 2015

A review of distances for the Mallows and Generalized Mallows estimation of distribution algorithms.
Comput. Optim. Appl., 2015

Kernels of Mallows Models for Solving Permutation-based Problems.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Mixtures of Generalized Mallows models for solving the quadratic assignment problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2015

Multi-objectivising the Quadratic Assignment Problem by Means of an Elementary Landscape Decomposition.
Proceedings of the Advances in Artificial Intelligence, 2015

2014
A Distance-Based Ranking Model Estimation of Distribution Algorithm for the Flowshop Scheduling Problem.
IEEE Trans. Evol. Comput., 2014

Extending distance-based ranking models in estimation of distribution algorithms.
Proceedings of the IEEE Congress on Evolutionary Computation, 2014

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

The Plackett-Luce ranking model on permutation-based optimization problems.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

2012
A review on estimation of distribution algorithms in permutation-based combinatorial optimization problems.
Prog. Artif. Intell., 2012

2011
Introducing the Mallows Model on Estimation of Distribution Algorithms.
Proceedings of the Neural Information Processing - 18th International Conference, 2011

A preliminary study on EDAs for permutation problems based on marginal-based models.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

2007
Application of Micro-Genetic Algorithm for Task Based Computing.
Proceedings of the 2007 International Conference on Intelligent Pervasive Computing, 2007


  Loading...