PACIFICI ANDREA
(programma)
Plan:
Basic Graph Theory
Fundamental (easy) Optimization Problems on Graphs: Maximum Spanning Trees, Maximum Flow, Shortest Paths
Linear Programming (LP) and Duality
Algorithms for LP: Simplex methods & Interior point Methods
Applications of Linear programming to the minimum cost flow problem
Integer Linear Programming (ILP)
Algorithms for ILP: Cutting Planes Methods and Branch & Bound Techniques
Fundamental (hard) Optimization Problems on Graphs: Steiner Tree Problem; Integer Multicommodity Flows
Textbooks:
Lecture notes from the instructors + publicly available textbooks
 Lecture notes from the instructors + publicly available textbooks
|
