[Bug 894606] New: Review Request: coin-or-Couenne -Couenne, an exact solver for nonconvex MINLPs
by Red Hat Bugzilla
Product: Fedora
https://bugzilla.redhat.com/show_bug.cgi?id=894606
Bug ID: 894606
Summary: Review Request: coin-or-Couenne -Couenne, an exact
solver for nonconvex MINLPs
Product: Fedora
Version: rawhide
Component: Package Review
Severity: medium
Priority: medium
Reporter: paulo.cesar.pereira.de.andrade(a)gmail.com
Spec URL: http://pcpa.fedorapeople.org/coin-or/coin-or-Couenne.spec
SRPM URL:
http://pcpa.fedorapeople.org/coin-or/coin-or-Couenne-0.4.3-1.fc19.src.rpm
Description: 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.
Fedora Account System Username: pcpa
--
You are receiving this mail because:
You are on the CC list for the bug.
Unsubscribe from this bug https://bugzilla.redhat.com/token.cgi?t=7Zt1atXBrD&a=cc_unsubscribe
7 years, 3 months
[Bug 894602] New: Review Request: coin-or-Dip - Decomposition for Integer Programming
by Red Hat Bugzilla
Product: Fedora
https://bugzilla.redhat.com/show_bug.cgi?id=894602
Bug ID: 894602
Summary: Review Request: coin-or-Dip - Decomposition for
Integer Programming
Product: Fedora
Version: rawhide
Component: Package Review
Severity: medium
Priority: medium
Reporter: paulo.cesar.pereira.de.andrade(a)gmail.com
Spec URL: http://pcpa.fedorapeople.org/coin-or/coin-or-Dip.spec
SRPM URL:
http://pcpa.fedorapeople.org/coin-or/coin-or-Dip-0.83.2-3.fc19.src.rpm
Description: DIP (Decomposition for Integer Programming) is an open-source
extensible
software framework for implementing decomposition-based bounding algorithms
for use in solving large-scale discrete optimization problems. The framework
provides a simple API for experimenting with various decomposition-based
algorithms, such as Dantzig-Wolfe decomposition, Lagrangian relaxation,
and various cutting plane methods. Given a compact formulation and a
relaxation, the framework takes care of all algorithmic details associated
with implementing any of a wide range of decomposition-based algorithms,
such as branch and cut, branch and price, branch and cut and price,
subgradient-based Lagrangian relaxation, branch and relax and cut, and
decompose and cut. The user can specify customizations, such as methods
for generating valid inequalities and branching, in terms of the variables
of the compact formulation, without having to worry about the details of
any required reformulations.
Fedora Account System Username: pcpa
--
You are receiving this mail because:
You are on the CC list for the bug.
Unsubscribe from this bug https://bugzilla.redhat.com/token.cgi?t=jSeO3QWpQZ&a=cc_unsubscribe
7 years, 3 months