In contrast to p-hub problems with a summation objective (p-hub median), minmax hub problems (p-hub center) have not attained much attention in the literature. In this paper, we give a polyhedral analysis of the uncapacitated single allocation p-hub center problem (USApHCP). The analysis will be based on a radius formulation which currently yields the most efficient solution procedures. We show...

In this paper, we consider the design of large-scale multiple allocation hub-and-spoke transportation networks in a competitive environment. We adopt a generic hub arc location model that locates arcs with discounted transport costs connecting pairs of hub facilities. Two firms compete for customers in a Stackelberg framework where the leader firm locates hub arcs to maximize its revenue, given...