Jesús Sánchez-Oro

Knowl. Based Syst., October, 2023

A reactive path relinking algorithm for solving the bi-objective p-Median and p-Dispersion problem.

[BibT_eX]

[DOI]

Soft Comput., June, 2023

An iterated greedy algorithm for finding the minimum dominating set in graphs.

[BibT_eX]

[DOI]

Math. Comput. Simul., May, 2023

Variable neighborhood search approach with intensified shake for monitor placement.

[BibT_eX]

[DOI]

Networks, April, 2023

A quick GRASP-based method for influence maximization in social networks.

[BibT_eX]

[DOI]

J. Ambient Intell. Humaniz. Comput., 2023

2022

A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem.

[BibT_eX]

[DOI]

J. Manuel Colmenar

Optim. Lett., 2022

Strategic oscillation for the balanced minimum sum-of-squares clustering problem.

[BibT_eX]

[DOI]

Raúl Martín-Santamaría

Inf. Sci., 2022

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

[BibT_eX]

[DOI]

J. Heuristics, 2022

GRASP with strategic oscillation for the α-neighbor p-center problem.

[BibT_eX]

[DOI]

Alfredo García Hernández-Díaz

A. D. López-Sánchez

Eur. J. Oper. Res., 2022

A review on discrete diversity and dispersion maximization from an OR perspective.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2022

BVNS for Overlapping Community Detection.

[BibT_eX]

[DOI]

Antonio González-Pardo

Proceedings of the Variable Neighborhood Search - 9th International Conference, 2022

Multi-Round Influence Maximization: A Variable Neighborhood Search Approach.

[BibT_eX]

[DOI]

Isaac Lozano-Osorio

Proceedings of the Variable Neighborhood Search - 9th International Conference, 2022

A Metaheuristic Approach for Solving Monitor Placement Problem.

[BibT_eX]

[DOI]

Proceedings of the Variable Neighborhood Search - 9th International Conference, 2022

An Efficient Fixed Set Search for the Covering Location with Interconnected Facilities Problem.

[BibT_eX]

[DOI]

Isaac Lozano-Osorio

Anna Martínez-Gavara

Proceedings of the Metaheuristics - 14th International Conference, 2022

A Fast Metaheuristic for Finding the Minimum Dominating Set in Graphs.

[BibT_eX]

[DOI]

Alejandra Casado

Sergio Bermudo

Proceedings of the Metaheuristics - 14th International Conference, 2022

2021

The capacitated dispersion problem: an optimization model and a memetic algorithm.

[BibT_eX]

[DOI]

Rafael Martí

Anna Martínez-Gavara

Miguel Ángel Rodríguez-García

Memetic Comput., 2021

Two-dimensional bandwidth minimization problem: Exact and heuristic approaches.

[BibT_eX]

[DOI]

Eduardo Rodriguez-Tello

Éric Monfroy

Knowl. Based Syst., 2021

A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location.

[BibT_eX]

[DOI]

A. D. López-Sánchez

Manuel Laguna

INFORMS J. Comput., 2021

Solving the regenerator location problem with an iterated greedy approach.

[BibT_eX]

[DOI]

Juan David Quintana

Raúl Martín-Santamaría

Appl. Soft Comput., 2021

A fast variable neighborhood search approach for multi-objective community detection.

[BibT_eX]

[DOI]

Antonio González-Pardo

Iván Martín de San Lázaro

Appl. Soft Comput., 2021

Finding Critical Nodes in Networks Using Variable Neighborhood Search.

[BibT_eX]

[DOI]

Proceedings of the Variable Neighborhood Search - 8th International Conference, 2021

2020

Preface to the special issue on optimization in vehicle routing and logistics.

[BibT_eX]

[DOI]

Daniele Vigo

Networks, 2020

A general variable neighborhood search for solving the multi-objective open vehicle routing problem.

[BibT_eX]

[DOI]

J. Manuel Colmenar

J. Heuristics, 2020

Iterated greedy with variable neighborhood search for a multiobjective waste collection problem.

[BibT_eX]

[DOI]

Laura Delgado-Antequera

Expert Syst. Appl., 2020

Finding weaknesses in networks using Greedy Randomized Adaptive Search Procedure and Path Relinking.

[BibT_eX]

[DOI]

Expert Syst. J. Knowl. Eng., 2020

2019

GRASP and VNS for solving the <i>p</i>-next center problem.

[BibT_eX]

[DOI]

Alfredo García Hernández-Díaz

Comput. Oper. Res., 2019

2018

Variable Neighborhood Descent.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Heuristics., 2018

Iterated Greedy algorithm for performing community detection in social networks.

[BibT_eX]

[DOI]

Miguel Ángel Rodríguez-García

Future Gener. Comput. Syst., 2018

Tabu search for the dynamic Bipartite Drawing Problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2018

GRASP with Path Relinking for 2D-Bandwidth Minimization Problem.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Learning and Optimization Algorithms: Theory and Applications, 2018

A Metaheuristic Approach for the \alpha α -separator Problem.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Data Engineering and Automated Learning - IDEAL 2018, 2018

How to Locate Disperse Obnoxious Facility Centers?

[BibT_eX]

[DOI]

J. Manuel Colmenar

Enrique García-Galán

Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018

Finding Balanced Bicliques in Bipartite Graphs Using Variable Neighborhood Search.

[BibT_eX]

[DOI]

Juan David Quintana

Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018

Detecting Weak Points in Networks Using Variable Neighborhood Search.

[BibT_eX]

[DOI]

Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018

2017

General Variable Neighborhood Search for computing graph separators.

[BibT_eX]

[DOI]

Nenad Mladenovic

Optim. Lett., 2017

Parallel variable neighborhood search for the min-max order batching problem.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2017

Variable neighborhood descent for the incremental graph drawing.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Variable neighborhood scatter search for the incremental graph drawing problem.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2017

Improving the performance of embedded systems with variable neighborhood search.

[BibT_eX]

[DOI]

Appl. Soft Comput., 2017

2016

Parallel strategic oscillation: an application to the maximum leaf spanning tree problem.

[BibT_eX]

[DOI]

Prog. Artif. Intell., 2016

Scatter search for the bandpass problem.

[BibT_eX]

[DOI]

J. Glob. Optim., 2016

Efficient Greedy Randomized Adaptive Search Procedure for the Generalized Regenerator Location Problem.

[BibT_eX]

[DOI]

Juan David Quintana

Int. J. Comput. Intell. Syst., 2016

Estimating the Spanish Energy Demand Using Variable Neighborhood Search.

[BibT_eX]

[DOI]

Sancho Salcedo-Sanz

Proceedings of the Advances in Artificial Intelligence, 2016

2015

Scatter search for the profile minimization problem.

[BibT_eX]

[DOI]

Networks, 2015

Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization.

[BibT_eX]

[DOI]

Mauricio G. C. Resende

Fred W. Glover

Rafael Martí

Inf. Sci., 2015

Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Beyond Unfeasibility: Strategic Oscillation for the Maximum Leaf Spanning Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the Advances in Artificial Intelligence, 2015

2014

GRASP with path relinking for the orienteering problem.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2014

Combining intensification and diversification strategies in VNS. An application to the Vertex Separation problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2014

Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2014

2013

Radar-based road-traffic monitoring in urban environments.

[BibT_eX]

[DOI]

David Fernández-López

Raúl Cabido

Digit. Signal Process., 2013

Urban Traffic Surveillance in Smart Cities Using Radar Images.

[BibT_eX]

[DOI]

David Fernández-López

Raúl Cabido

Proceedings of the Natural and Artificial Computation in Engineering and Medical Applications, 2013

URJC&UNED at ImageCLEF 2013 Photo Annotation Task.

[BibT_eX]

[DOI]

Soto Montalvo

Víctor Fresno

Raquel Martínez-Unanue

Proceedings of the Working Notes for CLEF 2013 Conference , 2013

2012

GRASP with Path Relinking for the SumCut Problem.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2012

Variable neighborhood search for the Vertex Separation Problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2012

URJCyUNED at ImageCLEF 2012 Photo Annotation Task.

[BibT_eX]

[DOI]

Soto Montalvo