Eduardo Rodriguez-Tello

Orcid: 0000-0002-0333-0633

According to our database1, Eduardo Rodriguez-Tello authored at least 52 papers between 2000 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An intensification-driven search algorithm for the family traveling salesman problem with incompatibility constraints.
Knowl. Based Syst., 2024

Fourier Series Guided Design of Quantum Convolutional Neural Networks for Enhanced Time Series Forecasting.
CoRR, 2024

2023
B-PSA: A Binary Pendulum Search Algorithm for the Feature Selection Problem.
Comput., November, 2023

Population-based iterated greedy algorithm for the S-labeling problem.
Comput. Oper. Res., July, 2023

Multi-armed Bandit-Based Metaheuristic Operator Selection: The Pendulum Algorithm Binarization Case.
Proceedings of the Optimization and Learning - 6th International Conference, 2023

1D Quantum Convolutional Neural Network for Time Series Forecasting and Classification.
Proceedings of the Advances in Computational Intelligence, 2023

Pendulum Motion Based Optimization Algorithm To Solve The Feature Selection Problem.
Proceedings of the XLIX Latin American Computer Conference, 2023

2022
A variable neighborhood search approach for cyclic bandwidth sum problem.
Knowl. Based Syst., 2022

MACFE: A Meta-learning and Causality Based Feature Engineering Framework.
Proceedings of the Advances in Computational Intelligence, 2022

2021
Two-dimensional bandwidth minimization problem: Exact and heuristic approaches.
Knowl. Based Syst., 2021

Search Trajectory Networks Applied to the Cyclic Bandwidth Sum Problem.
IEEE Access, 2021

2020
A new iterated local search algorithm for the cyclic bandwidth problem.
Knowl. Based Syst., 2020

Solving complex problems using model transformations: from set constraint modeling to SAT instance solving.
Expert Syst. Appl., 2020

Advances in Recent Nature-Inspired Algorithms for Neural Engineering.
Comput. Intell. Neurosci., 2020

Accurate Identification of Tomograms of Lung Nodules Using CNN: Influence of the Optimizer, Preprocessing and Segmentation.
Proceedings of the Pattern Recognition - 12th Mexican Conference, 2020

2019
Migration policies in dynamic island models.
Nat. Comput., 2019

Alternative evaluation functions for the cyclic bandwidth sum problem.
Eur. J. Oper. Res., 2019

Dynamic Multi-Armed Bandit Algorithm for the Cyclic Bandwidth Sum Problem.
IEEE Access, 2019

An Iterated Three-Phase Search Approach for Solving the Cyclic Bandwidth Problem.
IEEE Access, 2019

A Study of Recombination Operators for the Cyclic Bandwidth Problem.
Proceedings of the Artificial Evolution, 2019

2018
Comparative Study of Different Memetic Algorithm Configurations for the Cyclic Bandwidth Sum Problem.
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

2016
Scientific Programming in Computational Intelligence.
Sci. Program., 2016

A Statistical Comparison of Objective Functions for the Vehicle Routing Problem with Route Balancing.
Proceedings of the Fifteenth Mexican International Conference on Artificial Intelligence, 2016

2015
Multi-objectivization, fitness landscape transformation and search performance: A case of study on the hp model for protein structure prediction.
Eur. J. Oper. Res., 2015

Tabu search for the cyclic bandwidth problem.
Comput. Oper. Res., 2015

Constraint-handling through multi-objective optimization: The hydrophobic-polar model for protein structure prediction.
Comput. Oper. Res., 2015

2014
A bottom-up implementation of Path-Relinking for Phylogenetic reconstruction applied to Maximum Parsimony.
Proceedings of the 2014 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making, 2014

2013
Comparative Analysis of Different Evaluation Functions for Protein Structure Prediction Under the HP Model.
J. Comput. Sci. Technol., 2013

Handling constraints in the HP model for protein structure prediction by multiobjective optimization.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

2012
New bounds for binary covering arrays using simulated annealing.
Inf. Sci., 2012

An Improved Multiobjectivization Strategy for HP Model-Based Protein Structure Prediction.
Proceedings of the Parallel Problem Solving from Nature - PPSN XII, 2012

A New Branch and Bound Algorithm for the Cyclic Bandwidth Problem.
Proceedings of the Advances in Computational Intelligence, 2012

Locality-based multiobjectivization for the HP model of protein structure prediction.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

Maximum Parsimony Phylogenetic Inference Using Simulated Annealing.
Proceedings of the EVOLVE, 2012

Multiobjectivizing the HP Model for Protein Structure Prediction.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2012

2011
Comparing alternative energy functions for the HP model of protein structure prediction.
Proceedings of the IEEE Congress on Evolutionary Computation, 2011

Effective ranking + speciation = Many-objective optimization.
Proceedings of the IEEE Congress on Evolutionary Computation, 2011

An Improved Memetic Algorithm for the Antibandwidth Problem.
Proceedings of the Artificial Evolution, 2011

2010
Simulated Annealing for constructing binary covering arrays of variable strength.
Proceedings of the IEEE Congress on Evolutionary Computation, 2010

2009
A New Backtracking Algorithm for Constructing Binary Covering Arrays of Variable Strength.
Proceedings of the MICAI 2009: Advances in Artificial Intelligence, 2009

Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three.
Proceedings of the Artifical Evolution, 2009

2008
An improved simulated annealing algorithm for bandwidth minimization.
Eur. J. Oper. Res., 2008

An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem.
Comput. Oper. Res., 2008

Strength Two Covering Arrays Construction Using a SAT Representation.
Proceedings of the MICAI 2008: Advances in Artificial Intelligence, 2008

2006
A Refined Evaluation Function for the MinLA Problem.
Proceedings of the MICAI 2006: Advances in Artificial Intelligence, 2006

2005
A Comparison of Memetic Recombination Operators for the MinLA Problem.
Proceedings of the MICAI 2005: Advances in Artificial Intelligence, 2005

Memetic Algorithms for the MinLA Problem.
Proceedings of the Artificial Evolution, 2005

2004
An Improved Evaluation Function for the Bandwidth Minimization Problem.
Proceedings of the Parallel Problem Solving from Nature, 2004

Improving the Performance of a Genetic Algorithm Using a Variable-Reordering Algorithm.
Proceedings of the Genetic and Evolutionary Computation, 2004

2003
ERA: An Algorithm for Reducing the Epistasis of SAT Problems.
Proceedings of the Genetic and Evolutionary Computation, 2003

2000
A New Measure for the Bandwidth Minimization Problem.
Proceedings of the Advances in Artificial Intelligence, 2000

A Genetic Algorithms for Matrix Bandwith Reduction.
Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '00), 2000


  Loading...