Now showing items 1-2 of 2

    • Essays on some combinatorial optimization problems with interval data 

      Yaman, Hande (Bilkent University, 1999)
      In this study, we investigate three well-known problems, the longest path problem on directed acyclic graphs, the minimum spanning tree problem and the single machine scheduling problem with total flow time criterion, ...
    • 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 ...