Browsing by Keywords "Branch-and-price"

Now showing items 1-5 of 5

    • A branch-and-price algorithm for the vehicle routing problem with roaming delivery locations 

      Ozbaygin G.; Ekin Karasan O.; Savelsbergh M.; Yaman, H. (Elsevier Ltd, 2017)
      We study the vehicle routing problem with roaming delivery locations in which the goal is to find a least-cost set of delivery routes for a fleet of capacitated vehicles and in which a customer order has to be delivered ...

    • 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 ...

    • OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty 

      Altın, A.; Belotti, P.; Pınar, M. Ç. (Springer, 2010)
      We study the best OSPF style routing problem in telecommunication networks, where weight management is employed to get a routing configuration with the minimum oblivious ratio. We consider polyhedral demand uncertainty: ...

    • Regenerator location problem in flexible optical networks 

      Yıldız, B.; Karaşan, O. E. (Institute for Operations Research and the Management Sciences (I N F O R M S), 2017-06)
      In this study, we introduce the regenerator location problem in flexible optical networks. With a given traffic demand, the regenerator location problem in flexible optical networks considers the regenerator location, ...

    • 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 ...