On the single-assignment p-hub center problem

Thumbnail
Author
Kara, B. Y.
Tansel, B. Ç.
Date
2000
Source Title
European Journal of Operational Research
Print ISSN
0377-2217
Publisher
Elsevier
Volume
125
Issue
3
Pages
648 - 655
Language
English
Type
Article
Item Usage Stats
58
views
64
downloads
Metadata
Show full item record
Abstract
We study the computational aspects of the single-assignment p-hub center problem on the basis of a basic model and a new model. The new model's performance is substantially better in CPU time than different linearizations of the basic model. We also prove the NP-Hardness of the problem.
Keywords
Combinatorial mathematics
Linear programming
Linearization
Mathematical models
Central processing unit time
Hub location
Single assignment hub center problem
Computational complexity
Permalink
http://hdl.handle.net/11693/24997
Published Version (Please cite this version)
http://dx.doi.org/10.1016/S0377-2217(99)00274-X
Collections