Couenne 0.5.8
|
#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 () | |
virtual | ~Bab () |
virtual void | branchAndBound (BabSetupBase &s) |
virtual void | operator() (BabSetupBase &s) |
virtual void | operator() (BabSetupBase *s) |
const double * | bestSolution () const |
double | bestObj () const |
MipStatuses | mipStatus () const |
double | bestBound () |
int | numNodes () const |
int | iterationCount () |
double | continuousRelaxation () |
virtual void | replaceIntegers (OsiObject **objects, int numberObjects) |
const CbcModel & | model () const |
CbcModel & | model () |
Protected Attributes | |
CouenneProblem * | problem_ |
![]() | |
double * | bestSolution_ |
MipStatuses | mipStatus_ |
double | bestObj_ |
double | bestBound_ |
double | continuousRelaxation_ |
int | numNodes_ |
int | mipIterationCount_ |
CbcModel | model_ |
CoinMessageHandler * | modelHandler_ |
OsiObject ** | objects_ |
int | nObjects_ |
Additional Inherited Members | |
![]() | |
enum | MipStatuses |
![]() | |
FeasibleOptimal | |
ProvenInfeasible | |
Feasible | |
UnboundedOrInfeasible | |
NoSolutionKnown | |
NumMipStats | |
Definition at line 21 of file CouenneBab.hpp.
Couenne::CouenneBab::CouenneBab | ( | ) |
Constructor.
|
virtual |
Destructor.
void Couenne::CouenneBab::setProblem | ( | CouenneProblem * | p | ) |
|
virtual |
Carry out branch and bound.
Reimplemented from Bonmin::Bab.
const double * Couenne::CouenneBab::bestSolution | ( | ) | const |
Get the best solution known to the problem (is optimal if MipStatus is FeasibleOptimal).
If no solution is known returns NULL.
double Couenne::CouenneBab::bestObj | ( | ) | const |
Return objective value of the bestSolution.
|
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.