How to Install and Uninstall coin-or-Couenne.x86_64 Package on Fedora 38
Last updated: November 30,2024
1. Install "coin-or-Couenne.x86_64" package
This guide let you learn how to install coin-or-Couenne.x86_64 on Fedora 38
$
sudo dnf update
Copied
$
sudo dnf install
coin-or-Couenne.x86_64
Copied
2. Uninstall "coin-or-Couenne.x86_64" package
This tutorial shows how to uninstall coin-or-Couenne.x86_64 on Fedora 38:
$
sudo dnf remove
coin-or-Couenne.x86_64
Copied
$
sudo dnf autoremove
Copied
3. Information about the coin-or-Couenne.x86_64 package on Fedora 38
Last metadata expiration check: 5:06:42 ago on Sat Mar 16 22:59:57 2024.
Available Packages
Name : coin-or-Couenne
Version : 0.5.8
Release : 11.fc38
Architecture : x86_64
Size : 568 k
Source : coin-or-Couenne-0.5.8-11.fc38.src.rpm
Repository : fedora
Summary : An exact solver for nonconvex MINLPs
URL : https://projects.coin-or.org/Couenne
License : EPL-1.0
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.
Available Packages
Name : coin-or-Couenne
Version : 0.5.8
Release : 11.fc38
Architecture : x86_64
Size : 568 k
Source : coin-or-Couenne-0.5.8-11.fc38.src.rpm
Repository : fedora
Summary : An exact solver for nonconvex MINLPs
URL : https://projects.coin-or.org/Couenne
License : EPL-1.0
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.