Schedule (subject to change)
Date	Topic	Reading	Remark
18-Jan	Introduction, bipartite matching	26.3
23-Jan	Vertex cover theorem, marriage theorem
25-Jan	Network flows: Maximum flow, augmenting paths, Minimum cut	26
30-Jan	Choosing good augmenting paths.
1-Feb	Goldberg algorithm
6-Feb	Project selection	28 of K-T
8-Feb	Linear systems of equations. Gaussian elimination, duality, LUP decomposition	28
13-Feb	Inverting matrices.	28
15-Feb	What if we do not round off?	Handout
19-Feb	President's Day
20-Feb	Substitute Monday
22-Feb	Linear programs. Standard form and slack form.	29, 29.1	Last day to drop without W.
27-Feb	Formulating problems as linear programs	29
1-Mar	The simplex algorithm	29.3
6-Mar	Spring recess		The whole week
13-Mar	Review
15-Mar	Midterm exam
20-Mar	Initial feasible solution	29.4
22-Mar	Duality. Complementary slackness. Equiv. of lin. prog. and lin. ineq.	29.5
27-Mar	Farkas Lemma, games.  Separating hyperplane, NP\cap CoNP.
29-Mar	The ellipsoid algorithm	Handout	Mar 30 last day to drop with W.
3-Apr	Slack
5-Apr	Convex programs	Handout
10-Apr	Approximate algorithms: Vertex cover	35.1
12-Apr	Set cover	35.3
16-Apr	Patriots Day
17-Apr	Knapsack problem	35.5
18-Apr	Substitute Monday
19-Apr	NP-completeness	34.1-4
24-Apr
26-Apr
1-May	Review
8-May	Final exam 9-11