Benders Decomposition for Hub Location Problems with Economies of Scale
Published Online:10 Jun 2008https://doi.org/10.1287/trsc.1080.0233
References
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem. Eur. J. Oper. Res. (1994) 79:501–523Crossref, Google Scholar
- Network policies for hub-and-spoke systems with applications to the air transportation system. Transportation Sci. (1995) 29(3):201–221Link, Google Scholar
- Partitioning procedures for solving mixed-variables programming problems. Numerisch Mathematik (1962) 4:238–252Crossref, Google Scholar
- A multicut algorithm for two-stage stochastic linear programs. Eur. J. Oper. Res. (1988) 34:384–392Crossref, Google Scholar
- Preprocessing and cutting for multiple allocation hub location problem. Eur. J. Oper. Res. (2004) 155:638–653Crossref, Google Scholar
- Solving large nonconvex water resources management models using generalized Benders decompositon. Oper. Res. (2001) 49(2):235–245Link, Google Scholar
- Benders decomposition for the uncapacitated multiple allocation hub location problem. Comput. Oper. Res. (2008) 35(4):1047–1064Crossref, Google Scholar
- Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. (1994a) 72:387–405Crossref, Google Scholar
- A survey of network hub location. Stud. Locational Anal. (1994b) 6:31–49Google Scholar
- Hub location and the p-hub median problem. OPRE (1996) 44(6):923–935Link, Google Scholar
- , Hamacher H., Drezner Z. Hub location problems. Location Theory: Applications and Theory (2001) 1st ed.(Springer, New York) 373–407Google Scholar
- A Benders decomposition approach for the locomotive and car assignment problem. Transportation Sci. (2000) 34(2):133–149Link, Google Scholar
- Simultaneous assignment of locomotives and cars to passenger trains. Oper. Res. (2001) 49(4):531–548Link, Google Scholar
- The capacitated multiple allocation hub location problema: Formulations and algorithms. Eur. J. Oper. Res. (2000) 120:614–631Crossref, Google Scholar
- Hub-and-spoke network design with congestion. Comput. Oper. Res. (2005) 32(6):1615–1632Crossref, Google Scholar
- Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Sci. (1996) 4(3):139–154Crossref, Google Scholar
- Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. Eur. J. Oper. Res. (1998a) 104:100–112Crossref, Google Scholar
- An exact solution approach based on shortest-paths for p-hub median problems. INFORMS J. Comput. (1998b) 10(2):149–162Link, Google Scholar
- Solution algorithms for the capacitated single allocation hub location problem. Ann. Oper. Res. (1999) 86:141–159Crossref, Google Scholar
- Solving stochastic transportation-location problem by generalized Benders decomposition. Transportation Sci. (1982) 16(2):113–126Link, Google Scholar
- Multicomodity distribution system design by Benders decomposition. Management Sci. (1974) 20(5):822–844Link, Google Scholar
- Optimum distribution of switching centres in a communication network and some related graph theoretic problems. Oper. Res. (1965) 13(3):462–475Link, Google Scholar
- Adapting polyhedral properties from facility to hub location problems. Discrete Appl. Math. (2004) 145:104–116Crossref, Google Scholar
- Optimal solution of cellular manufacturing system design: Benders decomposition approach. Eur. J. Oper. Res. (1998) 107:175–192Crossref, Google Scholar
- Heuristics for the p-hub location problem. Eur. J. Oper. Res. (1991) 53:25–37Crossref, Google Scholar
- A dual algorithm for the uncapacitated hub location problem. Location Sci. (1996) 4(3):173–184Crossref, Google Scholar
- Hub location in backbone/tributary network design: A review. Location Sci. (1998) 6(1):307–335Crossref, Google Scholar
- Enumeration and search procedures for a hub location problem with economies of scale. Ann. Oper. Res. (2002) 110:107–122Crossref, Google Scholar
- Tailoring Benders decomposition for uncapacitated network design. Math. Programming Stud. (1986) 26:112–154Crossref, Google Scholar
- New formulations for the uncapacitated multiple allocation hub location problem. Eur. J. Oper. Res. (2006) 172:274–292Crossref, Google Scholar
- Hublocator: An exact solution method for the multiple allocation hub location problem. Comput. Oper. Res. (2002) 29(6):715–739Crossref, Google Scholar
- The location of interacting hub facilities. Transportation Sci. (1986) 20(1):92–106Link, Google Scholar
- A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. (1987) 32:393–404Crossref, Google Scholar
- Hub location with flow economies of scale. Transportation Res. Part B (1998) 32(8):605–616Crossref, Google Scholar
- The hub network design problem. J. Transport Geography (1994) 2(1):31–40Crossref, Google Scholar
- Hub network design with single and multiple allocation: A computational study. Location Sci. (1996) 4(3):125–138Crossref, Google Scholar
- An efficient procedure for designing single allocation hub and spoke systems. Management Sci. (1998) 44(12):235–242Link, Google Scholar
- Optimal location of intermodal freight hubs. Transportation Res. B (2005) 39(5):453–477Crossref, Google Scholar
- On tabu search for the location of interacting hub facilities. Eur. J. Oper. Res. (1994) 73:501–508Crossref, Google Scholar
- The impact of hub-and-spoke network centralization and route monopoly on domestic airline profitability. Transportation J. (1985) 24:16–27Google Scholar

