1

¿Cómo obtener soluciones heurísticas buenas? Caso de estudio en problemas de minimización de la influencia en redes sociales.
La evolución de las redes sociales ha introducido importantes retos relacionados con la sobrecarga de información. Estos retos abarcan …
PDF Cite Slides
A Basic Variable Neighborhood Search for the Planar Obnoxious Facility Location Problem
Obnoxious facility location problems are devoted to choose the best location for a given set of facilities considering that, despite …
Cite Slides DOI
A Biased Random Key Genetic Algorithm for Solving the α-Neighbor p-Center Problem
In this paper, a Biased Random Key Genetic Algorithm is proposed to solve the alpha-neighbor p-center problem. A decoder and a local …
Cite Slides DOI
A Path Relinking-Based Approach for the Bi-Objective Double Floor Corridor Allocation Problem
The Bi-Objective Double Floor Corridor Allocation Problem is one of the most recent incorporation to the family of Facility Layout …
PDF Cite Slides DOI
A Variable Formulation Search Approach for Three Graph Layout Problems
This paper studies the relationship between three linear layout problems: minimum linear arrangement, cutwidth minimization, and …
Cite DOI
A Variable Neighborhood Search Approach for the S-labeling Problem
The S-labeling problem is a graph layout problem that assigns numeric labels to the vertices of a graph. It aims to minimize the sum of …
Cite Slides DOI
An Efficient Algorithm for the T-Row Facility Layout Problem
Facility layout problems represent a challenge to the operations research community. These problems are closely related to real-world …
Cite Slides DOI
Evaluación automática de código mediante la plataforma educativa Iudex
En el contexto de la modernización educativa y la creciente adopción de aprendizaje a distancia, surge la necesidad de mejorar las …
Cite URL
Exploring the Integration of General Variable Neighborhood Search with Exact Procedures for the Optimization of the Order Batching Problem
This paper studies the influence of combining exact algorithms with heuristic procedures for the optimization of the Order Batching …
Cite DOI
Improving Biased Random Key Genetic Algorithm with Variable Neighborhood Search for the Weighted Total Domination Problem
The Weighted Total Domination Problem (WTDP) belongs to the family of dominating set problems. Given a weighted graph, the WTDP …
Cite DOI