## Single-allocation hub location problems with capacity choices

• In this paper, an extension to the classical capacitated single-allocation hub location problem is studied in which the size of the hubs is part of the decision making process. For each potential hub a set of capacities is assumed to be available among which one can be chosen. Several formulations are proposed for the problem, which are compared in terms of the bound provided by the linear programming relaxation. Di®erent sets of inequalities are proposed to enhance the models. Several preprocessing tests are also presented with the goal of reducing the size of the models for each particular instance. The results of the computational experiments performed using the proposed models are reported.

### Weitere Dienste

Verfasserangaben: I. Correia, S. Nickel, F. Saldanha-da-Gama urn:nbn:de:hbz:386-kluedo-16225 Berichte des Fraunhofer-Instituts für Techno- und Wirtschaftsmathematik (ITWM Report) (169) Bericht Englisch 2009 2009 Fraunhofer-Institut für Techno- und Wirtschaftsmathematik 16.10.2009 Capacity decisions ; Hub Location ; MILP formulations Fraunhofer (ITWM) 5 Naturwissenschaften und Mathematik / 510 Mathematik Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011

$Rev: 13581$