Cardinal Optimizer (COPT) incorporates a full suite of solvers for linear and convex quadratic mixed-integer programming. It ranks at the top of benchmark tests on continuous linear programs, and has been fully extended to handle integer variables.
Developer: Cardinal Operations
Current version: 4.0.5
Problem types supported: Linear and convex quadratic optimization in continuous and integer variables.
Algorithms available: For continuous problems, primal and dual simplex, interior-point (barrier); for integer problems, branch-and-bound with presolve, feasibility heuristics, and cut generators.