Abstract Graph Layout Problems refer to a family of optimization problems where the aim is
to assign the vertices of an input graph to the vertices of a structured host graph, optimizing a …

Graph layout problems are a family of combinatorial optimization problems that consist of
finding an embedding of the vertices of an input graph into a host graph such that an …

In this paper, we tackle the Cyclic Bandwidth Sum Problem, consisting in minimizing the sum
of the bandwidth of the edges of an input graph computed in a cycle-structured host graph …

The iterated greedy metaheuristic generates a sequence of solutions by iterating over a
constructive heuristic using destruction and construction phases. In the last few years, it has …

Search trajectory networks (STNs) were proposed as a tool to analyze the behavior of
metaheuristics in relation to their exploration ability and the search space regions they …

Multi-armed bandit (MAB) is a well-known reinforcement learning algorithm that has shown
outstanding performance for recommendation systems and other areas. On the other hand …

The quality of the solutions to a combinatorial optimization problem is usually measured
using a mathematical function, named objective function. This function is also used to guide …

The cyclic bandwidth sum problem (CBSP) consists in embedding a host graph into a cycle
graph while minimizing the sum of cyclic distances between guest adjacent vertices …

Multi-armed bandit (MAB) is a well-known reinforcement learning algorithm that has shown
great performance for recommendation systems and other areas. The results presented in …