Linear and Combinatorial Programming - 098331
|
|
|
|
|
| |
Lecture |
Exercise |
Laboratory |
Project or
Seminar |
House
Work |
Weekly
Hours |
3 |
1 |
|
|
|
|
Possibility to guided reading
Determination of the grade according to progress during the semester and a final examination.
|
Prerequisites:
| | | | Deterministic Models in Oper.Research |
094313
| |
| |
|
Overlapping Courses:
| | | | Combinatorial Optimization |
236718
| |
Review of Linear Programming Together with Primal-Dual Method. Revised Simplex Methods. Branch and Bound Methods, Benders Decomposition for Mixed Integer Problems. Elements of Graph Theory. Network Flow Problems - Primal Algorithms. Complementarity Problems. Foundation of Computational Complexity, Efficient Algorithms.
Timetable to semester 01/2020
2020/2021 Winter Semester
semester
Previous
| Room | Building | Hour | day | Lecturer | Exercise
Lecture | no. | Registering
Group |
|---|
| 151 | בלומפילד | 16:30-19:30 | Thursday | Doctor Nivel Alle | Lecture | 10 | 11 |
| 151 | בלומפילד | 19:30-20:30 | Thursday | Doctor Kleiman Elena | Exercise | 11 |
Created in 22/04/2021 Time 13:14:18
