Efficient algorithms for the capacitated concentrator location problem
Computers and Operations Research
An efficient procedure for designing single allocation hub and spoke systems
Management Science
An Exact Solution Approach Based on Shortest-Paths for P-Hub Median Problems
INFORMS Journal on Computing
A branch and cut algorithm for hub location problems with single assignment
Mathematical Programming: Series A and B
Adapting polyhedral properties from facility to hub location problems
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Solving the hub location problem with modular link capacities
Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities
SIAM Journal on Discrete Mathematics
Solving the hub location problem in a star–star network
Networks - Special Issue In Memory of Stefano Pallottino
Star p-hub center problem and star p-hub median problem with bounded path lengths
Computers and Operations Research
Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity Levels
Transportation Science
Computers and Industrial Engineering
| Hi-index | 0.01 |
We consider the hub location problem, where p hubs are chosen from a given set of nodes, each nonhub node is connected to exactly one hub and each hub is connected to a central hub. Links are installed on the arcs of the resulting network to route the traffic. The aim is to find the hub locations and the connections to minimize the link installation cost. We propose two formulations and a heuristic algorithm to solve this problem. The heuristic is based on Lagrangian relaxation and local search. We present computational results where formulations are compared and the quality of the heuristic solutions are tested.