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.

[Read More] [Options] [Changes] [Download]

How to use it

ampl: option solver copt; # change the solver
ampl: option copt_options 'option1=value1 option2=value2'; # specify options
ampl: solve; # solve the problem


Full list of solver options: