IS703: Decision Support and Optimization

Syllabus and Schedule

Week	Topic	Reference
1	Introduction, Asymptotics, Recurrences	Course Outline CLRS 1-4
2	Heaps Quicksort (Divide-&-Conquer)	CLRS 6, 7 Assignment 1
3	Greedy and Dynamic Programming	CLRS 15,16 Assignment 2
4	Graphs and Networks	CLRS 22-26 Tutorial on Network Flows by Beasley  and Min-Cost Flows by M. Trick Network Flows Applications by Paul Jensen
5	Introduction to Complexity	CLRS 34, 35 “Combinatorial Optimization, Current Successes and Future Directions” by Karla Hoffman
6	Mathematical Programming	BK 2-3; Tutorial on Branch and Bound by Jens Clausen Notes on Lagrangian relaxation by James Orlin
7	Review
8	Recess: Mid-Term Exam	Coverage: Greedy, DP, Graphs & Networks, Math Programming
9	Constraint Programming	BK 9 CP Tutorial by Roman Bartak
10	Local Search and Its Generalizations	BK 6-8 "TSP: A Case Study on Local Optimization" by Johnson and McGeoch
11	Meta-Heuristics	BK 4-5, 14 , 17 Metaheuristics in combinatorial optimization: Overview and conceptual comparison" by Blum and Roli
12	Advanced Topics	Various papers
13	Student Presentation	All students are required to be present at all the presentations