A quadratic integer program for the location of interacting hub facilities (Q1092794)

This paper reports a new formulation of a general hub location model as a quadratic integer program. Non-convexity of the objective function makes the problem difficult. A variety of alternative solution strategies are discussed. Computational results from two simple heuristics are presented for the task of siting 2, 3 or 4 hubs to serve interactions between sets of 10, 15, 20 and 25 U.S. cities. The effects of different computational shortcuts are examined.