Fifty years of research in Networks coincides with 50 years of advances in resilience theory
and applications. The purpose of this review is to identify how these two technical …

Given a graph with nonnegative edge weights and node pairs Q, we study the problem of
constructing a minimum weight set of edges so that the induced subgraph contains at least K …

The aim of this paper is to propose a model for the design of a robust rapid transit network. In
this paper, a network is said to be robust when the effect of disruption on total trip coverage …

This article deals with the Two‐edge connected Hop‐constrained Network Design Problem
(or THNDP for short). Given a weighted graph G=(N, E), an integer L≥ 2, and a subset of …

In this paper, we study the k edge-connected L-hop-constrained network design problem.
Given a weighted graph G=(V, E), a set D of pairs of nodes, two integers L≥ 2 and k≥ 2, the …

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 …

In this article, we study the k‐edge‐connected L‐hop‐constrained network design problem.
Given a weighted graph, a set D of pairs of nodes, two integers and, the problem consists in …

Given a graph G with two distinguished nodes s and t, a cost on each edge of G and two
fixed integers k≥ 2, L≥ 2, the k edge-disjoint L-hop-constrained paths problem is to find a …

We study survivable network design problems with edge-connectivity requirements under a
two-stage stochastic model with recourse and finitely many scenarios. For the formulation in …