Blog
Eventos
Investigadores
Proyectos
Publicaciones
Líneas de investigación
Heuristicas.es
Optsicom
Contacto
Español
English
Rafael Martí
Recientes
GRASP with Evolutionary Path Relinking for the conditional p-Dispersion problem
Strategic oscillation tabu search for improved hierarchical graph drawing
Max-min dispersion with capacity and cost for a practical location problem
A review on discrete diversity and dispersion maximization from an OR perspective
The capacitated dispersion problem: an optimization model and a memetic algorithm
The MDPLIB 2.0 Library of Benchmark Instances for Diversity Problems
A parallel variable neighborhood search approach for the obnoxious p-median problem
Iterated greedy with variable neighborhood search for a multiobjective waste collection problem
Heuristics for the bi-objective diversity problem
Linear Layout Problems
Multi-objective memetic optimization for the bi-objective obnoxious p-median problem
Scatter search for the bi-criteria p-median p-dispersion problem
Tabu search for the dynamic bipartite drawing problem
Improving the performance of embedded systems with variable neighborhood search
Variable neighborhood scatter search for the incremental graph drawing problem
Variable neighborhood scatter search for the incremental graph drawing problem
Advanced greedy randomized adaptive search procedure for the obnoxious p-median problem
Búsqueda Dispersa para la minimización del número de cortes en grafos jerárquicos incrementales
Scatter search for the bandpass 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
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
Branch and bound for the cutwidth minimization problem
Heuristics and metaheuristics for the maximum diversity problem
Scatter search for the cutwidth minimization problem
Variable neighborhood search for the vertex separation problem
Citar
×