The three-hub center allocation problem

Authors:
Li Zhang
Affiliations:
The Citadel, Charleston, SC
Venue:
Proceedings of the 47th Annual Southeast Regional Conference
Year:
2009

Citing 2
Cited 0

Accumulation point location on tree networks for guaranteed time distribution

Management Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a hub network, the p-hub center single allocation problem is to allocate each non-hub node to one and only one hub from a given set of p hubs such that the maximum travel time (or distance) between any origin-destination pair is minimized. The problem is NP-Complete in general. We address the three-hub center single allocation problem in this paper and provide a polynomial algorithm to solve the p-hub center single allocation problem when p = 3.