Schedule

Date	Topic	Reading	paper presentaiton	Dues
01/06	Course overview, Engineering examples	Note 1
01/11	Fundamentals	Notes 1, 2
01/13	Fundamentals	Notes 1, 2
01/18	Discrete models	Notes 1, 2
01/20	Discrete models	Notes 1, 2		PS 1, Team members (email)
01/25	LP and Simplex overview	Note 3
01/27	Cutting plane algorithm	Note 3		PS 2
02/01	Cutting plane algorithm	Note 3
02/03	Branch and bound algorithm	Note 3	Team 1	Project proposal
02/08	Branch and bound algorithm	Note 3	Team 2
02/10	Local search	Note 5	Team 3	PS 3
02/15	Simulated annealing	Note 5	Team 4
02/17	Genetic algorithms	Note 5	Team 5	PS 4
02/22	Genetic algorithms	Note 5	Team 6
02/24	MOGA, ACO, PSO	Note 5	Team 7
03/01	Spring Break
03/03	Spring Break
03/08	Breadth-first and Depth-first search	Note 4	Team 8	PS 7
03/10	Shortest path algorithms	Note 4	Team 9	Progress report (email PDF by midnight)
03/15	Shortest path algorithms	Note 4	Team 10
03/17	Minimum spanning tree algorithm		Team 11
03/22	Assembly sequence generation algorithm		Team 12	PS 5
03/24	State of the art		Teams 13, 14
03/29	no class -- project work day
03/31	no class -- project work day
04/05	no class -- project work day
04/07	no class -- project work day
04/12	Project presentation			PS 6
04/14	Project presentation			Final paper (email PDF by midnight)