#include <CouenneBab.hpp>
Public Member Functions | |
CouenneBab () | |
Constructor. More... | |
virtual | ~CouenneBab () |
Destructor. More... | |
void | setProblem (CouenneProblem *p) |
virtual void | branchAndBound (Bonmin::BabSetupBase &s) |
Carry out branch and bound. More... | |
const double * | bestSolution () const |
Get the best solution known to the problem (is optimal if MipStatus is FeasibleOptimal). More... | |
double | bestObj () const |
Return objective value of the bestSolution. More... | |
double | bestBound () |
return the best known lower bound on the objective value More... | |
![]() | |
Bab () | |
Constructor. More... | |
virtual | ~Bab () |
destructor. More... | |
virtual void | operator() (BabSetupBase &s) |
operator() performs the branchAndBound More... | |
virtual void | operator() (BabSetupBase *s) |
operator() performs the branchAndBound More... | |
const double * | bestSolution () const |
get the best solution known to the problem (is optimal if MipStatus is FeasibleOptimal). More... | |
double | bestObj () const |
return objective value of the bestSolution More... | |
MipStatuses | mipStatus () const |
return Mip Status More... | |
double | bestBound () |
return the best known lower bound on the objective value More... | |
int | numNodes () const |
return the total number of nodes explored. More... | |
int | iterationCount () |
return the total number of iterations in the last mip solved. More... | |
double | continuousRelaxation () |
returns the value of the continuous relaxation. More... | |
virtual void | replaceIntegers (OsiObject **objects, int numberObjects) |
virtual callback function to eventually modify objects for integer variable (replace with user set). More... | |
const CbcModel & | model () const |
Get cbc model used to solve. More... | |
CbcModel & | model () |
Get cbc model used to solve as non-const, in case we want to change options before things happen. More... | |
Protected Attributes | |
CouenneProblem * | problem_ |
![]() | |
double * | bestSolution_ |
Stores the solution of MIP. More... | |
MipStatuses | mipStatus_ |
Status of the mip solved. More... | |
double | bestObj_ |
objValue of MIP More... | |
double | bestBound_ |
best known (lower) bound. More... | |
double | continuousRelaxation_ |
Continuous relaxation of the problem. More... | |
int | numNodes_ |
Number of nodes enumerated. More... | |
int | mipIterationCount_ |
get total number of iterations in last mip solved. More... | |
CbcModel | model_ |
CbcModel used to solve problem. More... | |
CoinMessageHandler * | modelHandler_ |
Message handler for CbcModel. More... | |
OsiObject ** | objects_ |
OsiObjects of the model. More... | |
int | nObjects_ |
number of objects. More... | |
Additional Inherited Members | |
![]() | |
enum | MipStatuses { FeasibleOptimal, ProvenInfeasible, Feasible, UnboundedOrInfeasible, NoSolutionKnown, NumMipStats } |
Integer optimization return codes. More... | |
Definition at line 21 of file CouenneBab.hpp.
CouenneBab::CouenneBab | ( | ) |
Constructor.
Definition at line 74 of file CouenneBab.cpp.
|
virtual |
Destructor.
Definition at line 77 of file CouenneBab.cpp.
void CouenneBab::setProblem | ( | CouenneProblem * | p | ) |
Definition at line 79 of file CouenneBab.cpp.
|
virtual |
Carry out branch and bound.
Perform a branch-and-bound on given setup.
Reimplemented from Bonmin::Bab.
Definition at line 84 of file CouenneBab.cpp.
const double * CouenneBab::bestSolution | ( | ) | const |
Get the best solution known to the problem (is optimal if MipStatus is FeasibleOptimal).
If no solution is known returns NULL.
Definition at line 681 of file CouenneBab.cpp.
double CouenneBab::bestObj | ( | ) | const |
Return objective value of the bestSolution.
Definition at line 691 of file CouenneBab.cpp.
|
inline |
return the best known lower bound on the objective value
Definition at line 42 of file CouenneBab.hpp.
|
protected |
Definition at line 46 of file CouenneBab.hpp.