D

dynamic programming

This project adopts Reinforcement Learning to solve a variant of the stochastic VRP, where customers are highly variable, demands are stochastic, and vehicles have a duration limit.

Study of execution time of differents algorithms to solve the knapsack problem, in differents instances of the problem created with a generator of knapsack problem.

Algorithms and Data Structure Implemented in C++