An Efficient Procedure for Designing Single Allocation Hub and Spoke Systems

References

• Aykin T. Lagrangean relaxation approaches to the capacitated hub and spoke network design problem. Eur. J. Oper. Res. (1994) 79 501 523 Crossref, Google Scholar
• Aykin T. Networking policies for hub and spoke systems with application to the air transportation system. Transportation Sci. (1995) 29 201 222 Link, Google Scholar
• Bazaraa M. S. , Goode J. J. A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality. Eur. J. Oper. Res. (1979) 3 322 328 Crossref, Google Scholar
• Campbell J. F. Hub location and the p-hub median problem. Oper. Res. (1996) 44 923 935 Link, Google Scholar
• Campbell J. F. A survey of network hub location. (1994) . Paper presented at ORSA Detroit, Michigan, October. Operations Research Society of America, Linthicum, MD Google Scholar
• Ernst A. T. , Krishnamoorthy M. Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Sci. (1996) 4 139 154 Crossref, Google Scholar
• Fisher M. L. The Lagrangian relaxation method for solving integer programming problems. Management Sci. (1981) 27 1 18 Link, Google Scholar
• Galvao R. D. The use of Lagrangian relaxation in the solution of uncapacitated facility location problems. Location Sci. (1993) 1 57 79 Google Scholar
• Klincewicz J. G. Heuristics for the p-hub location problem. Eur. J. Oper. Res. (1991) 53 25 37 Crossref, Google Scholar
• Klincewicz J. G. Avoiding local optima in the p-hub location problem using tabu search and GRASP. Ann. Oper. Res. (1992) 40 283 302 Crossref, Google Scholar
• Mirchandani P. B. , Oudjit A. , Wong R. T. Multidimensional extensions and a nested dual approach for the m-median problem. Eur. J. Oper. Res. (1985) 21 121 137 Crossref, Google Scholar
• Narula S. C. , Ogbu U. I. , Samuelsson H. M. An algorithm for the p-median problem. Oper. Res. (1977) 25 709 713 Link, Google Scholar
• O'Kelly M. E. The location of interacting hub facilities. Transportation Sci. (1986) 20 92 106 Link, Google Scholar
• O'Kelly M. E. A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. (1987) 32 393 404 Crossref, Google Scholar
• O'Kelly M. E. , Bryan D. , Skorin-Kapov D. , Skorin-Kapov J. Hub network design with single and multiple allocation: A computational study. Location Sci. (1996) 4 125 138 Crossref, Google Scholar
• O'Kelly M. E. , Miller H. J. The hub network design problem: A review and synthesis. J. Transport Geography (1994) 2 31 40 Crossref, Google Scholar
• O'Kelly M. E. , Skorin-Kapov D. , Skorin-Kapov J. Lower bounds for the hub location problem. Management Sci. (1995) 41 713 721 Link, Google Scholar
• Pirkul H. , Schilling D. The siting of emergency service facilities with workload capacities and backup service. Management Sci. (1988) 34 896 908 Link, Google Scholar
• Pirkul H. , Schilling D. The maximal covering location problem with capacities on total workload. Management Sci. (1991) 37 233 248 Link, Google Scholar
• Sherali H. D. , Myers D. C. Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed integer programs. Discrete Appl. Math. (1988) 20 51 68 Crossref, Google Scholar
• Skorin-Kapov D. , Skorin-Kapov J. On tabu search for the location of interacting hub facilities. Eur. J. Oper. Res. (1994) 73 501 508 Crossref, Google Scholar
• Skorin-Kapov D. , Skorin-Kapov J. , O'Kelly M. E. Tight linear programming relaxations of uncapacitated p-hub median problems. Eur. J. Oper. Res. (1996) 94 582 593 Crossref, Google Scholar