cplex, examples which call cplex(), which solves a variety of optimization problems, including linear programming, mixed integer programming, and quadratic programming.
scip, examples which call scip(), which is a code which solves mixed integer programming and mixed integer nonlinear programming problems.
dio2 is a pair of two diophantine equations in three variables.
The trinity problem seeks the configuration of 4 tiles, each of 36 triangles, to cover a 144 triangle region. The "by hand" problem uses an LP file that was assembled by hand.
The trinity problem seeks the configuration of 4 tiles, each of 36 triangles, to cover a 144 triangle region. The "automatic" problem uses an LP file that was automatically. It uses a different enumeration of configurations and triangles.