Kara, B. Y.Tansel, B. Ç.2016-02-082016-02-0820000377-2217http://hdl.handle.net/11693/24997We 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.EnglishCombinatorial mathematicsLinear programmingLinearizationMathematical modelsCentral processing unit timeHub locationSingle assignment hub center problemComputational complexityArticle10.1016/S0377-2217(99)00274-X