Variable Neighborhood Search for precedence-constrained tasks optimization on heterogeneous systems
AHG Ruiz, AAS Pineda, JAC Rocha, SI Martínez… - Expert Systems with …, 2024 - Elsevier
Supercomputing power is one of the fundamental pillars of the digital society, which
depends on the accurate scheduling of parallel applications in High-Performance …
depends on the accurate scheduling of parallel applications in High-Performance …
Grasp and iterated local search-based cellular processing algorithm for precedence-constraint task list scheduling on heterogeneous systems
High-Performance Computing systems rely on the software's capability to be highly
parallelized in individual computing tasks. However, even with a high parallelization level …
parallelized in individual computing tasks. However, even with a high parallelization level …
Cellular Processing Algorithm for Time-Dependent Traveling Salesman Problem
EA Oviedo-Salas, JD Terán-Villanueva… - Data Analytics and …, 2023 - Springer
This research addresses the Time-Dependent Traveling Salesman Problem to minimize
travel time; this is an NP-hard optimization problem. We propose three Cellular Processing …
travel time; this is an NP-hard optimization problem. We propose three Cellular Processing …
Two novel branch and bound algorithms for the vertex bisection problem
In this paper, we address the exact solution of the vertex bisection problem (VBP). We
propose two novel B&B algorithms to solve VBP, which include new upper and lower bound …
propose two novel B&B algorithms to solve VBP, which include new upper and lower bound …
Variable Neighborhood Search for precedence-constrained tasks optimization on heterogeneous systems
AH García Ruiz, AA Santiago Pineda… - 2024 - dl.acm.org
Supercomputing power is one of the fundamental pillars of the digital society, which
depends on the accurate scheduling of parallel applications in High-Performance …
depends on the accurate scheduling of parallel applications in High-Performance …
Clustering driven iterated hybrid search for vertex bisection minimization
The Vertex Bisection Minimization Problem (VBMP) is a relevant graph partitioning model
with a variety of practical applications. This work introduces a clustering driven iterated …
with a variety of practical applications. This work introduces a clustering driven iterated …
Constructive heuristic for the vertex bisection problem
N Castillo-García… - Journal of applied …, 2020 - scielo.org.mx
The Vertex Bisection Problem (VBP) consists in partitioning a generic graph into two equally-
sized subgraphs A and B such that the number of vertices in A with at least one adjacent …
sized subgraphs A and B such that the number of vertices in A with at least one adjacent …