Preprocessing and cutting for multiple allocation hub location problems

European Journal of Operational Research

Volumn 155, Issue 3, 2004, Pages 638-653

  Boland, Natashia ^a   Krishnamoorthy, Mohan ^b   Ernst, Andreas T ^b   Ebery, Jamie ^c  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b CSIRO   (Australia)

^c MONASH UNIVERSITY   (Australia)

Author keywords

Hub location; Integer programming; Location

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; CONSTRAINT THEORY; COSTS; DECISION MAKING; INTEGER PROGRAMMING; LOCATION;

HUB LOCATION PROBLEMS; MIXED INTEGER LINEAR PROGRAMMING (MILP);

OPERATIONS RESEARCH;

EID: 0742301554     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(03)00072-9     Document Type: Conference Paper

References (20)

1. Aardal K. Reformulation of capacitated facility location problems: How redundant information can help. Annals of Operations Research. 82:1998;289-308.
2. T. Aykin, Networking policies for hub-and-spoke systems with application to the air transportation system. Working paper, Rutgers Graduate School of Management, New Ark, NJ, 1993.
3. Beasley J.E. Or-library: Distributing test problems by electronic mail. Journal of the Operational Research Society. 41(11):1990;1069-1072.
4. Campbell J.F. Integer programming formulations of discrete hub location problems. European Journal of Operational Research. 72:1994;387-405.
5. Campbell J.F. Hub location and the. p -hub median problem Operations Research. 44(6):1996;923-935.
6. CPLEX Optimisation Inc., 930 Tahoc Blvd., Bldg 802, Incline Valley, NV 89451-9436, USA. Using the CPLEX callable library (version 6.0), 1998.
7. Ebery J. Solving large single allocation. p -hub problems with two or three hubs European Journal of Operational Research. 128:2001;447-458.
8. Ebery J., Krishnamoorthy M., Ernst A.T., Boland N. The capacitated multiple allocation hub location problem: Formulations and algorithms. European Journal of Operational Research. 120(3):2000;614-631.
9. Ernst A.T., Krislmamoorthy M. Efficient algorithms for the uncapacitated single allocation. p -hub median problem Location Science. 4:1996;139-154.
10. Ernst A.T., Krishnamoorthy M. Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. European Journal of Operational Research. 104(1):1998;100-112.
11. Ernst A.T., Krishnamoorthy M. An exact solution approach based on shortest-paths for. p -hub median problems INFORMS Journal on Computing. 10(2):1998;149-162.
12. Ernst Andreas T., Krishnamoorthy M. Solution algorithms for the capacitated single allocation hub location problem. Annals of Operations Research. 86:1999;141-159.
13. Johnson E.L., Crowder H., Padberg M. Solving large-scale zero-one linear programming problems. Operations Research. 31:1983;803-834.
14. J.G. Klincewicz, Dual algorithms for the uncapacitatcd hub location problem and the p -hub median problem, AT&T Bell Laboratories. Holmdel, NJ 07733, 1994.
15. Mayer G., Wagner B. Hublocater: An exact solution method for the multiple allocation hub location problem. Computers and Operations Research. 29(6):2002;717-739.
16. Nemhauser G.L., Savelsbergh M.W.P., Sigismondi G.S. Minto, a mixed integer optimizer. Operations Research Letters. 15:1994;47-58.
17. Nemhauser G.L., Wolsey L.A. Integer and Combinatorial Optimization. 1988;John Wiley and Sons, New York.
18. O'Kelly M. A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research. 32:1987;393-404.
19. Van Roy T.J., Wolsey L.A. Solving mixed integer programming using automatic reformulation. Operations Research. 35:1987;45-57.
20. Skorin-Kapov D., Skorin-Kapov J., O'kelly M. Tight linear programming relaxations of uncapacitated. p -hub median problems European Journal of Operational Research. 94:1996;582-593.