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 …

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 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 …

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 …

The hop‐constrained survivable network design problem consists of finding a minimum cost
subgraph containing K edge‐disjoint paths with length at most H joining each pair of vertices …

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 …

This chapter analyzes optimal attack-tolerant network design and augmentation strategies
for bounded-diameter networks. In the definitions of attack tolerance used in this chapter, we …