The single-assignment hub covering problem: models and linearizations
Author
Kara, B. Y.
Tansel, B. C.
Date
2003Source Title
Journal of the Operational Research Society
Print ISSN
0160-5682
Electronic ISSN
1476-9360
Publisher
Palgrave Macmillan Ltd.
Volume
54
Issue
1
Pages
59 - 64
Language
English
Type
ArticleItem Usage Stats
217
views
views
545
downloads
downloads
Abstract
We study the hub covering problem which, so far, has remained one of the unstudied hub location problems in the
literature. We give a combinatorial and a new integer programming formulation of the hub covering problem that is
different from earlier integer programming formulations. Both new and old formulations are nonlinear binary integer
programs. We give three linearizations for the old model and one linearization for the new one and test their
computational performances based on 80 instances of the CAB data set. Computational results indicate that the linear
version of the new model performs significantly better than the most successful linearization of the old model both in
terms of average and maximum CPU times as well as in core storage requirements.
Keywords
Combinatorial problemsHub cover
Hub location
Integer programming
Location
Combinatorial mathematics
Integer programming
Linearization
Mathematical models
Hub covering problem
Hub location
Operations research