Modelling and solving a special case of the workforce scheduling problem using Python MIP and the COIN-OR CBC solver.
Cutting Stock / One-dimensional Bin Packing Problem
Foundation Operation Research projects about integer/non-integer linear programming techniques.
optimize a total lengh of non-crossing paths which connect each pair of points with the same number.
Foundation Operation Research projects about integer/non-integer linear programming techniques.
Solver for the Google Hash Code 2019 Final
One-dimensional-heroku
An optimization project about the knapsack problem
Additive-deletion filter method for IIS computation with Python-MIP
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.
This project was made in 4 days.
Add a description, image, and links to the python-mip topic page so that developers can more easily learn about it.
To associate your repository with the python-mip topic, visit your repo's landing page and select "manage topics."