1

A Fast Metaheuristic for Finding the Minimum Dominating Set in Graphs
Finding minimum dominating sets in graphs is a problem that has been widely studied in the literature. However, due to the increase in …
Cite DOI
A Scatter Search Approach for the Parallel Row Ordering Problem
In this work, we present a new approach for the Parallel Row Ordering Problem (PROP), based on the Scatter Search metaheuristic. The …
Cite DOI
An Efficient Fixed Set Search for the Covering Location with Interconnected Facilities Problem
This paper studies the Coverage Location Problem with Interconnected Facilities (CPIF). It belongs to the family of Facility Location …
Cite DOI
Variable Neighborhood Descent for Software Quality Optimization
In the Software Development Life-Cycle, the maintenance phase is often the most costly stage due to the efforts devoted to …
Cite DOI
Multi-Round Influence Maximization: A Variable Neighborhood Search Approach
El estudio de la influencia de las redes sociales ha despertado el interés de los científicos. La gran variedad de aplicaciones reales …
PDF Cite
Nuevos algoritmos metaheurísticos para el análisis de la influencia de los usuarios en las redes sociales
La evolución y la difusión de las redes sociales han atraído el interés de la comunidad científica en los últimos años. En concreto, …
Cite
BVNS Approach for the Order Processing in Parallel Picking Workstations
The Order Processing in Parallel Picking Workstations is an optimization problem that can be found in the industry and is related to …
Cite DOI
Designing modern heuristic algorithms to solve the Transmission Expansion Planning problem
Transmission Expansion Planning (TEP) aims at identifying a list of new assets to be installed on the transmission grid to meet the …
Cite DOI
Finding Critical Nodes in Networks Using Variable Neighborhood Search
Several problems related to networks are based on the identification of certain nodes which can be relevant for different tasks: …
Cite DOI
Influence of the Alternative Objective Functions in the Optimization of the Cyclic Cutwidth Minimization Problem
The quality of the solutions to a combinatorial optimization problem is usually measured using a mathematical function, named objective …
Cite DOI