A C++ implementation of Network Simplex Algorithm

Implementation of the paper "Fair Clustering Through Fairlets" by Chierichetti et al. (NIPS 2017)

A Simple C++ Implementation of the Lemon Optimization Library to Solve a Minimum Cost Flow problem in a given Graph Network with Supply/Demand Values of Nodes and Capacity, Unit Cost of Flow for each Edge.

Network optimization problem solved using Gurobi Python

Successive shortest path minimum cost flow solver

Codes for Linear Programs, Max Flow Min Cut and Min Cost Flow Problems etc.

4 sample solutions on Network optimization problems.

A full complete simplex solver using Gauss method

Linear Programming and Queueing Theory, solved in R and presented as Rmarkdown HTML files.

Shortest Path Faster Algorithm

Dijkstra's algorithm

This is a place where I store my thesis code. The code is about solving the network-flow model by using Cycle-canceling algorithm. The code also includes other algorithms such as Edmond-Karp and Bellman-Ford.

The aim of this project is to analyze demand/supply trends for bike sharing applications in central London. The project is split into two parts a Data Analysis section and an Optimization Model for solving the Bike Reposition Problem.