A Short Overview of Linear Programming, Basic Notions in Graph Theory, Efficient Algorithms For Problems in Graphs Like Matching, Flow Problems, and Spanning Trees, Matroids, Analysis of Algorithms Based On Linear Programming, Polyhedral Optimization, Basic Topics In Complexity, Approximation Algorithms.__

Faculty: Data and Decision Sciences
|Graduate Studies
Pre-required courses

94312 - Deterministic Mod.in Operations Research or 94313 - Deterministic Models in Oper.research

Course with no extra credit

236718

Semestrial Information

Weekly Hours

3.5 Academic Credit • 3 Lecture Hours • 1 Discussion Hours

Responsible(s)

Asaf Levin


Registration Groups
11
Lecture Thursday 16:30 - 19:30 בלומפילד 152 | Asaf Levin
Exercise Thursday 19:30 - 20:30 בלומפילד 152 | Elena Kleiman
Weekly Hours

3.5 Academic Credit • 3 Lecture Hours • 1 Discussion Hours

Responsible(s)

Asaf Levin


Registration Groups
11
Lecture Thursday 15:30 - 18:30 בלומפילד 152 | Asaf Levin
Exercise Thursday 18:30 - 19:30 בלומפילד 152 | Elena Kleiman
Weekly Hours

3.5 Academic Credit • 3 Lecture Hours • 1 Discussion Hours


Registration Groups
11
Lecture Thursday 16:30 - 19:30 בלומפילד 527 | Alla Levin
Exercise Thursday 19:30 - 20:30 בלומפילד 527 | Elena Kleiman