Many optimization problems are formulated as min–max problems where the objective
function consist of minimizing a maximum value. In this case, it is usual that many solutions …

Variable neighbourhood search (VNS) and all its variants have been successfully proved in
hard combinatorial optimization problems. However, there are only few works concerning …

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 …

Given a linear ordering of the vertices of a graph, the cutwidth of a vertex v with respect to
this ordering is the number of edges from any vertex before v (including v) to any vertex after …

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 …

Abstract The Cyclic Cutwidth Minimization Problem (CCMP) is a Graph Layout Problem that
consists of finding an embedding of the vertices of a candidate graph in a host graph, in …

In this paper, we present a new set of constraints for modeling linear ordering problems on
graphs using Integer Linear Programming (ILP). These constraints express the membership …

The cutwidth minimization problem (CMP) consists in determining a linear layout (ie, a one-
dimensional arrangement), of the vertices of a graph that minimizes the maximum number of …

Abstract Vertex Bisection Minimization problem (VBMP) consists of partitioning the vertex set
V of a graph G=(V, E) into two sets B and B′ where\left| B\right|\,=\left ⌊| V|/2\right ⌋ B=| V|/2 …

Background Genome sequences and genome annotation data have become available at
ever increasing rates in response to the rapid progress in sequencing technologies. As a …