Jesús Sánchez-Oro
Orcid: 0000-0003-1702-4941
According to our database1,
Jesús Sánchez-Oro
authored at least 65 papers
between 2012 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
The multiobjective traveling salesman-repairman problem with profits: design and implementation of a variable neighborhood descent algorithm for a real scenario.
Int. Trans. Oper. Res., January, 2025
A variable neighborhood search for the median location problem with interconnected facilities.
Int. Trans. Oper. Res., January, 2025
Appl. Soft Comput., 2025
2024
A variable neighborhood search approach for the adaptive multi round influence maximization problem.
Soc. Netw. Anal. Min., December, 2024
An efficient and effective GRASP algorithm for the Budget Influence Maximization Problem.
J. Ambient Intell. Humaniz. Comput., March, 2024
Proceedings of the Metaheuristics - 15th International Conference, 2024
What Characteristics Define a Good Solution in Social Influence Minimization Problems?
Proceedings of the Metaheuristics - 15th International Conference, 2024
Improving Biased Random Key Genetic Algorithm with Variable Neighborhood Search for the Weighted Total Domination Problem.
Proceedings of the Metaheuristics - 15th International Conference, 2024
2023
Knowl. Based Syst., October, 2023
A reactive path relinking algorithm for solving the bi-objective p-Median and p-Dispersion problem.
Soft Comput., June, 2023
Math. Comput. Simul., May, 2023
Networks, April, 2023
J. Ambient Intell. Humaniz. Comput., 2023
2022
A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem.
Optim. Lett., 2022
Inf. Sci., 2022
A GRASP algorithm with Tabu Search improvement for solving the maximum intersection of k-subsets problem.
J. Heuristics, 2022
Eur. J. Oper. Res., 2022
Eur. J. Oper. Res., 2022
Proceedings of the Variable Neighborhood Search - 9th International Conference, 2022
Proceedings of the Variable Neighborhood Search - 9th International Conference, 2022
Proceedings of the Variable Neighborhood Search - 9th International Conference, 2022
An Efficient Fixed Set Search for the Covering Location with Interconnected Facilities Problem.
Proceedings of the Metaheuristics - 14th International Conference, 2022
Proceedings of the Metaheuristics - 14th International Conference, 2022
2021
Memetic Comput., 2021
Knowl. Based Syst., 2021
A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location.
INFORMS J. Comput., 2021
Appl. Soft Comput., 2021
A fast variable neighborhood search approach for multi-objective community detection.
Appl. Soft Comput., 2021
Proceedings of the Variable Neighborhood Search - 8th International Conference, 2021
2020
Networks, 2020
A general variable neighborhood search for solving the multi-objective open vehicle routing problem.
J. Heuristics, 2020
Iterated greedy with variable neighborhood search for a multiobjective waste collection problem.
Expert Syst. Appl., 2020
Finding weaknesses in networks using Greedy Randomized Adaptive Search Procedure and Path Relinking.
Expert Syst. J. Knowl. Eng., 2020
2019
2018
Future Gener. Comput. Syst., 2018
Proceedings of the International Conference on Learning and Optimization Algorithms: Theory and Applications, 2018
Proceedings of the Intelligent Data Engineering and Automated Learning - IDEAL 2018, 2018
Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018
Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018
Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018
2017
Optim. Lett., 2017
Int. Trans. Oper. Res., 2017
Electron. Notes Discret. Math., 2017
Comput. Optim. Appl., 2017
Appl. Soft Comput., 2017
2016
Parallel strategic oscillation: an application to the maximum leaf spanning tree problem.
Prog. Artif. Intell., 2016
Efficient Greedy Randomized Adaptive Search Procedure for the Generalized Regenerator Location Problem.
Int. J. Comput. Intell. Syst., 2016
Proceedings of the Advances in Artificial Intelligence, 2016
2015
Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization.
Inf. Sci., 2015
Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies.
Electron. Notes Discret. Math., 2015
Beyond Unfeasibility: Strategic Oscillation for the Maximum Leaf Spanning Tree Problem.
Proceedings of the Advances in Artificial Intelligence, 2015
2014
Combining intensification and diversification strategies in VNS. An application to the Vertex Separation problem.
Comput. Oper. Res., 2014
Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem.
Comput. Oper. Res., 2014
2013
Digit. Signal Process., 2013
Proceedings of the Natural and Artificial Computation in Engineering and Medical Applications, 2013
Proceedings of the Working Notes for CLEF 2013 Conference , 2013
2012
Int. J. Comb. Optim. Probl. Informatics, 2012
An experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problems.
Electron. Notes Discret. Math., 2012
Comput. Oper. Res., 2012
Proceedings of the CLEF 2012 Evaluation Labs and Workshop, 2012