completed the outline

presentation.txt

@@ -6,6 +6,9 @@ outline:
         be saved by having efficient soln.
     d. the general methods of solving this; eg. linear programming and
         heuristic approaches in it, ant colonization and why these fail.
+
+(finish above in around 5 mins)
+
 2. Our Solution
     a. Use TSP as we want to minimise cost eventually(explain TSP too).
     b. Problem in using TSP though, is its bad time complexity.
@@ -16,5 +19,11 @@ outline:
         and number of clusters is <= total number of buses available,
         to handle this, explain the process given by Chaithanya.
     f. To handle time window, run TSP on weighted graph, alpha beta
-        method
+        method and plot a graph to find alpha such that time is within
+        limit.
+    g. Quantum approach - Chaithanya
+
+(finish above in 13 mins, if anyone asks questions in between then 
+say that we'll take them in the end)
 
+3. Ask for questions