Now showing items 1-2 of 2
Solving the hub location problem with modular link capacities
This paper deals with a capacitated hub location problem arising in the design of telecommunications networks. The problem is different from the classical hub location problem in two ways: the cost of using an edge is not ...
A branch and cut algorithm for hub location problems with single assignment
The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. ...