The p-hub center allocation problem

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 give...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2007-01, Vol.176 (2), p.819-835
Main Authors: Campbell, Ann Melissa, Lowe, Timothy J., Zhang, Li
Format: Article
Language:English
Subjects:
Allocations
Applied sciences
Complexity theory
Exact sciences and technology
Hub location
Network hubs
Networks
Operational research. Management science
Operations research
Problem solving
Studies
System theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2005.09.024