Abraham Duarte is Full Professor in the Computer Science Department at the Rey Juan Carlos University (Madrid, Spain). He has done extensive research in the interface between computer science, artificial intelligence, and operations research to develop solution methods based on Computational Intelligence (metaheuristics) for practical problems in operations-management areas such as logistics and supply chains, telecommunications, decision-making under uncertainty and optimization of simulated systems
Interests
- Optimization
- Metaheuristics
- Computational Intelligence
Education
PhD in Computer Sciences, 2004
Universidad Rey Juan Carlos
Physics Sciences (electronics), 1998
Universidad Complutense de Madrid
Latest
- A variable neighborhood search approach for the adaptive multi round influence maximization problem
- Multi-objective general variable neighborhood search for software maintainability optimization
- A variable neighborhood search for the median location problem with interconnected facilities
- General Variable Neighborhood Search for the optimization of software quality
- ¿Cómo obtener soluciones heurísticas buenas? Caso de estudio en problemas de minimización de la influencia en redes sociales.
- A Basic Variable Neighborhood Search for the Planar Obnoxious Facility Location Problem
- A Biased Random Key Genetic Algorithm for Solving the α-Neighbor p-Center Problem
- An Efficient Algorithm for the T-Row Facility Layout Problem
- Improving Biased Random Key Genetic Algorithm with Variable Neighborhood Search for the Weighted Total Domination Problem
- Optimization of Fairness and Accuracy on Logistic Regression Models
- What Characteristics Define a Good Solution in Social Influence Minimization Problems?
- An efficient and effective GRASP algorithm for the Budget Influence Maximization Problem
- A reactive path relinking algorithm for solving the bi-objective p-Median and p-Dispersion problem
- A Metaheuristic Approach for Solving Monitor Placement Problem
- A Scatter Search Approach for the Parallel Row Ordering Problem
- An Efficient Fixed Set Search for the Covering Location with Interconnected Facilities Problem
- BVNS for Overlapping Community Detection
- Greedy Randomized Adaptive Search Procedure
- Multi-objective Variable Neighborhood Search for Improving Software Modularity
- Multi-Round Influence Maximization: A Variable Neighborhood Search Approach
- Order Batching Problems: taxonomy and literature review
- Variable Neighborhood Descent for Software Quality Optimization
- Multi-Round Influence Maximization: A Variable Neighborhood Search Approach
- Variable neighborhood search approach with intensified shake for monitor placement
- A practical methodology for reproducible experimentation: an application to the Double-row Facility Layout Problem
- Efficient iterated greedy for the two-dimensional bandwidth minimization problem
- A variable neighborhood search approach for cyclic bandwidth sum problem
- An efficient heuristic algorithm for software module clustering optimization
- Out of the Niche: Using Direct Search Methods to Find Multiple Global Optima
- A general variable neighborhood search approach for the minimum load coloring problem
- Max-min dispersion with capacity and cost for a practical location problem
- A GRASP algorithm with Tabu Search improvement for solving the maximum intersection of k-subsets problem
- A general variable neighborhood search for the cyclic antibandwidth 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 heuristic approach for the online order batching problem with multiple pickers
- A Hybrid Strategic Oscillation with Path Relinking Algorithm for the Multiobjective k-Balanced Center Location Problem
- A quick GRASP-based method for influence maximization in social networks
- An efficient Variable Neighborhood Search for the Space-Free Multi-Row Facility Layout problem
- An improved GRASP method for the multiple row equal facility layout problem
- BVNS Approach for the Order Processing in Parallel Picking Workstations
- Designing modern heuristic algorithms to solve the Transmission Expansion Planning problem
- Finding Critical Nodes in Networks Using Variable Neighborhood Search
- Influence of the Alternative Objective Functions in the Optimization of the Cyclic Cutwidth Minimization Problem
- Solving the regenerator location problem with an iterated greedy approach
- Strategic oscillation for the balanced minimum sum-of-squares clustering problem
- The MDPLIB 2.0 Library of Benchmark Instances for Diversity Problems
- Two-dimensional bandwidth minimization problem: Exact and heuristic approaches
- New metaheuristic algorithms for the analysis of the user influence in social networks
- A parallel variable neighborhood search approach for the obnoxious p-median problem
- An efficient metaheuristic for the K-page crossing number minimization problem
- Basic variable neighborhood search for the minimum sitting arrangement problem
- Finding weaknesses in networks using greedy randomized adaptive search procedure and path relinking
- Fixed versus variable time window warehousing strategies in real time
- GRASP with Variable Neighborhood Descent for the online order batching problem
- La infructuosa búsqueda de la solución óptima
- Multistart Search for the Cyclic Cutwidth Minimization Problem
- On solving the order processing in picking workstations
- Optimizing Computer Networks Communication with the Band Collocation Problem: A Variable Neighborhood Search Approach
- Special issue on recent innovations in variable neighborhood search
- A Multi-Objective Parallel Iterated Greedy for Solving the p-Center and p-Dispersion Problem
- A Variable Neighborhood Search approach for the Hamiltonian p-median problem
- A Variable Neighborhood Search approach for the Hamiltonian p-median problem
- Basic VNS for a Variant of the Online Order Batching 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
- Búsqueda de vecindad variable para el problema de la agrupación y recogida de pedidos online en almacenes logísticos
- 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
- Heuristics for the bi-objective diversity problem
- Iterated Greedy algorithm for performing community detection in social networks
- Linear Layout Problems
- Multi-objective memetic optimization for the bi-objective obnoxious p-median problem
- New VNS Variants for the Online Order Batching Problem
- Scatter search for the bi-criteria p-median p-dispersion problem
- Tabu search for the dynamic bipartite drawing problem
- Variable Neighborhood Descent.
- An Alternative ILP Model and Algorithmic Ideas for the Maximum Edge-Disjoint Paths Problem
- General variable neighborhood search for computing graph separators
- General Variable Neighborhood Search for the Order Batching and Sequencing Problem
- 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
- Variable Neighborhood Search strategies for the Order Batching Problem
- Advanced greedy randomized adaptive search procedure for the obnoxious p-median problem
- Búsqueda de Vecindad Variable para el Directed Circular Facility Layout Problem
- Búsqueda de vecindad variable para el problema de la minimización del número de errores en ordenaciones líneales
- 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
- VNS pour le Minimum Sitting Arrangement Problem
- General Variable Neighborhood Search applied to the picking process in a warehouse
- An algorithm for batching, sequencing and picking operations in a warehouse
- Beyond unfeasibility: strategic oscillation for the maximum leaf spanning tree problem
- Búsqueda de Vecindad Variable Básica para la minimización del tiempo máximo en el Problema del Empaquetamiento de Pedidos
- Búsqueda de vecindad variable general aplicada al proceso de recogida de productos en almacenes
- 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
- Multi-objective variable neighborhood search: an application to combinatorial optimization problems
- Scatter search for the profile minimization problem
- Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies
- Un Algoritmo para Empaquetado, Secuenciación y Operaciones de Recogida en un Almacén
- 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
- Branch and bound for the cutwidth minimization 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
- Heuristics and metaheuristics for the maximum diversity problem
- URJC&UNED at ImageCLEF 2013 Photo Annotation Task.
- Variable formulation search for the cutwidth minimization problem
- A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem
- ALSYSTEM: Autonomous Learning System in Computer Science Degrees
- 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
- Scatter search for the cutwidth minimization problem
- Variable neighborhood search for the vertex separation problem
- GRASP for the SumCut Problem
- Optsicom Project