On worst-case aggregation analysis for network location problems
Annals of Operations Research - Special issue on locational decisions
A p-center grid-positioning aggregation procedure
Computers and Operations Research - Special issue on aggregation and disaggregation in operations research
An Exact Solution Approach Based on Shortest-Paths for P-Hub Median Problems
INFORMS Journal on Computing
Aggregation Error Bounds for a Class of Location Models
Operations Research
Adapting polyhedral properties from facility to hub location problems
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Uncapacitated single and multiple allocation p-hub center problems
Computers and Operations Research
A 2-phase algorithm for solving the single allocation p-hub center problem
Computers and Operations Research
A 2-phase algorithm for solving the single allocation p-hub center problem
Computers and Operations Research
LTL logistics networks with differentiated services
Computers and Operations Research
Choosing point-to-point versus hub-and-spoke flights: a genetic algorithmic approach
Proceedings of the 2012 Symposium on Emerging Applications of M&S in Industry and Academia Symposium
Computers and Industrial Engineering
| Hi-index | 0.01 |
Because of their widespread use in real-world transportation situations, hub location models have been extensively studied in the last two decades. Many types of hub location problems are NP-hard and remain unmanageable when the number of nodes exceeds 200. We present a way to tackle large-sized problems using aggregation, explore the resulting error, and show how to reduce it. Furthermore, we develop a heuristic based on aggregation for k-hub center problems and present computational results.