Abraham Duarte

Soc. Netw. Anal. Min., December, 2024

An efficient and effective GRASP algorithm for the Budget Influence Maximization Problem.

[BibT_eX]

[DOI]

J. Ambient Intell. Humaniz. Comput., March, 2024

Order batching problems: Taxonomy and literature review.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., February, 2024

A Practical Methodology for Reproducible Experimentation: An Application to the Double-Row Facility Layout Problem.

[BibT_eX]

[DOI]

Evol. Comput., 2024

Multi-objective general variable neighborhood search for software maintainability optimization.

[BibT_eX]

[DOI]

Eng. Appl. Artif. Intell., 2024

General Variable Neighborhood Search for the optimization of software quality.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2024

Optimization of Fairness and Accuracy on Logistic Regression Models.

[BibT_eX]

[DOI]

Proceedings of the Metaheuristics - 15th International Conference, 2024

A Basic Variable Neighborhood Search for the Planar Obnoxious Facility Location Problem.

[BibT_eX]

[DOI]

Sérgio Salazar

Proceedings of the Metaheuristics - 15th International Conference, 2024

A Biased Random Key Genetic Algorithm for Solving the α-Neighbor p-Center Problem.

[BibT_eX]

[DOI]

Proceedings of the Metaheuristics - 15th International Conference, 2024

An Efficient Algorithm for the T-Row Facility Layout Problem.

[BibT_eX]

[DOI]

Alberto Herrán

Proceedings of the Metaheuristics - 15th International Conference, 2024

What Characteristics Define a Good Solution in Social Influence Minimization Problems?

[BibT_eX]

[DOI]

Proceedings of the Metaheuristics - 15th International Conference, 2024

Improving Biased Random Key Genetic Algorithm with Variable Neighborhood Search for the Weighted Total Domination Problem.

[BibT_eX]

[DOI]

Proceedings of the Metaheuristics - 15th International Conference, 2024

2023

A general variable neighborhood search approach for the minimum load coloring problem.

[BibT_eX]

[DOI]

Optim. Lett., December, 2023

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

[BibT_eX]

[DOI]

Soft Comput., June, 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

Efficient iterated greedy for the two-dimensional bandwidth minimization problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2023

2022

On solving the order processing in picking workstations.

[BibT_eX]

[DOI]

Abdessamad Ouzidan

Marc Sevaux

Alexandru-Liviu Olteanu

Optim. Lett., 2022

A variable neighborhood search approach for cyclic bandwidth sum problem.

[BibT_eX]

[DOI]

Eduardo Rodriguez-Tello

Knowl. Based Syst., 2022

An efficient heuristic algorithm for software module clustering optimization.

[BibT_eX]

[DOI]

J. Syst. Softw., 2022

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

[BibT_eX]

[DOI]

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

Max-min dispersion with capacity and cost for a practical location problem.

[BibT_eX]

[DOI]

Expert Syst. Appl., 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 general variable neighborhood search for the cyclic antibandwidth problem.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2022

Multi-objective Variable Neighborhood Search for Improving Software Modularity.

[BibT_eX]

[DOI]

Proceedings of the Variable Neighborhood Search - 9th International Conference, 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]

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

Variable Neighborhood Descent for Software Quality Optimization.

[BibT_eX]

[DOI]

Proceedings of the Metaheuristics - 14th International Conference, 2022

A Scatter Search Approach for the Parallel Row Ordering Problem.

[BibT_eX]

[DOI]

José Manuel Colmenar

Proceedings of the Metaheuristics - 14th International Conference, 2022

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

[BibT_eX]

[DOI]

Ana Dolores López-Sánchez

Anna Martínez-Gavara

Miguel Ángel Rodríguez-García

Proceedings of the Metaheuristics - 14th International Conference, 2022

2021

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

[BibT_eX]

[DOI]

Eduardo Rodriguez-Tello

Éric Monfroy

Knowl. Based Syst., 2021

An improved GRASP method for the multiple row equal facility layout problem.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2021

An efficient variable neighborhood search for the Space-Free Multi-Row Facility Layout problem.

[BibT_eX]

[DOI]

Alberto Herrán

Eur. J. Oper. Res., 2021

Multistart search for the Cyclic Cutwidth Minimization Problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2021

A heuristic approach for the online order batching problem with multiple pickers.

[BibT_eX]

[DOI]

Comput. Ind. Eng., 2021

Solving the regenerator location problem with an iterated greedy approach.

[BibT_eX]

[DOI]

Juan David Quintana

Appl. Soft Comput., 2021

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

[BibT_eX]

[DOI]

Antonio González-Pardo

Appl. Soft Comput., 2021

BVNS Approach for the Order Processing in Parallel Picking Workstations.

[BibT_eX]

[DOI]

Abdessamad Ouzidan

Marc Sevaux

Alexandru-Liviu Olteanu

Iván Martín de San Lázaro

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

Finding Critical Nodes in Networks Using Variable Neighborhood Search.

[BibT_eX]

[DOI]

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

Influence of the Alternative Objective Functions in the Optimization of the Cyclic Cutwidth Minimization Problem.

[BibT_eX]

[DOI]

Proceedings of the Advances in Artificial Intelligence, 2021

2020

Fixed versus variable time window warehousing strategies in real time.

[BibT_eX]

[DOI]

Prog. Artif. Intell., 2020

An efficient metaheuristic for the K-page crossing number minimization problem.

[BibT_eX]

[DOI]

Alberto Herran

Knowl. Based Syst., 2020

GRASP with Variable NCaminoseighborhood Descent for the online order batching problem.

[BibT_eX]

[DOI]

J. Glob. Optim., 2020

Solving the edge-disjoint paths problem using a two-stage method.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2020

A parallel variable neighborhood search approach for the obnoxious p-median problem.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2020

Basic variable neighborhood search for the minimum sitting arrangement problem.

[BibT_eX]

[DOI]

Antonio García-Sánchez

Marc Sevaux

J. Heuristics, 2020

Special issue on recent innovations in variable neighborhood search.

[BibT_eX]

[DOI]

J. Heuristics, 2020

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

[BibT_eX]

[DOI]

Expert Syst. J. Knowl. Eng., 2020

2019

A variable neighborhood search approach for the vertex bisection problem.

[BibT_eX]

[DOI]

Alberto Herran

Inf. Sci., 2019

Alternative evaluation functions for the cyclic bandwidth sum problem.

[BibT_eX]

[DOI]

Eduardo Rodriguez-Tello

Frédéric Lardeux

Valentina Narvaez-Teran

Eur. J. Oper. Res., 2019

A Variable Neighborhood Search approach for the Hamiltonian p-median problem.

[BibT_eX]

[DOI]

Alberto Herran

Appl. Soft Comput., 2019

Basic VNS for a Variant of the Online Order Batching Problem.

[BibT_eX]

[DOI]

Proceedings of the Variable Neighborhood Search - 7th International Conference, 2019

2018

Diversity and Equity Models.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Heuristics., 2018

Linear Layout Problems.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Heuristics., 2018

Variable Neighborhood Descent.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Heuristics., 2018

Scatter search for the bi-criteria p-median p-dispersion problem.

[BibT_eX]

[DOI]

Prog. Artif. Intell., 2018

Multi-objective memetic optimization for the bi-objective obnoxious <i>p</i>-median problem.

[BibT_eX]

[DOI]

José Manuel Colmenar

Knowl. Based Syst., 2018

Iterated Greedy algorithm for performing community detection in social networks.

[BibT_eX]

[DOI]

Future Gener. Comput. Syst., 2018

Heuristics for the Bi-Objective Diversity Problem.

[BibT_eX]

[DOI]

José Manuel Colmenar

Miguel Ángel Rodríguez-García

Expert Syst. Appl., 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

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

New VNS Variants for the Online Order Batching Problem.

[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

General Variable Neighborhood Search for the Order Batching and Sequencing Problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

Variable neighborhood descent for the incremental graph drawing.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Variable Neighborhood Search strategies for the Order Batching Problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2017

Special issue on Variable neighborhood search methods in business and engineering.

[BibT_eX]

[DOI]

Nenad Mladenovic

Bassem Jarboui

Comput. Oper. Res., 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

GRASP with path relinking for the single row facility layout problem.

[BibT_eX]

[DOI]

Knowl. Based Syst., 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

Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 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

Tabu search for the Max-Mean Dispersion Problem.

[BibT_eX]

[DOI]

Knowl. Based Syst., 2015

Multi-objective variable neighborhood search: an application to combinatorial optimization problems.

[BibT_eX]

[DOI]

J. Glob. Optim., 2015

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

[BibT_eX]

[DOI]

Fred W. Glover

Inf. Sci., 2015

Multiobjective GRASP with Path Relinking.

[BibT_eX]

[DOI]

Vicente Campos

Eur. J. Oper. Res., 2015

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

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

General Variable Neighborhood Search applied to the picking process in a warehouse.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

VNS variants for the Max-Mean Dispersion Problem.

[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 ejection chains for the dynamic memory allocation in embedded systems.

[BibT_eX]

[DOI]

Soft Comput., 2014

GRASP with path relinking for the orienteering problem.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2014

A black-box scatter search for optimization problems with integer variables.

[BibT_eX]

[DOI]

J. Glob. Optim., 2014

Improved heuristics for the regenerator location problem.

[BibT_eX]

[DOI]

Ricardo M. A. Silva

Int. Trans. Oper. Res., 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

Low-Level Hybridization of Scatter Search and Particle Filter for Dynamic TSP Solving.

[BibT_eX]

[DOI]

Proceedings of the Metaheuristics for Dynamic Optimization, 2013

Designing effective improvement methods for scatter search: an experimental study on global optimization.

[BibT_eX]

[DOI]

Soft Comput., 2013

A hybrid metaheuristic for the cyclic antibandwidth problem.

[BibT_eX]

[DOI]

Knowl. Based Syst., 2013

Tabu search with strategic oscillation for the maximally diverse grouping problem.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2013

Heuristics and metaheuristics for the maximum diversity problem.

[BibT_eX]

[DOI]

J. Heuristics, 2013

Branch and bound for the cutwidth minimization problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2013

Variable Formulation Search for the Cutwidth Minimization Problem.

[BibT_eX]

[DOI]

Appl. Soft Comput., 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

Mejorando el acceso, el análisis y la visibilidad de la Información y los contenidos Multilingues y Multimedia en Red para la Comunidad de Madrid.

[BibT_eX]

[DOI]

Felisa Verdejo

Raquel Martínez-Unanue

Pablo Castells

Antonio Moreno-Sandoval

Víctor Fresno-Fernández

Proces. del Leng. Natural, 2012

GRASP with Path Relinking for the SumCut Problem.

[BibT_eX]

[DOI]

Int. J. Comb. Optim. Probl. Informatics, 2012

Variable neighborhood search with ejection chains for the antibandwidth problem.

[BibT_eX]

[DOI]

J. Heuristics, 2012

Metaheuristics for the linear ordering problem with cumulative costs.

[BibT_eX]

[DOI]

Ada M. Alvarez

Francisco Ángel-Bello

Eur. J. Oper. Res., 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

A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2012

Variable neighborhood search for the Vertex Separation Problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2012

A benchmark library and a comparison of heuristic methods for the linear ordering problem.

[BibT_eX]

[DOI]

Gerhard Reinelt

Comput. Optim. Appl., 2012

Scatter search for the cutwidth minimization problem.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2012

URJCyUNED at ImageCLEF 2012 Photo Annotation Task.

[BibT_eX]

[DOI]

Soto Montalvo

Raquel Martínez-Unanue

Proceedings of the CLEF 2012 Evaluation Labs and Workshop, 2012

2011

Path relinking for large-scale global optimization.

[BibT_eX]

[DOI]

Soft Comput., 2011

GRASP with path relinking heuristics for the antibandwidth problem.

[BibT_eX]

[DOI]

Ricardo M. A. Silva

Networks, 2011

Scatter Search and Path Relinking : A Tutorial on the Linear Arrangement Problem.

[BibT_eX]

[DOI]

Int. J. Swarm Intell. Res., 2011

Pseudo-Cut Strategies for Global Optimization.

[BibT_eX]

[DOI]

Int. J. Appl. Metaheuristic Comput., 2011

Tabu search for the linear ordering problem with cumulative costs.

[BibT_eX]

[DOI]

Manuel Laguna

Comput. Optim. Appl., 2011

Hybrid scatter tabu search for unconstrained global optimization.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2011

2010

Heuristics for the bandwidth colouring problem.

[BibT_eX]

[DOI]

Int. J. Metaheuristics, 2010

A branch and bound algorithm for the maximum diversity problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2010

GRASP and path relinking for the max-min diversity problem.

[BibT_eX]

[DOI]

Héctor Joaquín Fraire Huacuja

Comput. Oper. Res., 2010

Adaptive memory programming for constrained global optimization.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2010

Black box scatter search for general classes of binary optimization problems.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2010

Improving Iterated Local Search Solution for the Linear Ordering Problem with Cumulative Costs (LOPCC).

[BibT_eX]

[DOI]

David Terán Villanueva

Juan Martín Carpio Valadez

Rodolfo A. Pazos Rangel

Héctor José Puga Soberanes

Proceedings of the Knowledge-Based and Intelligent Information and Engineering Systems, 2010

GRASP for Instance Selection in Medical Data Sets.

[BibT_eX]

[DOI]

Proceedings of the Advances in Bioinformatics, 2010

2009

Advanced Scatter Search for the Max-Cut Problem.

[BibT_eX]

[DOI]

Manuel Laguna

INFORMS J. Comput., 2009

Heuristics for the bi-objective path dissimilarity problem.

[BibT_eX]

[DOI]

José Luis González Velarde

Comput. Oper. Res., 2009

Hybridizing the cross-entropy method: An application to the max-cut problem.

[BibT_eX]

[DOI]

Manuel Laguna

Comput. Oper. Res., 2009

Hybrid heuristics for the maximum diversity problem.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2009

An Adaptive Memory Procedure for Continuous Optimization.

[BibT_eX]

[DOI]

Fred W. Glover

Proceedings of the Ninth International Conference on Intelligent Systems Design and Applications, 2009

2008

Multi-dimensional visual tracking using scatter search particle filter.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 2008

2007

Tabu search and GRASP for the maximum diversity problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2007

Agile Commitments: A MDE Approach for Language Engineering.

[BibT_eX]

Proceedings of the ENASE 2007, 2007

Representing Languages in UML - A UML Profile for Language Engineering.

[BibT_eX]

Proceedings of the ENASE 2007, 2007

2006

Improving image segmentation quality through effective region merging using a hierarchical social metaheuristic.

[BibT_eX]

[DOI]

Miguel Ángel Sánchez Vidales

Pattern Recognit. Lett., 2006

2005

A low-level hybridization between memetic algorithm and VNS for the max-cut problem.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2005

Scatter Search Particle Filter to Solve the Dynamic Travelling Salesman Problem.

[BibT_eX]

[DOI]

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2005

Region Merging for Severe Oversegmented Images Using a Hierarchical Social Metaheuristic.

[BibT_eX]

[DOI]

Proceedings of the Applications of Evolutionary Computing, 2005

2004

Path Relinking Particle Filter for Human Body Pose Estimation.

[BibT_eX]

[DOI]

Proceedings of the Structural, 2004

Top-Down Evolutionary Image Segmentation Using a Hierarchical Social Metaheuristic.

[BibT_eX]

[DOI]

Proceedings of the Applications of Evolutionary Computing, 2004

A Hierarchical Social Metaheuristic for the Max-Cut Problem.

[BibT_eX]

[DOI]