Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment

References

• Alumur S., Kara B. Y. Network hub location problems: The state of the art. Eur. J. Oper. Res. (2008) 190(1):1–21Crossref, Google Scholar
• Aykin T. Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem. Eur. J. Oper. Res. (1994) 79(3):501–523Crossref, Google Scholar
• Aykin T. Networking policies for hub-and-spoke systems with application to the air transportation system. Transportation Sci. (1995) 29(3):201–221Link, Google Scholar
• Barahona F., Anbil R. The volume algorithm: Producing primal solutions with a subgradient method. Math. Programming (2000) 87(3):385–399Crossref, Google Scholar
• Bahiense L., Maculan N., Sagastizábal C. The volume algorithm revisited: Relation with bundle methods. Math. Programming Ser. A (2002) 94(1):41–69Crossref, Google Scholar
• Barnhart C., Johnson E. L., Nemhauser G. L., Savelsbergh M. W. P., Vance P. H. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. (1998) 46(3):316–329Link, Google Scholar
• Ben Amor H. M. T., Desrosiers J., Frangioni A. On the choice of explicit stabilizing terms in column generation. Discrete Appl. Math. (2009) 157(6):1167–1184Crossref, Google Scholar
• Ben Amor H. M. T., Desrosiers J., Valério de Carvalho J. M. Dual-optimal inequalities for stabilized column generation. Oper. Res. (2006) 54(3):454–463Link, Google Scholar
• Boland N. L., Krishnamoorthy M., Ernst A. T., Ebery J. Preprocessing and cutting for multiple allocation hub location problems. Eur. J. Oper. Res. (2004) 155(3):638–653Crossref, Google Scholar
• Briant O., Lemaréchal C., Meurdesoif Ph., Michel S., Perrot N., Vanderbeck F. Comparison of bundle and classical column generation. Math. Programming (2008) 113(2):299–344Crossref, Google Scholar
• Campbell J. F. Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. (1994) 72(2):387–405Crossref, Google Scholar
• Campbell J. F., Ernst A. T., Krishnamoorthy M., Drezner Z., Hamacher H. W. Hub location problems. Facility Location: Applications and Theory (1987) (Springer-Verlag, Berlin) 373–406Google Scholar
• Contreras I. Network hub location: Models, algorithms and related problems. (2009) . Ph.D. thesis, Department of Statistics and Operations Research, Technical University of Catalonia, Barcelona, SpainGoogle Scholar
• Contreras I., Díaz J., Fernández E. Lagrangean relaxation for the capacitated hub location problem with single assigment. OR Spectrum (2009) 31(3):483–505Crossref, Google Scholar
• da Graça Costa M., Captivo M. E., Climaco J. Capacitated single allocation hub location problem—A bi-criteria approach. Comput. Oper. Res. (2008) 35(11):3671–3695Crossref, Google Scholar
• Desrosiers J., du Merle O., Villeneuve D., Hansen P. Stabilized column generation. Discrete Math. (1999) 194:229–237Crossref, Google Scholar
• Ebery J., Krishnamoorthy M., Ernst A. T., Boland N. The capacitated multiple allocation hub location problem: Formulations and algorithms. Eur. J. Oper. Res. (2000) 120(3):614–631Crossref, Google Scholar
• Elhedhli S., Hu F. X. Hub-and-spoke network design with congestion. Comput. Oper. Res. (2005) 32:1615–1632Crossref, Google Scholar
• Ernst A. T., Krishnamoorthy M. Solution algorithms for the capacitated single allocation hub location problem. Ann. Oper. Res. (1999) 86:141–159Crossref, Google Scholar
• Kelley J. E. The cutting-plane method for solving convex programs. J. Soc. Indust. Appl. Math. (1960) 8(4):703–712Crossref, Google Scholar
• Kuhn H. W. The Hungarian method for the assignment problem. Naval Res. Logist. Quart. (1955) 2(1–2):83–97Crossref, Google Scholar
• Labbé M., Yaman H., Gourdin E. A branch and cut algorithm for hub location problems with single assignment. Math. Programming (2005) 102(2):371–405Crossref, Google Scholar
• Lübbecke M. E., Desrosiers J. Selected topics in column generation. Oper. Res. (2005) 53(6):1007–1023Link, Google Scholar
• Marín A. Formulating and solving splittable capacitated multiple allocation hub location problems. Comput. Oper. Res. (2005) 32(12):3093–3109Crossref, Google Scholar
• Martello S., Pisinger D., Toth P. New trends in exact algorithms for the 0-1 knapsack problem. Eur. J. Oper. Res. (2000) 123(2):325–332Crossref, Google Scholar
• Pirkul H., Schilling D. A. An efficient procedure for designing single allocation hub and spoke systems. Management Sci. (1998) 44(12):S235–S242Link, Google Scholar
• Rodríguez-Martín I., Salazar-González J. J. Solving a capacitated hub location problem. Eur. J. Oper. Res. (2008) 184(2):468–479Crossref, Google Scholar
• Sasaki M., Fukushima M. On the hub-and-spoke model with arc capacities constraints. J. Oper. Res. Soc. Japan (2003) 46(4):409–428Crossref, Google Scholar
• Valério de Carvalho J. M. Using extra dual cuts to accelerate column generation. INFORMS J. Comput. (2005) 17(2):175–182Link, Google Scholar