Now showing items 1-6 of 6
Allocation Strategies in Hub Networks
In this paper, we study allocation strategies and their effects on total routing costs in hub networks. Given a set of nodes with pairwise traffic demands, the p-hub median problem is the problem of choosing p nodes as hub ...
Hub location under competition
Hubs are consolidation and dissemination points in many-to-many flow networks. Hub location problem is to locate hubs among available nodes and allocate non-hub nodes to these hubs. The mainstream hub location studies ...
A hub covering network design problem for cargo applications in Turkey
(Palgrave Macmillan, 2009)
Hub location problems involve locating hub facilities and allocating demand nodes to hubs in order to provide service between origin-destination pairs. In this study, we focus on cargo applications of the hub location ...
A capacitated hub location problem under hose demand uncertainty
In this study, we consider a capacitated multiple allocation hub location problem with hose demand uncertainty. Since the routing cost is a function of demand and capacity constraints are imposed on hubs, demand uncertainty ...
Routing and scheduling decisions in the hierarchical hub location problem
Hubs are facilities that consolidate and disseminate flow in many-to-many distribution systems. The hub location problem considers decisions that include the locations of hubs in a network and the allocations of demand ...
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 ...