Geoscience Reference
In-Depth Information
Kim J-G, Tcha D-W (1992) Optimal design of a two-level hierarchical network with tree-star
configuration. Comput Ind Eng 22:273-281
Kimms A (2006) Economies of scale in hub and spoke network design: we have it all wrong.
In: Morlock M, Schwindt C, Trautmann N, Zimmermann J (eds) Perspectives on operations
research, Weisbaden, Germany, pp 293-317
Klincewicz JG (1998) Hub location in backbone/tributary network design: A review. Loc Sci
6:307-335
Klincewicz JG (2002) Enumeration and search procedures for a hub location problem with
economies of scale. Ann Oper Res 110:107-122
Köksalan M, Soylu B (2010) Bicriteria p-hub location problems and evolutionary algorithms.
INFORMS J Comput 22:528-542
Labbé M, Yaman H (2004) Projecting the flow variables for hub location problems. Networks
44:84-93
Labbé M, Yaman H (2008) Solving the hub location problem in a start-start network. Networks
51:19-33
Labbé M, Yaman H, Gourdin É (2005) A branch and cut algorithm for hub location problems with
single assignment. Math Program 102:371-405
Laporte G (2009) Fifty years of vehicle routing. Trans Sci 43:408-416
Lee C-H, Ro H-B, Tcha D-W (1993) Topological design of a two-level network with ring-star
configuration. Comput Oper Res 20:625-637
Liang H (2013) The hardness and approximation of the star p-hub center problem. Oper Res Lett
41:138-141
Lin C-C, Lee S-C (2010) The competition game on hub network design. Transp Res B Methodol
44:618-629
Lowe TJ, Sim T (2013) The hub covering flow problem. J Oper Res Soc 64:973-981
Luer-Villagra A, Marianov V (2013) A competitive hub location and pricing problem. Eur J Oper
Res 231:734-744
Marianov V, Serra D, ReVelle, CS (1999) Location of hubs in a competitive environment. Eur
J Oper Res 114:363-371
Marianov V, Serra D (2003) Location models for airline hubs behaving as M/D/c queues. Comput
Oper Res 30:983-1003
Maric M, Stanimirovic Z, Stanojevic P (2013) An efficient memetic algorithm for the uncapacitated
single allocation hub location problem. Soft Comput 17:445-466
Marín A (2005a) Uncapacitated Euclidean hub location: Strengthened formulation, new facets and
a relax-and-cut algorithm. J Glob Optim 33:393-422
Marín A (2005b) Formulating and solving splittable capacitated multiple allocation hub location
problems. Comput Oper Res 32:3093-3109
Martins de Sá E, Contreras I, Cordeau J-F (2014) Exact and heuristic algorithms for the design of
hub networks with multiple lines. Submitted to Eur J Oper Res
Martins de Sá E, Contreras I, Cordeau J-F, de Camargo RS, de Miranda R (2015) The hub line
location problem. Transp Sci, forthcoming
Martins de Sá E, de Camargo RS, de Miranda R (2013) An improved Benders decomposition
algorithm for the tree of hubs location problem. Eur J Oper Res 226:185-202
Meng Q, Wang X (2011) Intermodal hub-and-spoke network design: Incorporating multiple
stakeholders and multi-type containers. Transp Res B Methodol 45:724-742
Meyer T, Ernst AT, Krishnamoorthy M (2009) A 2-phase algorithm for solving the single allocation
p-hub center problem. Comput Oper Res 36:3143-3151
Mirzaghafour F (2013) Modular hub location problems. Msc thesis, Concordia University,
Montreal, Canada
Nagi G, Salhi S (1998) The many-to-many location-routing problem. TOP 6:261-275
O'Kelly ME (1986a) The location of interacting hub facilities. Transp Sci 20:92-106
O'Kelly ME (1986b) Activity levels at hub facilities in interacting networks. Geogr Anal 18:343-
356
Search WWH ::




Custom Search