#include <CouenneBab.hpp>
Public Member Functions | |
CouenneBab () | |
Integer optimization return codes. | |
virtual | ~CouenneBab () |
Destructor. | |
void | setProblem (CouenneProblem *p) |
operator() performs the branchAndBound | |
virtual void | branchAndBound (Bonmin::BabSetupBase &s) |
Carry out branch and bound. | |
const double * | bestSolution () const |
operator() performs the branchAndBound | |
double | bestObj () const |
return objective value of the bestSolution | |
double | bestBound () |
return Mip Status | |
Protected Attributes | |
CouenneProblem * | problem_ |
return the total number of nodes explored. |
Definition at line 25 of file CouenneBab.hpp.
CouenneBab::CouenneBab | ( | ) |
Integer optimization return codes.
Constructor.
Constructor
Definition at line 70 of file CouenneBab.cpp.
CouenneBab::~CouenneBab | ( | ) | [virtual] |
Destructor.
Definition at line 90 of file CouenneBab.cpp.
void CouenneBab::setProblem | ( | CouenneProblem * | p | ) |
operator() performs the branchAndBound
Definition at line 109 of file CouenneBab.cpp.
void CouenneBab::branchAndBound | ( | Bonmin::BabSetupBase & | s | ) | [virtual] |
Carry out branch and bound.
Perform a branch-and-bound on given setup.
Reimplemented from Bonmin::Bab.
Definition at line 114 of file CouenneBab.cpp.
const double * CouenneBab::bestSolution | ( | ) | const |
operator() performs the branchAndBound
return the best known lower bound on the objective value
operator() performs the branchAndBound get the best solution known to the problem (is optimal if MipStatus is FeasibleOptimal). if no solution is known returns NULL.
Reimplemented from Bonmin::Bab.
Definition at line 696 of file CouenneBab.cpp.
double CouenneBab::bestObj | ( | ) | const |
return objective value of the bestSolution
Reimplemented from Bonmin::Bab.
Definition at line 706 of file CouenneBab.cpp.
double Couenne::CouenneBab::bestBound | ( | ) | [inline] |
return Mip Status
return the best known lower bound on the objective value
Reimplemented from Bonmin::Bab.
Definition at line 66 of file CouenneBab.hpp.
CouenneProblem* Couenne::CouenneBab::problem_ [protected] |
return the total number of nodes explored.
return the total number of iterations in the last mip solved. returns the value of the continuous relaxation. virtual callback function to eventually modify objects for integer variable (replace with user set). This is called after CbcModel::findIntegers Get cbc model used to solve. Get cbc model used to solve as non-const, in case we want to change options before things happen Say that algorithm is using Couenne. Get value of usingCouenne variable.
Definition at line 118 of file CouenneBab.hpp.