LogoopenSUSE Build Service > Projects
Sign Up | Log In

An exact solver for nonconvex MINLPs

Couenne (Convex Over and Under ENvelopes for Nonlinear Estimation) is a
branch&bound algorithm to solve Mixed-Integer Nonlinear Programming (MINLP)
problems of the form:
      min f0(x,y)
             fi(x,y) <= 0     i=1,2..., m
             x in Rn, y in Zp

where all fi(x,y) are, in general, nonlinear functions.

Couenne aims at finding global optima of nonconvex MINLPs. It implements
linearization, bound reduction, and branching methods within a
branch-and-bound framework. Its main components are:

  * an expression library;
  * separation of linearization cuts;
  * branching rules;
  * bound tightening methods.

Source Files

Filename Size Changed Actions
Couenne-0.5.3.tgz 1.02 MB Download File
Couenne-docdir.patch 1 KB Download File
Couenne-gcc6.patch 546 Bytes Download File
mingw32-Couenne.spec 3.82 KB Download File

Comments for home:kelman:mingw-coinor (0)

Login required, please login or signup in order to comment