Now showing items 1-13 of 13

    • An application of capacitated lot-sizing model in petroleum sector 

      Nurlu, Nuri Barış (Bilkent University, 2006)
      In this thesis, we study capacitated lot-sizing problem with special feature, applicable to the petroleum refinery sector. In our model, the end-products should be stored in item-specific and capacitated storage tanks ...
    • 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 branch-and-cut algorithm for quadratic assignment problems based on linearizations 

      Erdoğan, G.; Tansel, B. (Elsevier, 2007-04)
      The quadratic assignment problem (QAP) is one of the hardest combinatorial optimization problems known. Exact solution attempts proposed for instances of size larger than 15 have been generally unsuccessful even though ...
    • A branch-and-cut algorithm for the hub location and routing problem 

      Rodríguez-Martín, I.; Salazar-González, J-J.; Yaman, H. (Elsevier, 2014)
      We study the hub location and routing problem where we decide on the location of hubs, the allocation of nodes to hubs, and the routing among the nodes allocated to the same hubs, with the aim of minimizing the total ...
    • 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 ...
    • Exact solution approaches for non-Hamiltonian vehicle routing problems 

      Özbaygın, Amine Gizem (Bilkent University, 2017-08)
      In this thesis, we study di erent non-Hamiltonian vehicle routing problem variants and concentrate on developing e cient optimization algorithms to solve them. First, we consider the split delivery vehicle routing problem ...
    • Hierarchical Survivable Network Design Problems 

      Rodríguez-Martín, I.; Salazar-González, J-J.; Yaman, H. (Elsevier, 2016)
      We address the problem of designing two-level networks protected against single edge failures. A set of nodes must be partitioned into terminals and hubs, hubs must be connected through a backbone network, and terminals ...
    • k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut 

      Diarrassouba, I.; Mahjoub, M.; Mahjoub, A. R.; Yaman, H. (Springer-Verlag France, 2018)
      Given a graph with weights on the edges, a set of origin and destination pairs of nodes, and two integers L ≥ 2 and k ≥ 2, the k-node-disjoint hop-constrained network design problem is to find a minimum weight subgraph of ...
    • The periodic vehicle routing problem with driver consistency 

      Rodríguez-Martín, I.; Salazar-González, J. -J.; Yaman, H. (Elsevier, 2018)
      The Periodic Vehicle Routing Problem is a generalization of the classical capacitated vehicle routing problem in which routes are determined for a planning horizon of several days. Each customer has an associated set of ...
    • Relay location in telecommunications and transportation networks 

      Yıldız, Barış (Bilkent University, 2016-03)
      With di↵erent names and functions, relays play a crucial role in the design of telecommunications and transportation networks and finding optimal relay locations is an important concern in various applications. We ...
    • The ring/κ-rings network design problem: model and branch-and-cut algorithm 

      Rodríguez-Martín, I.; Salazar-González, J-J.; Yaman, H. (John Wiley & Sons, 2016)
      This article considers the problem of designing a two-level network where the upper level consists of a backbone ring network connecting the so-called hub nodes, and the lower level is formed by access ring networks that ...
    • 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, ...
    • Time constrained maximal covering salesman problem with weighted demands and partial coverage 

      Ozbaygin, G.; Yaman, H.; Karasan, O. E. (Elsevier Ltd, 2016)
      In a routing framework, it may not be viable to visit every single customer separately due to resource limitations or efficiency concerns. In such cases, utilizing the notion of coverage; i.e., satisfying the demand of ...