Sergio Pérez-Peló

Orcid: 0000-0002-1915-4160

According to our database1, Sergio Pérez-Peló authored at least 9 papers between 2018 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Biased Random Key Genetic Algorithm for Solving the α-Neighbor p-Center Problem.
Proceedings of the Metaheuristics - 15th International Conference, 2024

2022
Strategic oscillation for the balanced minimum sum-of-squares clustering problem.
Inf. Sci., 2022

A GRASP algorithm with Tabu Search improvement for solving the maximum intersection of k-subsets problem.
J. Heuristics, 2022

A review on discrete diversity and dispersion maximization from an OR perspective.
Eur. J. Oper. Res., 2022

BVNS for Overlapping Community Detection.
Proceedings of the Variable Neighborhood Search - 9th International Conference, 2022

2021
A fast variable neighborhood search approach for multi-objective community detection.
Appl. Soft Comput., 2021

2020
Finding weaknesses in networks using Greedy Randomized Adaptive Search Procedure and Path Relinking.
Expert Syst. J. Knowl. Eng., 2020

2018
A Metaheuristic Approach for the \alpha α -separator Problem.
Proceedings of the Intelligent Data Engineering and Automated Learning - IDEAL 2018, 2018

Detecting Weak Points in Networks Using Variable Neighborhood Search.
Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018


  Loading...