On the single-assignment p-hub center problem
Date
2000Source Title
European Journal of Operational Research
Print ISSN
0377-2217
Publisher
Elsevier
Volume
125
Issue
3
Pages
648 - 655
Language
English
Type
ArticleItem Usage Stats
120
views
views
504
downloads
downloads
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 mathematicsLinear programming
Linearization
Mathematical models
Central processing unit time
Hub location
Single assignment hub center problem
Computational complexity