polymake in Linear and Integer Programming
Benjamin Assarf, Ewgenij Gawrilow, Katrin Herr, Michael Joswig, Benjamin Lorenz, Andreas Paffenholz, Thomas Rehn · arXiv (Cornell University) · 2014
In integer and linear optimization the software workhorses are solvers for linear programs (based on simplex or interior point methods) as well as generic frameworks for branch-and-bound or branch-and-cut schemes. Comprehensive implementations are available both as Open Source, like SCIP [2], as well as commercial software, like CPLEX [21] and Gurobi