Basic Information
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. Learning Outcomes# 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.
Faculty: Data and Decision Sciences
|Undergraduate Studies
|Graduate Studies
Pre-required courses
94312 - Deterministic Mod.in Operations Research or 94313 - Deterministic Models in Oper.research
Semestrial Information
Weekly Hours
2.5 Academic Credit • 2 Lecture Hours • 1 Discussion Hours
Responsible(s)
Asaf Levin
Notes
-
הקורס יועבר במסגרת התכנית "יורוטק", וינתן בשפה האנגלית.
Registration Groups
|
|
Weekly Hours
2.5 Academic Credit • 2 Lecture Hours • 1 Discussion Hours
Responsible(s)
Asaf Levin
Registration Groups
|
|
Weekly Hours
2.5 Academic Credit • 2 Lecture Hours • 1 Discussion Hours
Responsible(s)
Asaf Levin
Registration Groups
|
|