Decomposition approaches for a capacitated hub problem

Abstract

In this work we address a capacitated hub problem arising from a Telecommunications application. In this problem we must choose the routes and the hubs to use in order to send a set of commodities from sources to destinations in a given capacitated network with a minimum cost. The capacities and costs of the arcs and hubs are given, and the graph connecting the hubs is not assumed to be complete. We present a mixed integer linear programming formulation and describe three different decomposition techniques to get better performances than simply using a direct general solver on the model. These approaches can be applied to deal with more general problems in Network Design. © Springer-Verlag Berlin Heidelberg 2004.