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 …

In this chapter we present a general framework for modeling the hopconstrained minimum
spanning tree problem (HMST) which includes formulations already presented in the …

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 …

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 …

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 …

In this chapter we contextualize, in terms of the ATSP, a recent compact formulation
presented in Godinho et al [11] for the time-dependent traveling salesman problem (TDTSP) …

Long-term planning of backbone telephone networks has been an important area of
application of combinatorial optimization over the last few years. In this chapter, we review …

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 …