It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) .

Hugo P. Simão, Jeff Day, Abraham P. George, Ted Gifford, John Nienow, Warren B. Powell, An Approximate Dynamic Programming Algorithm for Large-Scale Fleet Management: A Case Application, ...

Manuel S. Santos, , Analysis of a Numerical Dynamic Programming Algorithm Applied to Economic Models, Econometrica, Vol. 66, No. 2 (Mar., 1998), pp. 409-426 ...

Dynamic Programming and Optimal Control is offered within DMAVT and attracts in excess of 300 students per year from a wide variety of disciplines. It is an integral part of the Robotics, System and ...

COMP_SCI 396, 496: Advanced Algorithm Design through the Lens of Competitive Programming VIEW ALL COURSE TIMES AND SESSIONS Prerequisites CS 336 or Permission of Instructor Description This is an ...

View on Coursera Course Description This course continues our data structures and algorithms specialization by focussing on the use of linear and integer programming formulations for solving ...