The p-hub center allocation problem

The p-hub center allocation problem

0.00 Avg rating0 Votes
Article ID: iaor20084284
Country: Netherlands
Volume: 176
Issue: 2
Start Page Number: 819
End Page Number: 835
Publication Date: Jan 2007
Journal: European Journal of Operational Research
Authors: , ,
Keywords: networks
Abstract:

The p-hub center problem is to locate p hubs and to allocate non-hub nodes to hub nodes such that the maximum travel time (or distance) between any origin–destination pair is minimized. We address the p-hub center allocation problem, a subproblem of the location problem, where hub locations are given. We present complexity results and IP formulations for several versions of the problem. We establish that some special cases are polynomially solvable.

Reviews

Required fields are marked *. Your email address will not be published.