This paper presents the Tree of Hubs Location Problem. It is a network hub location problem
with single assignment where a fixed number of hubs have to be located, with the …

In this paper we compare the linear programming relaxations of undirected and directed
multicommodity flow formulations for the terminal layout problem with hop constraints. Hop …

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 …

This article comprises the first theoretical and computational study on mixed integer
programming (MIP) models for the connected facility location problem (ConFL). ConFL …

We formulate and computationally test several models for the Diameter‐Constrained
Minimum Spanning and Steiner Tree Problems, which seek a least‐cost spanning or Steiner …

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

The Steiner tree problem in graphs is to determine a minimum cost subgraph of a
givengraph spanning a set of specified vertices. In certain telecommunication networks …

In this paper we compare the linear programming (LP) relaxations of several old and new
formulations for the asymmetric travelling salesman problem (ATSP). The main result of this …

Abstract The Miller–Tucker–Zemlin (MTZ) Subtour Elimination Constraints (SECs) and the
improved version by Desrochers and Laporte (DL) have been and are still in regular use to …

Abstract Affinely Adjustable Robust Counterparts provide tractable alternatives to (two‐
stage) robust programs with arbitrary recourse. Following Ouorou and Vial, we apply them to …