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

Dynamic optimization and optimal control problems form the backbone of numerous applications in engineering, economics and the natural sciences. These methodologies involve determining a time-varying ...

This is a preview. Log in through your library . Abstract A general sequential model is defined where returns are in a partially ordered set. A distinction is made between maximal (nondominated) ...

https://doi.org/10.2307/1243989 • https://www.jstor.org/stable/1243989 Copy URL A dynamic programming model that allocates irrigations among competing crops, while ...