The p-hub center allocation problem

  title={The p-hub center allocation problem},
  author={Ann Melissa Campbell and Timothy J. Lowe and Xiang Lin},
  journal={European Journal of Operational Research},
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. 2005 Elsevier B.V. All rights reserved. 

From This Paper

Figures, tables, and topics from this paper.
14 Citations
26 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 14 extracted citations


Publications referenced by this paper.
Showing 1-10 of 26 references

The p-hub center allocation problem and the q-discount arc problem

  • L. Zhang
  • Ph.D. thesis, The University of Iowa, Iowa City…
  • 2004
Highly Influential
7 Excerpts

Integer programming formulations of discrete hub location problems

  • J. F. Campbell
  • European Journal of Operational Research 72
  • 1994
Highly Influential
10 Excerpts

Accumulation point location on tree networks for guaranteed time distribution

  • A. V. Iyer, H. D. Ratliff
  • Management Science 36 (8)
  • 1990
Highly Influential
6 Excerpts

Algorithms for solving the conditional covering problem on paths

  • B. J. Lunday, J. C. Smith, J. B. Goldberg
  • Naval Research Logistics 52 (4)
  • 2005
1 Excerpt

Polynomial algorithms in linear programming

  • L. G. Khachian
  • USSR Computational Mathematics and Mathematical…
  • 2005
1 Excerpt

Facility Location: Applications and Theory

  • J. F. Campbell, A. Ernst, M. Krishnamoorthy
  • Springer-Verlag
  • 2002
2 Excerpts

Similar Papers

Loading similar papers…