Guilherme Cadori's Projects
Implementation of the Matchings algorithm for the single vehicle arc routing problem – aka. "Chinese Postman Problem". This implementation is specific to this notebook's specific instance. Code needs to be generalized on the odd degree nodes portion before being used for different instances.
Implementation of a MILP with Dantzig's and the MTZ subtour elimination constraints. Dantzig's constraints are added recursively. Scripts also contain a few heuristics for the TSP.
We implemented a matheuristic algorithm integrating Iterative Restricted Space Search heuristics and exact methods in order to solve different instances of the TSP.
Implementing different search algorithms for the knapsack problem - multiple instances.
A compilation of studies and personal projects in Machine Learning.
Implementations of the Prim, Kruskal and Ford-Fulkerson algorithms for the Minimum Spanning Tree and Max Flow problems.
MIP Modeling practice.
Repository for my run of the ML Specialization Advanced Learning Algorithms course.
Optimizing a multiobjective problem through the use of heuristics.
Nonlinear optimization is a mathematical approach used to find the best solutions for problems where the objective function or constraints exhibit nonlinear relationships. Unlike linear optimization, which deals with linear equations, nonlinear optimization accommodates more complex, curved relationships.
Numerical methods are computational techniques used to approximate solutions for complex mathematical problems without exact analytical solutions.
A compilation of studies and personal projects.
Implmentation of Dijkstra's and Floyd's algorithms for the Shortest Path Problem.
Implementation of a Tabu Search algorithm with Short Term Memory (STM).
Selected instances downloaded from TSP Lib that will be used for a TSP project.