During the course, you will find here the documents for the theoretical and practical exercises.
In the lecture, we have seen the general concept of dynamic programming and it is the purpose of this exercise to apply it to the knapsack problem. We are going to not only formally define the algorithm but also implement it.
Evolutionary algorithms (EAs) are stochastic optimization algorithms which are based on the idea of articial evolution of solutions towards the optimum. In this exercise, we will implement a basic EA for the knapsack problem in order to show how easy their application can be. But at the same time, we will also illustrate that the choice of their individual components and the tuning of their parameters is crucial to their success.