The p-hub center allocation problem

Ann Melissa Campbell; Timothy J. Lowe; Li Zhang

doi:10.1016/j.ejor.2005.09.024

Back

Journal article

Peer reviewed

The p-hub center allocation problem

Ann Melissa Campbell, Timothy J. Lowe and Li Zhang

European journal of operational research, Vol.176(2), pp.819-835

01/16/2007

DOI: 10.1016/j.ejor.2005.09.024

View Online

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.

Complexity theory

Hub location

Networks

Details

Title: Subtitle: The p-hub center allocation problem
Creators: Ann Melissa Campbell - University of Iowa
Timothy J. Lowe - Pennsylvania State University
Li Zhang - Citadel
Resource Type: Journal article
Publication Details: European journal of operational research, Vol.176(2), pp.819-835
Publisher: Elsevier B.V
DOI: 10.1016/j.ejor.2005.09.024
ISSN: 0377-2217
eISSN: 1872-6860
Language: English
Date published: 01/16/2007
Academic Unit: Business Analytics
Record Identifier: 9984380521802771

Metrics

13 Record Views

42 Times Cited - Web of Science