Now showing items 1-2 of 2
Polyhedral analysis for the uncapacitated hub location problem with modular arc capacities
(Society for Industrial and Applied Mathematics, 2005)
We consider the problem of installing a two-level telecommunication network. Terminal nodes communicate with each other through hubs. Hubs can be installed on terminal nodes and they are interconnected by a complete network. ...
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. ...