Lecture Schedule


Sept:
        27     Intro. Network Flow. Ford Fulkerson Method
               

Oct:
	2	Maxflow Mincut. Polynomial Algs			 HW 1 handout
	4	Applications of maxflow, Circulation

	9	Mincost flow, and Global mincut.
	11	Circulation and Mincost Flows
	
	16	Bipartite matchings. 							HW 1 DUE
	18	Stable Matching.				HW 2 handout

	23	Linear Programming: basics
	25		** Midterm **

	30	Applications of LP				Project Assignment

Nov
	1	Simplex algorithm							HW 2 DUE

	6	Duality in LP
	8	Minmax Thm, Game Theory, Integer LP
	
	13	Approximation using LP rounding 		HW 3 handout
	15	LP rounding 

	20	Submodular Function Optimization
	22		** THANKSGIVING **

	27	Local Search Algorithms 						HW 3 DUE
	29	Local Search Algorithms
	

Dec
	4		Project Presentation
	6		Project Presentation