Modelling and solving a special case of the workforce scheduling problem using Python MIP and the COIN-OR CBC solver.

Additive-deletion filter method for IIS computation with Python-MIP

optimize a total lengh of non-crossing paths which connect each pair of points with the same number.

Solver for the Google Hash Code 2019 Final

Desenvolvimento de uma aplicação envolvendo o algoritmo Branch-and-Bound para solucionar problemas de programação linear inteira (PLI), criada como projeto final da disciplina Pesquisa Operacional.

An optimization project about the knapsack problem

This project was made in 4 days.