EvoCut: Automatic generation of acceleration cuts for integer programs via evolutionary search and LLMs.
An implementation for the Simplex algorithm for solving linear optimization problems. This approach covers both Primal and Dual Simplex.
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.
Add a description, image, and links to the cutting-planes topic page so that developers can more easily learn about it.
To associate your repository with the cutting-planes topic, visit your repo's landing page and select "manage topics."