Solving large single allocation p-hub problems with two or three hubs
- 1 January 2001
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 128 (2), 447-458
- https://doi.org/10.1016/s0377-2217(99)00370-7
Abstract
No abstract availableThis publication has 26 references indexed in Scilit:
- The capacitated multiple allocation hub location problem: Formulations and algorithmsEuropean Journal of Operational Research, 2000
- Efficient solution procedure and reduced size formulations for p-hub location problemsEuropean Journal of Operational Research, 1998
- A linear program for the two-hub location problemEuropean Journal of Operational Research, 1997
- Tight linear programming relaxations of uncapacitated p-hub median problemsEuropean Journal of Operational Research, 1996
- Avoiding local optima in thep-hub location problem using tabu search and GRASPAnnals of Operations Research, 1992
- Location and allocation for distribution systems with transshipments and transportion economies of scaleAnnals of Operations Research, 1992
- Hub facility location with fixed costsPapers in Regional Science, 1992
- A quadratic integer program for the location of interacting hub facilitiesEuropean Journal of Operational Research, 1987
- Activity Levels at Hub Facilities in Interacting NetworksGeographical Analysis, 1986
- An algorithm for the quadratic assignment problem using Bender's decompositionEuropean Journal of Operational Research, 1978