Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
482418 | European Journal of Operational Research | 2007 | 17 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Ann Melissa Campbell, Timothy J. Lowe, Li Zhang,