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 …

The hop-constrained minimum spanning tree problem (HMSTP) is an NP-hard problem
arising in the design of centralized telecommunication networks with quality of service …

Hub location problems involve locating hub facilities and allocating demand nodes to hubs
in order to provide service between origin–destination pairs. In this study, we focus on cargo …

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

In this paper we discuss valid inequalities for the directed hop-constrained shortest path
problem. We give complete linear characterizations of the hop-constrained path polytope …

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

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 …