Follow @solverworld Tweet this
A group at MIT has improved on the cutting plane method for solving optimization problems.
A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization.
56th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, October 18-20, 2015.