Python code for computation and experimentation with cut-generating functions, in particular the Gomory-Johnson infinite group problem. By M. Köppe, Y. Zhou, C.Y. Hong, J. Wang with contributions by undergrad programmers
An implementation for the Simplex algorithm for solving linear optimization problems. This approach covers both Primal and Dual Simplex.
Cutting-plane methods for JuMP
An exact cutting plane method for the Euclidean max-sum diversity problem
A really simple implementation of simplex algorithm
✂️ Cutting planes separation in Julia with JuMP
Julia package for solving convex programming problems using the Kelley Cutting Plane Method.
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.
Rod cutting optimization problem with greedy 🔨 🔧
Computations supporting Chapters 2 and 3 of Jiawei Wang's dissertation "Subadditivity of Piecewise Linear Functions", UC Davis, Ph.D. program in Mathematics, 2020
A solver for a class of constrained graph clustering problems
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."