J.-C. Régin

Operations Research

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

S2 OPT EN 3 ECTS 24h
J.-C. Régin

Description

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

Grading

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