project in optimization
-
Updated
Apr 20, 2022 - Python
project in optimization
Project to build a fair round-robin tournament schedule for the FGF first division (Federação Gaúcha de Futebol) a.k.a Gauchão.
A Python repo for a genetic algorithm I wrote to generate FanDuel fantasy baseball lineups optimized for expected fantasy points.
A solver for a class of constrained graph clustering problems
Wire cut optimization
This is the implementation of a mixed integer programming model that schedules volunteers for the University of Washington's Food Pantry. It maximized the number of shifts with exactly 4 people working and the number of volunteers working with their preferred coworkers. By Kendyl Bouret and Catherine Liu
Mapping a set of random points to a uniform lattice
An overview of the cutting plane method for integer programming, emphasizing Gomory's cut. (Bosnian)
Google HashCode 2020
Trabalho de programação linear inteira para a disciplina de Métodos Quantitativos da UDESC (Bacharelado em Engenharia de Software, CEAVI)
Using Folium to interactively solve the traveling salesman problem using pin-pointed locations generated by user.
Integer Linear Programming Solver implementing Simplex algorithm together with Branch-And-Bound method written from scratch with Numpy
This project aims to solve qubit placement problems in nearest neighbour compliance quantum circuits. We approached the problem using integer linear programming, and solve for the exact global optimal solution.
An operations research project focused on network problems, with a particular emphasis on the max-flow problem. (Bosnian)
This project has been developed for academic purpose. Basically, it consists in a Python algorithm able to solve a multidimensional Knapsack problem using only Gomory cuts. Every new cut shows its utility in terms of how much it reduces the gap between the relaxed PL solution and the optimal PLI one.
Implementation of the Branch & Bound approach to solve a Integer programming problem.
Machine Reasoning Homework 4 -- Constraint Satisfaction Problems
Cluster-Median Problem and Minimum Spanning Tree implementations and results comparison with generated datasets
Implemented the logic for various algorithms to get optimal vertex cover
Add a description, image, and links to the integer-programming topic page so that developers can more easily learn about it.
To associate your repository with the integer-programming topic, visit your repo's landing page and select "manage topics."