Now showing items 1-5 of 5

    • A branch-and-cut algorithm for two-level survivable network design problems 

      Rodríguez-Martín, I.; Salazar-González, J-J.; Yaman, H. (Elsevier, 2016)
      This paper approaches the problem of designing a two-level network protected against single-edge failures. The problem simultaneously decides on the partition of the set of nodes into terminals and hubs, the connection of ...
    • 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 ...
    • Routing and scheduling decisions in the hierarchical hub location problem 

      Dükkancı, Okan; Kara, Bahar Y. (Elsevier, 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 ...
    • Survivability in hierarchical telecommunications networks 

      Fouilhoux, P.; Karasan, O. E.; Mahjoub, A. R.; Ökök, O.; Yaman, H. (John Wiley & Sons, 2012)
      The survivable hierarchical telecommunications network design problem consists of locating concentrators, assigning user nodes to concentrators, and linking concentrators in a reliable backbone network. In this article, ...
    • Survivability in hierarchical telecommunications networks under dual homing 

      Karaşan, O. E.; Mahjoub, A. R.; Özkök, O.; Yaman, H. (Institute for Operations Research and the Management Sciences (I N F O R M S), 2014)
      The motivation behind this study is the essential need for survivability in the telecommunications networks. An optical signal should find its destination even if the network experiences an occasional fiber cut. We consider ...