On the single-assignment p-hub center problem

Date
2000
Authors
Kara, B. Y.
Tansel, B. Ç.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
European Journal of Operational Research
Print ISSN
0377-2217
Electronic ISSN
Publisher
Elsevier
Volume
125
Issue
3
Pages
648 - 655
Language
English
Journal Title
Journal ISSN
Volume Title
Series
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.

Course
Other identifiers
Book Title
Citation
Published Version (Please cite this version)