Now showing items 1-2 of 2

    • The robust shortest path problem with interval data uncertainties 

      Karaman, Abdullah Sıddık (Bilkent University, 2001)
      In this study, we investigate the well-known shortest path problem on directed acyclic graphs under arc length uncertainties. We structure data uncertainty by taking the arc lengths as interval ranges. In order to ...
    • Shortest path problem with re-routing en-route 

      Karakaya, Banu (Bilkent University, 2008)
      In this study, we examine the shortest path problem under the possibility of “re-routing” when an arc that is being traversed is blocked due to reasons such as road and weather conditions, congestion, accidents etc. If ...