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 …

The colored de Bruijn graph (cdbg) and its variants have become an important combinatorial
structure used in numerous areas in genomics, such as population-level variation detection …

We use variable redefinition (see R. Martin, 1987. Generating Alternative Mixed-Integer
Programming Models Using Variable Redefinition, Operations Research 35, 820–831) to …

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

We present a new Lagrangean relaxation for the hop-constrained minimum spanning tree
problem (HMST). The HMST is NP-hard and models the design of centralized …

Given a set of customers, a set of potential facility locations, and some interconnection
nodes, the goal of the connected facility location problem (ConFL) is to find the minimum …

To meet customer demand, delivery companies are offering an increasing number of time‐
definite services. In this article, we examine the strategic design of delivery networks which …

We consider the problem of constructing a Steiner arborescence broadcasting a signal from
a root r to a set T of sinks in a metric space, with out-degrees of Steiner vertices restricted to …

Given an undirected network with positive edge costs and a natural number p, the Hop-
Constrained Minimum Spanning Tree problem (HMST) is the problem of finding a spanning …

We present a layered graph model for delay-constrained minimum tree problems with a
polynomial number of constraints which can be solved well for instances with low-to medium …