Solutions to the classical combinatorial optimization problems. For these programs you need to sdownload LP solver, which is located in my Linear_Programming_Solver repository (https://github.com/Toptachamann/Linear_Programming_Solver). Currently minimum cost flow is solved via both push-relabel method and linear programming, maximum cardinality matching - via both hungarian algorithm (unweighted version) and lp, minimum cost flow and minimum cost matching only using lp.
Toptachamann/Combinatorial_Optimization
Project for solutions to combinatorial optimization problems using classical algorithms and linear programming
Java