Supercomputing power is one of the fundamental pillars of the digital society, which
depends on the accurate scheduling of parallel applications in High-Performance …

The vertex bisection problem splits a graph G=(V, E) into two sets, L⊆ V,| L|=⌊| V|/2⌋ and
R= V∖ L, such that it minimizes the number of vertices in L connected to R. This problem is a …

In this chapter we propose a new class of cellular algorithms. There exists a variety of
cellular algorithm approaches but most of them do not structure the search process. In this …

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 …

Supercomputing power is one of the fundamental pillars of the digital society, which
depends on the accurate scheduling of parallel applications in High-Performance …

In this paper, the NP-hard problem of minimizing power consumption in wireless
communications systems is approached. In the literature, several metaheuristic approaches …

In this paper the linear ordering problem with cumulative costs (LOPCC) is approached.
Currently, a tabu search and a GRASP with evolutionary path-relinking have been proposed …

En este trabajo de investigación se aborda el problema de disenar estrategias eficientes de
búsqueda local para el problema del SUMCUT. El SUMCUT es un problema NP-duro que …