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

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 …

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

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 …

In network design problems, such as compact routing, the goal is to route packets between
nodes using the (approximated) shortest paths. A desirable property of these routes is a …

Network design problems aim to compute low-cost structures such as routes, trees and
subgraphs. Often, it is natural and desirable to require that these structures have small hop …

The Steiner tree problem with revenues, budget and hop constraints is a variant of the
Steiner tree problem with two main modifications:(a) besides the costs associated with arcs …

The network design problem with relays (NDPR) is defined on an undirected graph G=(V, E,
K), where V={1,…, n} is a vertex set, E={(i, j): i, j∈ V, i< j} is an edge set. The set K={(o (k), d …

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 …