![The p-hub center allocation problem [An article from: European Journal of Operational Research]](https://www.ebooknetworking.net/books/B00/0PA/bigB000PAUS4S.jpg)
The p-hub center allocation problem [An article from: European Journal of Operational Research]
Book Details
Author(s)A.M. Campbell, T.J. Lowe, L. Zhang
PublisherElsevier
ISBN / ASINB000PAUS4S
ISBN-13978B000PAUS40
AvailabilityAvailable for download now
MarketplaceUnited States 🇺🇸
Description
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2007. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
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.
Description:
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.
