An important problem in network survivability assessment is the identification of critical
nodes. The distance-based critical node detection problem addresses the issues of internal …

Extending the concept of time-space networks, layered graphs associate information about
one or multiple resource state values with nodes and arcs. While integer programming …

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 Integer Linear Programming models and develop branch-and-cut
algorithms to solve the Black-and-White Traveling Salesman Problem (BWTSP)(Bourgeois …

In this paper, we address a hop-constrained node survivable network design problem that is
defined in the context of multi-protocol label switching (MPLS) over wavelength division …

This paper addresses the multicommodity capacitated fixed-charge network design problem
with nonbifurcated flows and hop constraints. We present and compare mathematical …

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 …

In this article, we consider the two 4‐hop‐constrained paths problem, which consists, given
a graph G=(N, E) and two nodes s, t∈ N, of finding a minimum cost subgraph in G …

Abstract The aim of Network Design Problem with Vulnerability Constraints (NDPVC), is to
design survivable telecommunications networks that impose length bounds on the …