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 …

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 …

Wireless sensor and actor networks (WSANs) usually operate in harsh environment and
thus become susceptible to breakage in connectivity due to the failure of one or multiple …

The cutwidth minimization problem consists of finding a linear arrangement of the vertices of
a graph where the maximum number of cuts between the edges of the graph and a line …

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 …

Vertex Bisection Minimization problem (VBMP) consists of partitioning a vertex set V of
graph G=(V, E) into two sets B and B′ where∣ B∣= such that vertex width (VW) is …

We present Birkhoff Extension (BE), an almost-everywhere-differentiable continuous
polytime-computable extension of any real-valued function on permutations to doubly …

A very useful tool when designing linear programs for optimization problems is the
formulation of logical operations by linear programming constraints. We give efficient linear …