On the single-assignment p-hub center problem
European Journal of Operational Research
648 - 655
Item Usage Stats
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.
Central processing unit time
Single assignment hub center problem