J.-C. Régin, PR

Operations Research

This course is about shortest path and maximum flow problems in graphs.

S2 3 ECTS 24h OPT EN jcregin@gmail.com

Description

  • Shortest Path Problems
  • Maximum Flow Problems
  • Minimum Cost Maximum Flow Problems

Grading

  • Project (40%)
  • Final Exam (60%)