MIQP solver based on OSQP

A parallel branch-and-bound engine for Python. (https://pybnb.readthedocs.io/)

A Python package for visualizing the geometry of linear programs.

This is my implementation of a branch and price algorithm to solve the humanitarian aid distribution problem. This problem is a VRP with a specific objective function

NuCS is a Python constraint programming library for solving Constraint Satisfaction and Optimization Problems over finite domains

Python implementation of Travelling Salesman Problem (TSP) using branch-and-bound algorithm.

A module for solving linear programming problems on Python.

A Python implementation of a branch-and-bound approach (plus a simple greedy heuristic) to solve a variation of the multiple knapsack problem where items have both individual and pairwise benefits.

Formulations for the robust Resource-Constrained Project Scheduling Problem (RCPSP) using Pyomo modelling.

Contains code meant to optimize the route for a tourist visiting the Louvre Museum, such that the satisfaction level is maximised by visiting all/select exhibits in a single working day.

Python Client library for Qaekwy Operational Research Solver

Implementation of branch and bound algorithm for maximum clique problem with cplex

A quick template for branch and price prototypes

Python implementations of Simplex Method, Branch and Bound, Gomory's Cutting Plane Method, Iterative: Steepest Gradient Descent, Newton's Method

An implementation for the Simplex algorithm for solving linear optimization problems. This approach covers both Primal and Dual Simplex.

My solution to the Harvest Competition

Different algorithms to find maximum clique in a graph.

With this project we researched, implemented and analyzed different algorithms to effectively and efficiently solve an NP-Complete problem such as the Minimum Vertex Cover (MVC).

Maximum Clique Problem solved by Branch and Bound method and Cplex Optimization.