• Winter 2011 - Wednesday, 18:00-21:00
  
• Syllabus.

• General information (PDF in Hebrew)
• Introduction (PDF in Hebrew)
  • Basic concepts & traffic Flow
  • Java Simulation of traffic flow
  • Traffic flow theory
• Models & Tools
  • Transportation planning (PDF in Hebrew)
    
  • Graphs and networks - models and tools (PDF in Hebrew)
    
  • Spanning trees (PDF in Hebrew, updated on November 19, 2011)
  • The shortest path problem (PDF in Hebrew, updated on December 3, 2011. Excell files: Node-To-Node Shortest Path and Single Source Shortest Path)
    
  • The travelling salesman problem, the Chinese mailman problem and the vehicle routing problem (PDF in Hebrew). An example for the Saving algorithm (PowerPoint presentation).
    
  • Network flow (PDF in Hebrew)
  • Facility location (PDF in Hebrew)

The exercises constitute 30% of the final grade. The exercises must be submitted two lessons before the end of the semester.

• Traffic Flow Theory, Transportation Planning Models and Tools - Exercises.
  
• Introduction to Graphs and Networks theory and Spanning Trees - Exercises.
• Shortest Paths, Vehicle Routing and Network Flow - Exercises.
• Sample solutions
  
• Grages

The exam constitutes 70% of the final grade. In order to pass the course you must pass the exam with a minimum grade of 60.
Exam's Date: unknown at this stage.
The exam is with open material.
Exams from previous years can be found on the Student Union website.

• Deliberately blocking traffic (Hebrew)
• Minimum spanning tree (Wikipedia, the free enceclopedia, Hebrew)
• Description of Dijkstra's algorithm (from "Mastering Algorithms With C", O'Reilly 1999)
• Dijkstra's algorithm
• The Floyd-Warshall algorithm
• The Ford-Fulkerson algorithm
• Proof of the correctness of Dijkstra's algorithm

• Bertsimas D. and Tsitsiklis J, Simulated Annealing, Statistical Science, 1993, Vol. 8, No. 1, 10-15
•  Graph Theory With Applications