We will cover dynamic programming for finding longest common subsequences, Knapsack problem and some interesting ... We will look at ways to describe problems and algorithms using some ideas from ...

The unbounded knapsack problem ... I've implemented a few of the usual solutions to this problem using recursion/memoization and dynamic programming but the solutions do not work for some sets ...

This course continues our data structures and algorithms ... programming and its use in solving NP-hard (combinatorial optimization) problems. We will cover some examples of what integer linear ...