This course 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) ...

This course covers reinforcement learning aka dynamic programming, which is a modeling principle capturing dynamic environments and stochastic nature of events. The main goal is to learn dynamic ...

This is a preview. Log in through your library . Abstract A dynamic decision problem in which the effect of control action is either delayed for a number of time periods or has an effect that lasts ...

This is a preview. Log in through your library . Abstract We study a deterministic maritime inventory routing problem with a long planning horizon. For instances with many ports and many vessels, ...

Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...