An efficient procedure for designing single allocation hub and spoke systems
Management Science
An Exact Solution Approach Based on Shortest-Paths for P-Hub Median Problems
INFORMS Journal on Computing
A branch and cut algorithm for hub location problems with single assignment
Mathematical Programming: Series A and B
Solving the hub location problem in a star–star network
Networks - Special Issue In Memory of Stefano Pallottino
Star p-hub median problem with modular arc capacities
Computers and Operations Research
Uncapacitated single and multiple allocation p-hub center problems
Computers and Operations Research
Hub location for time definite transportation
Computers and Operations Research
Tight bounds from a path based formulation for the tree of hub location problem
Computers and Operations Research
A 2-phase algorithm for solving the single allocation p-hub center problem
Computers and Operations Research
Computers and Industrial Engineering
| Hi-index | 0.01 |
We consider two problems that arise in designing two-level star networks taking into account service quality considerations. Given a set of nodes with pairwise traffic demand and a central hub, we select p hubs and connect them to the central hub with direct links and then we connect each nonhub node to a hub. This results in a star/star network. In the first problem, called the Star p-hub Center Problem, we would like to minimize the length of the longest path in the resulting network. In the second problem, Star p-hub Median Problem with Bounded Path Lengths, the aim is to minimize the total routing cost subject to upper bound constraints on the path lengths. We propose formulations for these problems and report the outcomes of a computational study where we compare the performances of our formulations.