Now showing items 1-2 of 2
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 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 ...