Now showing items 1-9 of 9

    • Benders decomposition algorithms for two variants of the single allocation hub location problem 

      Ghaffarinasab, N.; Kara, B. Y. (Springer New York LLC, 2018)
      The hub location problem (HLP) is a special type of the facility location problem with numerous applications in the airline industry, postal services, and computer and telecommunications networks. This paper addresses two ...
    • A hub covering model for cargo delivery systems 

      Tan, P. Z.; Kara, B. Y. (John Wiley & Sons, 2007)
      The hub location problem appears in a variety of applications including airline systems, cargo delivery systems, and telecommunication network design. When we analyze the application areas separately, we observe that each ...
    • Hub location problem for air-ground transportation sistems with time restrictions 

      Elmastaş, Seda (Bilkent University, 2006)
      In this thesis, we study the problem of designing a service network for cargo delivery sector. We analyzed the structure of cargo delivery firms in Turkey and identified the features of the network. Generally, in the ...
    • The latest arrival hub location problem 

      Kara, B. Y.; Tansel, B. Ç. (Institute for Operations Research and the Management Sciences (INFORM), 2001)
      The traditionally studied hub location problems in the literature pay attention to flight times but not to transient times spent at hubs for unloading, loading, and sorting operations. The transient times may constitute a ...
    • Modeling and analysis of issues in hub location problem 

      Kara, Bahar Yetiş (Bilkent University, 1999)
      The hub location problem has been around for more than 10 years. The first mathematical model was formulated by O’Kelly (1986) which is a quadratic integer program. Since then, nearly all of the researchers in this area ...
    • Modeling and heuristic approaches for the Hub covering problem over incomplete Hub networks 

      Çalık, Hatice (Bilkent University, 2009)
      Hubs are the accumulation points within the transportation and the telecommunication networks that collect and distribute the flow or data, which is originated from a starting point and needs to be transferred to a ...
    • The P-Hub maximal covering problem and extensions for gradual decay functions 

      Peker, M.; Kara, B. Y. (Elsevier, 2015)
      The p-hub maximal covering problem aims to find the best locations for hubs so as to maximize demands within a coverage distance with a predetermined number of hubs. Classically, the problem is defined in the framework of ...
    • P-hub maximal covering problem and extensions for gradual decay functions 

      Peker, Meltem (Bilkent University, 2013)
      Hubs are special facilities that serve as switching, transshipment and sorting nodes in many to many distribution systems. The hub location problem deals with the selection of the locations of hub facilities and finding ...
    • Spatial analysis of single allocation hub location problems 

      Peker, M.; Kara, B. Y.; Campbell, J. F.; Alumur, S. A. (Springer, 2016)
      Hubs are special facilities that serve as switching, transshipment and sorting nodes in many-to-many distribution systems. Flow is consolidated at hubs to exploit economies of scale and to reduce transportation costs between ...