A graph is said to be two connected if between every pair of nodes there are at least two
node-disjoint paths. Given weights on the edges of the graph, the two connected subgraph …

In this paper we consider the two-edge-connected subgraph problem with disjunctive
constraints. We investigate the convex hull of the solutions to this problem. We describe …

This paper approaches the problem of designing a two-level network protected against
single-edge failures. The problem simultaneously decides on the partition of the set of nodes …

This paper deals with a variant of the traveling salesman problem (TSP), called the multiple
Steiner TSP with order constraints. This consists, given an undirected graph with …

In this paper, we consider the survivable network design problem when the connectivity
types are in {0, 1, 2, 3}. The problem has wide applications in telecommunication networks …

This article considers the problem of designing a two‐level network where the upper level
consists of a backbone ring network connecting the so‐called hub nodes, and the lower …

The motivation behind this study is the essential need for survivability in the
telecommunications networks. An optical signal should find its destination even if the …

Given a graph $ G $, we study the $2 $-edge-connected subgraph polytope $\mathrm
{TECSP}(G) $, which is given by the convex hull of the incidence vectors of all $2 $-edge …

This thesis deals with a problem related to survivability issues in multilayer IP-over-WDM
networks. Given a set of traffic demands for which we know a survivable logical routing in the …

In this paper, we address a variant of the Two Edge Connected Problem (TECP), that is the
TECP with color constraint on the edges, also known as the Labeled Two Edge Connected …