default search action
Jesús Sánchez-Oro
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j44]Isaac Lozano-Osorio
, Jesús Sánchez-Oro, A. D. López-Sánchez
A variable neighborhood search for the median location problem with interconnected facilities. Int. Trans. Oper. Res. 32(1): 69-89 (2025) - [j43]R. Morante-González
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. 32(1): 221-243 (2025) - 2024
- [j42]Isaac Lozano-Osorio
An efficient and effective GRASP algorithm for the Budget Influence Maximization Problem. J. Ambient Intell. Humaniz. Comput. 15(3): 2023-2034 (2024) - [j41]Isaac Lozano-Osorio, Jesús Sánchez-Oro, Abraham Duarte:
A variable neighborhood search approach for the adaptive multi round influence maximization problem. Soc. Netw. Anal. Min. 14(1): 165 (2024) - [c19]Sergio Pérez-Peló
A Biased Random Key Genetic Algorithm for Solving the α-Neighbor p-Center Problem. MIC (1) 2024: 9-14 - [c18]Isaac Lozano-Osorio
What Characteristics Define a Good Solution in Social Influence Minimization Problems? MIC (2) 2024: 328-333 - [c17]Alejandra Casado
Improving Biased Random Key Genetic Algorithm with Variable Neighborhood Search for the Weighted Total Domination Problem. MIC (1) 2024: 377-382 - 2023
- [j40]Isaac Lozano-Osorio
A quick GRASP-based method for influence maximization in social networks. J. Ambient Intell. Humaniz. Comput. 14(4): 3767-3779 (2023) - [j39]Isaac Lozano-Osorio
Dynamic Path Relinking for the Target Set Selection problem. Knowl. Based Syst. 278: 110827 (2023) - [j38]Alejandra Casado, Sergio Bermudo
An iterated greedy algorithm for finding the minimum dominating set in graphs. Math. Comput. Simul. 207: 41-58 (2023) - [j37]Alejandra Casado
Variable neighborhood search approach with intensified shake for monitor placement. Networks 81(3): 319-333 (2023) - [j36]Isaac Lozano-Osorio
A reactive path relinking algorithm for solving the bi-objective p-Median and p-Dispersion problem. Soft Comput. 27(12): 8029-8059 (2023) - 2022
- [j35]Rafael Martí
A review on discrete diversity and dispersion maximization from an OR perspective. Eur. J. Oper. Res. 299(3): 795-813 (2022) - [j34]Jesús Sánchez-Oro, A. D. López-Sánchez, Alfredo García Hernández-Díaz, Abraham Duarte
GRASP with strategic oscillation for the α-neighbor p-center problem. Eur. J. Oper. Res. 303(1): 143-158 (2022) - [j33]Alejandra Casado
A GRASP algorithm with Tabu Search improvement for solving the maximum intersection of k-subsets problem. J. Heuristics 28(1): 121-146 (2022) - [j32]Raúl Martín-Santamaría
Strategic oscillation for the balanced minimum sum-of-squares clustering problem. Inf. Sci. 585: 529-542 (2022) - [j31]Jesús Sánchez-Oro, Ana Dolores López-Sánchez, J. Manuel Colmenar
A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem. Optim. Lett. 16(1): 301-331 (2022) - [c16]Isaac Lozano-Osorio
An Efficient Fixed Set Search for the Covering Location with Interconnected Facilities Problem. MIC 2022: 485-490 - [c15]Alejandra Casado
A Fast Metaheuristic for Finding the Minimum Dominating Set in Graphs. MIC 2022: 554-559 - [c14]Alejandra Casado
A Metaheuristic Approach for Solving Monitor Placement Problem. ICVNS 2022: 1-13 - [c13]Sergio Pérez-Peló
BVNS for Overlapping Community Detection. ICVNS 2022: 27-41 - [c12]Isaac Lozano-Osorio
Multi-Round Influence Maximization: A Variable Neighborhood Search Approach. ICVNS 2022: 112-124 - 2021
- [j30]Juan David Quintana
Solving the regenerator location problem with an iterated greedy approach. Appl. Soft Comput. 111: 107659 (2021) - [j29]Sergio Pérez-Peló
A fast variable neighborhood search approach for multi-objective community detection. Appl. Soft Comput. 112: 107838 (2021) - [j28]A. D. López-Sánchez, Jesús Sánchez-Oro, Manuel Laguna
A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location. INFORMS J. Comput. 33(2): 629-642 (2021) - [j27]Miguel Ángel Rodríguez-García, Jesús Sánchez-Oro, Eduardo Rodriguez-Tello, Éric Monfroy
Two-dimensional bandwidth minimization problem: Exact and heuristic approaches. Knowl. Based Syst. 214: 106651 (2021) - [j26]Rafael Martí, Anna Martínez-Gavara
The capacitated dispersion problem: an optimization model and a memetic algorithm. Memetic Comput. 13(1): 131-146 (2021) - [c11]Iván Martín de San Lázaro
Finding Critical Nodes in Networks Using Variable Neighborhood Search. ICVNS 2021: 1-13 - 2020
- [j25]Sergio Pérez-Peló
Finding weaknesses in networks using Greedy Randomized Adaptive Search Procedure and Path Relinking. Expert Syst. J. Knowl. Eng. 37(6) (2020) - [j24]Laura Delgado-Antequera
Iterated greedy with variable neighborhood search for a multiobjective waste collection problem. Expert Syst. Appl. 145: 113101 (2020) - [j23]Jesús Sánchez-Oro, Ana Dolores López-Sánchez, J. Manuel Colmenar
A general variable neighborhood search for solving the multi-objective open vehicle routing problem. J. Heuristics 26(3): 423-452 (2020) - [j22]Ana Dolores López-Sánchez, Jesús Sánchez-Oro
Preface to the special issue on optimization in vehicle routing and logistics. Networks 76(2): 125-127 (2020)
2010 – 2019
- 2019
- [j21]Ana Dolores López-Sánchez
GRASP and VNS for solving the p-next center problem. Comput. Oper. Res. 104: 295-303 (2019) - 2018
- [j20]Rafael Martí, Anna Martínez-Gavara
Tabu search for the dynamic Bipartite Drawing Problem. Comput. Oper. Res. 91: 1-12 (2018) - [j19]Jesús Sánchez-Oro
Iterated Greedy algorithm for performing community detection in social networks. Future Gener. Comput. Syst. 88: 785-791 (2018) - [c10]Jesús Sánchez-Oro
How to Locate Disperse Obnoxious Facility Centers? ICVNS 2018: 52-63 - [c9]Juan David Quintana
Finding Balanced Bicliques in Bipartite Graphs Using Variable Neighborhood Search. ICVNS 2018: 114-124 - [c8]Sergio Pérez-Peló
Detecting Weak Points in Networks Using Variable Neighborhood Search. ICVNS 2018: 141-151 - [c7]Sergio Pérez-Peló
A Metaheuristic Approach for the \alpha α -separator Problem. IDEAL (2) 2018: 336-343 - [c6]Miguel Ángel Rodríguez-García
GRASP with Path Relinking for 2D-Bandwidth Minimization Problem. LOPAL 2018: 52:1-52:5 - [r1]Abraham Duarte, Jesús Sánchez-Oro, Nenad Mladenovic
Variable Neighborhood Descent. Handbook of Heuristics 2018: 341-367 - 2017
- [j18]Jesús Sánchez-Oro, Marc Sevaux, André Rossi
Improving the performance of embedded systems with variable neighborhood search. Appl. Soft Comput. 53: 217-226 (2017) - [j17]Jesús Sánchez-Oro, Anna Martínez-Gavara
Variable neighborhood scatter search for the incremental graph drawing problem. Comput. Optim. Appl. 68(3): 775-797 (2017) - [j16]Jesús Sánchez-Oro, Anna Martínez-Gavara
Variable neighborhood descent for the incremental graph drawing. Electron. Notes Discret. Math. 58: 183-190 (2017) - [j15]Borja Menéndez
Parallel variable neighborhood search for the min-max order batching problem. Int. Trans. Oper. Res. 24(3): 635-662 (2017) - [j14]Jesús Sánchez-Oro, Nenad Mladenovic
General Variable Neighborhood Search for computing graph separators. Optim. Lett. 11(6): 1069-1089 (2017) - 2016
- [j13]Juan David Quintana
Efficient Greedy Randomized Adaptive Search Procedure for the Generalized Regenerator Location Problem. Int. J. Comput. Intell. Syst. 9(6): 1016-1027 (2016) - [j12]Jesús Sánchez-Oro
Scatter search for the bandpass problem. J. Glob. Optim. 66(4): 769-790 (2016) - [j11]Jesús Sánchez-Oro, Borja Menéndez
Parallel strategic oscillation: an application to the maximum leaf spanning tree problem. Prog. Artif. Intell. 5(2): 121-128 (2016) - [c5]Jesús Sánchez-Oro
Estimating the Spanish Energy Demand Using Variable Neighborhood Search. CAEPIA 2016: 341-350 - 2015
- [j10]Jesús Sánchez-Oro
Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies. Electron. Notes Discret. Math. 47: 85-92 (2015) - [j9]Abraham Duarte, Jesús Sánchez-Oro
Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization. Inf. Sci. 296: 46-60 (2015) - [j8]Jesús Sánchez-Oro
Scatter search for the profile minimization problem. Networks 65(1): 10-21 (2015) - [c4]Jesús Sánchez-Oro
Beyond Unfeasibility: Strategic Oscillation for the Maximum Leaf Spanning Tree Problem. CAEPIA 2015: 322-331 - 2014
- [j7]Abraham Duarte
Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem. Comput. Oper. Res. 51: 123-129 (2014) - [j6]Jesús Sánchez-Oro
Combining intensification and diversification strategies in VNS. An application to the Vertex Separation problem. Comput. Oper. Res. 52: 209-219 (2014) - [j5]Vicente Campos, Rafael Martí
GRASP with path relinking for the orienteering problem. J. Oper. Res. Soc. 65(12): 1800-1813 (2014) - 2013
- [j4]Jesús Sánchez-Oro
Radar-based road-traffic monitoring in urban environments. Digit. Signal Process. 23(1): 364-374 (2013) - [c3]Jesús Sánchez-Oro, Soto Montalvo, Antonio S. Montemayor, Juan José Pantrigo, Abraham Duarte, Víctor Fresno, Raquel Martínez-Unanue:
URJC&UNED at ImageCLEF 2013 Photo Annotation Task. CLEF (Working Notes) 2013 - [c2]Jesús Sánchez-Oro
Urban Traffic Surveillance in Smart Cities Using Radar Images. IWINAC (2) 2013: 296-305 - 2012
- [j3]Abraham Duarte
Variable neighborhood search for the Vertex Separation Problem. Comput. Oper. Res. 39(12): 3247-3255 (2012) - [j2]Jesús Sánchez-Oro
An experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problems. Electron. Notes Discret. Math. 39: 59-66 (2012) - [j1]Jesús Sánchez-Oro, Abraham Duarte:
GRASP with Path Relinking for the SumCut Problem. Int. J. Comb. Optim. Probl. Informatics 3(1): 3-11 (2012) - [c1]Jesús Sánchez-Oro, Soto Montalvo, Antonio S. Montemayor, Raúl Cabido, Juan José Pantrigo, Abraham Duarte, Víctor Fresno, Raquel Martínez-Unanue:
URJCyUNED at ImageCLEF 2012 Photo Annotation Task. CLEF (Online Working Notes/Labs/Workshop) 2012
Coauthor Index
aka: Ana Dolores López-Sánchez
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: