A highly efficient exact algorithm for the uncapacitated multiple allocation p-hub center problem

This paper addresses the problem of uncapacitated multiple allocation p-hub center problem (UMApHCP) which is fundamental in proper functioning of time-sensitive transportation systems. A mixed-integer programming formulation is proposed for the problem and a highly efficient Benders decomposition algorithm is developed for solving it.