The p-hub center allocation problem |
| |
| Authors: | Ann Melissa Campbell Timothy J. Lowe Li Zhang |
| |
| Affiliation: | 1. Department of Management Sciences, University of Iowa, Iowa City, IA 52242-1994, United States;2. Department of Supply Chain and Information Systems, Pennsylvania State University, University Park, PA 16802, United States;3. Department of Mathematics and Computer Science, The Citadel, Charleston, SC 29409, United States |
| |
| 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. |
| |
| Keywords: | Hub location Networks Complexity theory |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
