Polyhedral Methods of Integer Programing  096351





Lecture 
Exercise 
Laboratory 
Project or Seminar 
House Work 
Weekly Hours 
2 
1 


5 

Determination of the grade according to progress during the semester and a final examination.
Prerequisites:
    Deterministic Models in Oper.Research 
094313
 
Formulation of Integer Programming Problems, Polyhedral Structures, Integrality of Polyhedrons, Facets Defining Inequalities, Efficiency of Algorithms, Complexity Theory, Soluton Methods for Integer Programming Problems: Cutting Planes, Column Generation, Branch and Bound, Lagrangian Duality, Dynamic Programming, Heuristics Algorithms. at the End of the Course the Student Will:
1. Understand the Quality of Different Modeling of Integer Programming Problems.
2. Understand the Definition of a Polyhedron and Its Algebraic Properties.
3. Be Able to Solve Integer Programing Problems with Various Solution Methods.
Timetable to semester 02/2020
2020/2021 Spring Semester
Room  Building  Hour  day  Lecturer  Exercise Lecture  no.  Registering Group 

  16:3018:30  Tuesday  Associate Professor Levin Asaf  Lecture  10  11 
  18:3019:30  Tuesday   Exercise  11 
TextbooksPublished  Publisher  Authors  Book 

1998  wiley  l. a. wolsey  integer programming 
2005  dynamic ideas  d. bertsimas and r. weismantel  optimization over integers 
Created in 08/03/2021 Time 15:02:56