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 …

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 …

Abstract The Cyclic Bandwidth Problem is an important graph labeling problem with
numerous applications. This work aims to advance the state-of-the-art of practically solving …

Abstract Traveling Salesman Problem (TSP) adalah masalah optimasi kombinatorial klasik
dan memiliki peran dalam perencanaan, penjadwalan, dan pencarian pada bidang …

The cyclic bandwidth problem (CBP) was initially introduced in the context of designing ring
interconnection networks and has a number of other relevant applications, such as the …

Given an optimization problem, combining knowledge from both (i) structural or algorithmic
known results and (ii) new solving techniques, helps gain insight and knowledge on the …

A graph consists of a finite set of vertices and edges. Graphs are used to represent a
significant number of real life applications. For example, in computer science, graphs are …

In this note, we consider the antibandwidth problem, also known as dual bandwidth
problem, separation problem and maximum differential coloring problem. Given a labeled …

The bandwidth problem seeks for a simultaneous permutation of the rows and columns of
the adjacency matrix of a graph such that all nonzero entries are as close as possible to the …

Graph labeling problems have been widely studied in the last decades and have a vast area
of application. In this work, we study the recently introduced S-labeling problem, in which the …