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
EvoCut: Automatic generation of acceleration cuts for integer programs via evolutionary search and LLMs.
Branch-and-cut solver for the Capacitated Profitable Tour Problem (CPTP) and open s–t path variants
An implementation for the Simplex algorithm for solving linear optimization problems. This approach covers both Primal and Dual Simplex.
The Cutting Plane Game v2 - My CS thesis project
Cutting-plane methods for JuMP
MATLAB implementation of a branch-and-cut algorithm for the Asymmetric Travelling Salesman Problem (ATSP), using the Gurobi solver with degree constraints and subtour-elimination constraints separated via an integer-programming (ILP) separation problem. Operations research / integer programming.
A from-scratch branch-and-cut MIP solver in C++23 with Python bindings (early development)
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
Interactive C++/OpenGL tool for exploded-view visualization of NIfTI volume data using Marching Cubes, cutting planes, and edge-enhanced rendering.
Computations supporting Chapters 2 and 3 of Jiawei Wang's dissertation "Subadditivity of Piecewise Linear Functions", UC Davis, Ph.D. program in Mathematics, 2020
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.
Julia package for solving convex programming problems using the Kelley Cutting Plane Method.
Egyszerű, statikus, GitHub Pages-kompatibilis webalkalmazás téglalap alakú táblák / lemezek optimalizált felosztásához.
Rod cutting optimization problem with greedy 🔨 🔧
A solver for a class of constrained graph clustering problems
To associate your repository with the cutting-planes topic, visit your repo's landing page and select "manage topics."