Now showing items 11-14 of 14
A tabu-search based heuristic for the hub covering problem over incomplete hub networks
Hub location problems deal with finding the location of hub facilities and with the allocation of demand nodes to these located hub facilities. In this paper, we study the single allocation hub covering problem over ...
On the single-assignment p-hub center problem
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 ...
The design of single allocation incomplete hub networks
The hub location problem deals with finding the location of hub facilities and allocating the demand nodes to these hub facilities so as to effectively route the demand between any origin-destination pair. In the extensive ...
The single-assignment hub covering problem: models and linearizations
(Palgrave Macmillan Ltd., 2003)
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 ...