For the past few decades, combinatorial optimization techniques have been shown to be
powerful tools for formulating and solving optimization problems arising from practical …

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 …

We consider the “flow on paths” versions of Max Flow and Min Cut when we restrict to paths
having at most B arcs, and for versions where we allow fractional solutions or require …

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

The k edge-disjoint 2-hop-constrained paths problem consists in finding a minimum cost
subgraph such that between two given nodes s and t there exist at least k edge-disjoint …

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 …