The Hop-Constrained Minimum Spanning Tree Problem (HMSTP) is a NP-hard problem arising in the design of centralized telecommunication networks with quality of service constraints. We show that the… (More)

The Diameter-Constrained Minimum Spanning Tree Problem seeks a least cost spanning tree subject to a (diameter) bound imposed on the number of edges in the tree between any node pair. A traditional… (More)

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 when the maximum… (More)

-We present several node-oriented formulations for a Hop Constrained Minimal Spanning Tree (HMST) problem. These formulations are based on the well known Miller-Tucker-Zemlin [1] subtour elimination… (More)

The Rooted Distance-Constrained Minimum Spanning Tree Problem (RDMSTP) is defined as follows: given a graph G = (V,E) with node set V = {0,1,...,n} and edge set E, two integer weights, a cost ce and… (More)

The Minimum Arborescence problem (MAP) consists of finding a minimum cost arborescence in a directed graph. This problem is NP-Hard and is a generalization of two well-known problems: the Minimum… (More)

We address the one-to-one multi-commodity pickup and delivery traveling salesman problem (m-PDTSP) which is a generalization of the TSP and arises in several transportation and logistics… (More)