This course treats an important class of problems in the areas of Combinatorial Optimization.
Various combinatorial optimization algorithms for problems such as Shortest Path, Max Flow,
Matching, Assignment are investigated from a Primal-Dual perspective.
The concept of Matroid and NP-completeness are also discussed to better understand
the fundamental differences between easy and hard combinatorial problems.

IMEN 261 Introduction to Operations Research (or separate approval)

3 Exams 25% each, 75% total
3 Assignments 7% each, 21% total
Class Participaption 4%

any elementary Operations Research textbooks

6-Sep Tue Chapter 1 Introduction
8-Sep Thr Chapter 2 Simplex algorithm
13-Sep Tue Chapter 2 Simplex algorithm
15-Sep Thr Chapter 3 Duality
20-Sep Tue Chapter 4 Revised Simplex
22-Sep Thr Chapter 5 Primal-Dual Algorithm
27-Sep Tue Chapter 5 Primal-Dual Algorithm
29-Sep Thr Ch6 P-D Algorithm for MaxFlow and Shortest Path
4-Oct Tue Review & HW1 Due
6-Oct Thr Exam 1
11-Oct Tue Alternative Holiday
13-Oct Thr Ch7 PD Scheme for Min-cost Flow
18-Oct Tue Ch7 PD Scheme for Min-cost Flow
20-Oct Thr Ch8 Algorithm and complexity
25-Oct Tue Ch9 Efficient algorithm for MaxFlow
27-Oct Thr Ch10 Bi-partite Matching
1-Nov Tue Ch10 Non-Bi-partite Matching
3-Nov Thr Ch11 Weighted Bi-partite Matching
8-Nov Tue Ch11 Weighted Non-Bi-partite Matching
10-Nov Thr Review & HW2 Due
15-Nov Tue Exam 2
17-Nov Thr Ch12 Matroid
22-Nov Tue Ch12 Matroid
24-Nov Thr Ch12 Matroid
29-Nov Tue Ch12 Matroid
1-Dec Thr Ch13 Integer Programming
6-Dec Tue Ch13 Integer Programming
8-Dec Thr Ch13 Integer Programming
13-Dec Tue Review & HW3 Due
15-Dec Thr Exam 3

Off-line class but on-line whenever necessary

The attendance is essential, especially for off-line sessions.
You must catch up with missed on-line clases by watching the video recording
that are to be made available after every on-line class.