Solving the uncapacitated hub location problem using genetic algorithms
From MaRDI portal
Publication:707014
DOI10.1016/j.cor.2003.09.008zbMath1071.90025MaRDI QIDQ707014
Publication date: 9 February 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2003.09.008
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Heuristics for the p-hub location problem
- A quadratic integer program for the location of interacting hub facilities
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Integer programming formulations of discrete hub location problems
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Solving large single allocation \(p\)-hub problems with two or three hubs
- A hybrid heuristic for the uncapacitated hub location problem
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Neural versus traditional approaches to the location of interacting hub facilities
- Hub Location and the p-Hub Median Problem
- Lower Bounds for the Hub Location Problem