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)

2 Exams 35% each, 70% total
3 Assignments 20% total
Class Participaption 10%

any elementary Operations Research textbooks

9월 3일 Tue Chapter 1 Introduction
9월 5일 Thu Chapter 2 Simplex algorithm online
9월 10일 Tue Chapter 2 Simplex algorithm
9월 12일 Thu Chapter 3 Duality
9월 17일 Tue Holiday
9월 19일 Thu Chapter 4 Revised Simplex online
9월 24일 Tue Chapter 5 P-D Algorithm
9월 26일 Thu Chapter 5 P-D Algorithm
10월 1일 Tue Ch6 P-D for MaxFlow/Shortest Path
10월 3일 Thu Holiday
10월 8일 Tue Ch6 P-D for MaxFlow/Shortest Path
10월 10일 Thu Gravitational Method
10월 15일 Tue Gravitational Method
10월 17일 Thu Review
10월 22일 Tue Exam 1
10월 24일 Thu Ch7 PD Scheme for Min-cost Flow
10월 29일 Tue Ch8 Algorithm & Complexity
10월 31일 Thu No class / supplementary class TBA
11월 5일 Tue Ch9 / Ch10 Bipartite matching
11월 7일 Thu Ch9 / Ch10 Bipartite matching
11월 12일 Tue Ch10 Non-Bi-partite Matching
11월 14일 Thu Ch10 Non-Bi-partite Matching
11월 19일 Tue Ch11 Weighted Non-Bi-P Matching
11월 21일 Thu Ch11 Weighted Non-Bi-P Matching
11월 26일 Tue Ch12 Matroid
11월 28일 Thu Ch12 Matroid
12월 3일 Tue Ch13 Integer Programming
12월 5일 Thu Ch13 Integer Programming
12월 10일 Tue Review
12월 12일 Thu Exam2

Off-line class but on-line whenever necessary
5th and 19th of September class will be on-line
there is no class on the 31st of October and a supplementary class will be scheduled.

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.