The NEOS Server offers Couenne for the solution of
mixed integer nonlinearly constrained optimization problems (MINLPs) in
Couenne solves MINLPs using a reformulation based branch-and-bound algorithm
for a globally optimum solution.
Additional details and options are available in the
user manual for Couenne.
Couenne is developed and maintained by Pietro Belotti and others. Visit the
Couenne page at COIN-OR
for more details.
Using the NEOS Server for Couenne
The user must submit a model in
format to solve a nonlinearly constrained optimization problem.
Examples of models in AMPL format can be found in the
The model is specified by a model file, and optionally,
a data file and a commands file.
If the command file is specified it must contain
the AMPL solve command.
The commands file can contain any AMPL command.
Printing directed to standard out is returned
to the user with the output.
Enter the location of the ampl model (local file)
Enter the location of the ampl data file (local file)
Enter the location of the ampl commands file (local file)
Enter the location of the couenne options file (local file)
Dry run: generate job XML instead of submitting it to NEOS
Short Priority: submit to higher priority queue with maximum CPU time of 5
Please do not click the 'Submit to NEOS' button more than once.