Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Software—Practice & Experience - Special issue on discrete algorithm engineering
Heuristic concentration for the p-median: an example demonstrating how and why it works
Computers and Operations Research
Topological Design of Two-Level Telecommunication Networks with Modular Switches
Operations Research
On the Design Problem of Multitechnology Networks
INFORMS Journal on Computing
A branch and cut algorithm for hub location problems with single assignment
Mathematical Programming: Series A and B
Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity Levels
Transportation Science
Hi-index | 0.00 |
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 linear but stepwise and the capacity of a hub restricts the amount of traffic transiting through the hub rather than the incoming traffic. In this paper both an exact and a heuristic method are presented. They are compared and combined in a heuristic concentration approach to investigate whether it is possible to improve the results within limited computational times.