I am Associate Professor at the Computer Science Department, being one of the senior researchers of the Group for Research on Algorithms For Optimization GRAFO. I have published 39 papers in renowned journals such Information Sciences, Applied Soft Computing, or Computers & Operations Research, among others. Furthermore, I have presented my research in more than 40 national and international conferences. I have also coauthored a chapter in the well-known Handbook of Heuristics dedicated to Variable Neighborhood Descent. My research is focused in applying metaheuristics for solving real-life hard combinatorial optimization problems.

Interests

- Artificial Intelligence
- Metaheuristics
- Combinatorial optimization

Education

PhD in Computer Science, 2016

Universidad Rey Juan Carlos

MEng in Computer Vision, 2011

Universidad Rey Juan Carlos

BSc in Computer Science, 2010

Universidad Rey Juan Carlos

- A Fast Metaheuristic for Finding the Minimum Dominating Set in Graphs
- An Efficient Fixed Set Search for the Covering Location with Interconnected Facilities Problem
- Multi-Round Influence Maximization: A Variable Neighborhood Search Approach
- Variable neighborhood search approach with intensified shake for monitor placement
- Monitoring Volcanic and Tectonic Sandbox Analogue Models Using the Kinect v2 Sensor
- A GRASP algorithm with Tabu Search improvement for solving the maximum intersection of k-subsets problem
- GRASP with strategic oscillation for the α-neighbor p-center problem
- Nuevos algoritmos metaheurísticos para el análisis de la influencia de los usuarios en las redes sociales
- A fast variable neighborhood search approach for multi-objective community detection
- A Hybrid Strategic Oscillation with Path Relinking Algorithm for the Multiobjective k-Balanced Center Location Problem
- A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem
- A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location
- A quick GRASP-based method for influence maximization in social networks
- A review on discrete diversity and dispersion maximization from an OR perspective
- Finding Critical Nodes in Networks Using Variable Neighborhood Search
- Multi-Objective GRASP for Maximizing Diversity
- Solving the regenerator location problem with an iterated greedy approach
- Strategic oscillation for the balanced minimum sum-of-squares clustering problem
- The capacitated dispersion problem: an optimization model and a memetic algorithm
- The MDPLIB 2.0 Library of Benchmark Instances for Diversity Problems
- Two-dimensional bandwidth minimization problem: Exact and heuristic approaches
- Un enfoque multi-objetivo para el problema de la máxima diversidad
- New metaheuristic algorithms for the analysis of the user influence in social networks
- A general variable neighborhood search for solving the multi-objective open vehicle routing problem
- Finding weaknesses in networks using greedy randomized adaptive search procedure and path relinking
- Iterated greedy with variable neighborhood search for a multiobjective waste collection problem
- Optimizing Computer Networks Communication with the Band Collocation Problem: A Variable Neighborhood Search Approach
- Preface to the special issue on optimization in vehicle routing and logistics
- A Multi-Objective Parallel Iterated Greedy for Solving the p-Center and p-Dispersion Problem
- GRASP and VNS for solving the p-next center problem
- On the Analysis of the Influence of the Evaluation Metric in Community Detection over Social Networks
- A Metaheuristic Approach for the $backslash$alpha -separator Problem
- Detecting Weak Points in Networks Using Variable Neighborhood Search
- Encontrando grafos bipartitos completos mediante Busqueda de Vecindad Variable
- Finding balanced bicliques in bipartite graphs using variable neighborhood search
- GRASP with Path Relinking for 2D-Bandwidth Minimization Problem
- How to Locate Disperse Obnoxious Facility Centers?
- Iterated Greedy algorithm for performing community detection in social networks
- Tabu search for the dynamic bipartite drawing problem
- Variable Neighborhood Descent.
- Where facility centers should be located?
- An Alternative ILP Model and Algorithmic Ideas for the Maximum Edge-Disjoint Paths Problem
- General variable neighborhood search for computing graph separators
- Improving the performance of embedded systems with variable neighborhood search
- Parallel variable neighborhood search for the min--max order batching problem
- Variable neighborhood scatter search for the incremental graph drawing problem
- Variable neighborhood scatter search for the incremental graph drawing problem
- Búsqueda Dispersa para la minimización del número de cortes en grafos jerárquicos incrementales
- Efficient greedy randomized adaptive search procedure for the generalized regenerator location problem
- Estimating the Spanish Energy Demand Using Variable Neighborhood Search
- Parallel strategic oscillation: an application to the maximum leaf spanning tree problem
- Parallel variable neighbourhood search strategies for the cutwidth minimization problem
- Robust total energy demand estimation with a hybrid Variable Neighborhood Search--Extreme Learning Machine algorithm
- Scatter search for the bandpass problem
- Beyond unfeasibility: strategic oscillation for the maximum leaf spanning tree problem
- Búsqueda dispersa aplicada al problema del paso de banda
- Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization
- Mejorando la eficiencia de sistemas embebidos utilizando estrategias paralelas de búsqueda de vecindad variable
- Scatter search for the profile minimization problem
- Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies
- Combining intensification and diversification strategies in VNS. An application to the Vertex Separation problem
- Grasp with exterior path relinking for differential dispersion minimization
- GRASP with path relinking for the orienteering problem
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
- Balancing intensification and diversification strategies in VNS. An application to the Vertex Separation Problem
- Búsqueda de Vecindad Variable secuencial y paralela: una aplicación al problema de la maximización del corte
- Cálculo de separadores de grafos utilizando búsqueda de vecindad variable reducida
- Computing graph separators with variable neighborhood search
- Hiperheurística basada en minería de datos para la resolución de problemas de caja negra
- Radar-based road-traffic monitoring in urban environments
- Urban traffic surveillance in smart cities using radar images
- URJC&UNED at ImageCLEF 2013 Photo Annotation Task.
- An experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problems
- GRASP con Path Relinking para el problema del SumCut
- Grasp with path relinking for the sumcut problem
- Variable neighborhood search for the vertex separation problem
- GRASP for the SumCut Problem
- JavaOpenCL Binding Java para OpenCL