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
BUIR Usage Stats
3
views
views
12
downloads
downloads
Citation Stats
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.
Source Title
European Journal of Operational Research
Publisher
Elsevier
Course
Other identifiers
Book Title
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Language
English