Now showing items 21-31 of 31

    • Polyhedral analysis for the uncapacitated hub location problem with modular arc capacities 

      Yaman, H. (Society for Industrial and Applied Mathematics, 2005)
      We consider the problem of installing a two-level telecommunication network. Terminal nodes communicate with each other through hubs. Hubs can be installed on terminal nodes and they are interconnected by a complete network. ...
    • Projecting the flow variables for hub location problems 

      Labbé, M.; Yaman, H. (John Wiley & Sons, 2004)
      We consider two formulations for the uncapacitated hub location problem with single assignment (UHL), which use multicommodity flow variables. We project out the flow variables and determine some extreme rays of the ...
    • Regenerator location problem and survivable extensions: a hub covering location perspective 

      Yıldız, B.; Karaşan, O. E. (Elsevier, 2015)
      In a telecommunications network the reach of an optical signal is the maximum distance it can traverse before its quality degrades. Regenerators are devices to extend the optical reach. The regenerator placement problem ...
    • Robust intermodal hub location under polyhedral demand uncertainty 

      Meraklı, M.; Yaman, H. (Elsevier, 2016)
      In this study, we consider the robust uncapacitated multiple allocation p-hub median problem under polyhedral demand uncertainty. We model the demand uncertainty in two different ways. The hose model assumes that the only ...
    • Routing and scheduling decisions in the hierarchical hub location problem 

      Dükkanci O.; Kara, B.Y. (Airline Group of the International Federation of Operations Research Societies (AGIFORS), 2014)
      Hubs are facilities that consolidate and disseminate flow in many-to-many distribution systems. The hub location problem considers decisions that include the locations of hubs in a network and also the allocations of the ...
    • Routing and scheduling decisions in the hierarchical hub location problem 

      Dukkanci, O.; Kara, B. Y. (Elsevier, 2017)
      Hubs are facilities that consolidate and disseminate flow in many-to-many distribution systems. The hub location problem considers decisions that include the locations of hubs in a network and the allocations of demand ...
    • The single-assignment hub covering problem: models and linearizations 

      Kara, B. Y.; Tansel, B. C. (Palgrave Macmillan Ltd., 2003)
      We study the hub covering problem which, so far, has remained one of the unstudied hub location problems in the literature. We give a combinatorial and a new integer programming formulation of the hub covering problem ...
    • Solving the hub location problem in a star-star network 

      Labbé, M.; Yaman, H. (John Wiley & Sons, 2008)
      We consider the problem of locating hubs and assigning terminals to hubs for a telecommunication network. The hubs are directly connected to a central node and each terminal node is directly connected to a hub node. The ...
    • Solving the hub location problem with modular link capacities 

      Yaman, H.; Carello, G. (Elsevier, 2005)
      This paper deals with a capacitated hub location problem arising in the design of telecommunications networks. The problem is different from the classical hub location problem in two ways: the cost of using an edge is not ...
    • Star p-hub median problem with modular arc capacities 

      Yaman, H. (Elsevier, 2008)
      We consider the hub location problem, where p hubs are chosen from a given set of nodes, each nonhub node is connected to exactly one hub and each hub is connected to a central hub. Links are installed on the arcs of the ...
    • A tabu-search based heuristic for the hub covering problem over incomplete hub networks 

      Calık H.; Alumur, S. A.; Kara, B. Y.; Karasan, O. E. (Elsevier, 2009)
      Hub location problems deal with finding the location of hub facilities and with the allocation of demand nodes to these located hub facilities. In this paper, we study the single allocation hub covering problem over ...