The final project consists of a 1015 page project report and 1520 minute presentation. Students have option of working on theory, algorithms and / or applications. Project proposals are submitted midway through the term, with the final project due at the end of the term.
Some representative projects are presented in the table below, courtesy of the student author(s).
Approximate Dynamic Programming (Via Linear Programming) for Stochastic Scheduling 
Mohamed Mostagir
Nelson Uhan 
Paper (PDF) (Courtesy of Mohamed Mostagir and Nelson Uhan. Used with permission.)
Slides (PDF) (Courtesy of Mohamed Mostagir and Nelson Uhan. Used with permission.) 
How to choose the State Relevance Weight in the Approximate Linear Programming Approach for Dynamic Programming? 
Yann Le Tallec
Theophane Weber 
Paper (PDF) (Courtesy of Yann LeTallec and Theophane Weber. Used with permission.)
Slides (PDF) (Courtesy of Yann LeTallec and Theophane Weber. Used with permission.) 
Decentralized Strategies for the Assignment Problem 
Hariharan Lakshmanan 
Slides (PDF) (Courtesy of Hariharan Lakshamanan. Used with permission.) 
