Bonmin 1.4trunk
|
#include <BonCbc.hpp>
Public Types | |
enum | MipStatuses { FeasibleOptimal, ProvenInfeasible, Feasible, UnboundedOrInfeasible, NoSolutionKnown, NumMipStats } |
Integer optimization return codes. More... | |
Public Member Functions | |
Bab () | |
Constructor. | |
virtual | ~Bab () |
destructor. | |
virtual void | branchAndBound (BabSetupBase &s) |
Perform a branch-and-bound using given setup. | |
virtual void | operator() (BabSetupBase &s) |
operator() performs the branchAndBound | |
virtual void | operator() (BabSetupBase *s) |
operator() performs the branchAndBound | |
const double * | bestSolution () const |
get the best solution known to the problem (is optimal if MipStatus is FeasibleOptimal). | |
double | bestObj () const |
return objective value of the bestSolution | |
MipStatuses | mipStatus () const |
return Mip Status | |
double | bestBound () |
return the best known lower bound on the objective value | |
int | numNodes () const |
return the total number of nodes explored. | |
int | iterationCount () |
return the total number of iterations in the last mip solved. | |
double | continuousRelaxation () |
returns the value of the continuous relaxation. | |
virtual void | replaceIntegers (OsiObject **objects, int numberObjects) |
virtual callback function to eventually modify objects for integer variable (replace with user set). | |
const CbcModel & | model () const |
Get cbc model used to solve. | |
CbcModel & | model () |
Get cbc model used to solve as non-const, in case we want to change options before things happen. | |
void | setUsingCouenne (bool v) |
Say that algorithm is using Couenne. | |
bool | getUsingCouenne () |
Get value of usingCouenne variable. | |
Protected Attributes | |
double * | bestSolution_ |
Stores the solution of MIP. | |
MipStatuses | mipStatus_ |
Status of the mip solved. | |
double | bestObj_ |
objValue of MIP | |
double | bestBound_ |
best known (lower) bound. | |
double | continuousRelaxation_ |
Continuous relaxation of the problem. | |
int | numNodes_ |
Number of nodes enumerated. | |
int | mipIterationCount_ |
get total number of iterations in last mip solved. | |
CbcModel | model_ |
CbcModel used to solve problem. | |
CoinMessageHandler * | modelHandler_ |
Message handler for CbcModel. | |
OsiObject ** | objects_ |
OsiObjects of the model. | |
int | nObjects_ |
number of objects. | |
bool | usingCouenne_ |
Say if current algorithm is Couenne. |
Definition at line 19 of file BonCbc.hpp.
Integer optimization return codes.
Definition at line 23 of file BonCbc.hpp.
Bonmin::Bab::Bab | ( | ) |
Constructor.
virtual Bonmin::Bab::~Bab | ( | ) | [virtual] |
destructor.
virtual void Bonmin::Bab::branchAndBound | ( | BabSetupBase & | s | ) | [virtual] |
Perform a branch-and-bound using given setup.
virtual void Bonmin::Bab::operator() | ( | BabSetupBase & | s | ) | [virtual] |
operator() performs the branchAndBound
Referenced by operator()().
virtual void Bonmin::Bab::operator() | ( | BabSetupBase * | s | ) | [inline, virtual] |
operator() performs the branchAndBound
Definition at line 42 of file BonCbc.hpp.
References operator()().
const double* Bonmin::Bab::bestSolution | ( | ) | const [inline] |
get the best solution known to the problem (is optimal if MipStatus is FeasibleOptimal).
if no solution is known returns NULL.
Definition at line 47 of file BonCbc.hpp.
References bestSolution_.
double Bonmin::Bab::bestObj | ( | ) | const [inline] |
return objective value of the bestSolution
Definition at line 52 of file BonCbc.hpp.
References bestObj_.
MipStatuses Bonmin::Bab::mipStatus | ( | ) | const [inline] |
double Bonmin::Bab::bestBound | ( | ) |
return the best known lower bound on the objective value
int Bonmin::Bab::numNodes | ( | ) | const [inline] |
return the total number of nodes explored.
Definition at line 66 of file BonCbc.hpp.
References numNodes_.
int Bonmin::Bab::iterationCount | ( | ) | [inline] |
return the total number of iterations in the last mip solved.
Definition at line 71 of file BonCbc.hpp.
References mipIterationCount_.
double Bonmin::Bab::continuousRelaxation | ( | ) | [inline] |
returns the value of the continuous relaxation.
Definition at line 76 of file BonCbc.hpp.
References continuousRelaxation_.
virtual void Bonmin::Bab::replaceIntegers | ( | OsiObject ** | objects, |
int | numberObjects | ||
) | [inline, virtual] |
virtual callback function to eventually modify objects for integer variable (replace with user set).
This is called after CbcModel::findIntegers
Definition at line 83 of file BonCbc.hpp.
const CbcModel& Bonmin::Bab::model | ( | ) | const [inline] |
CbcModel& Bonmin::Bab::model | ( | ) | [inline] |
Get cbc model used to solve as non-const, in case we want to change options before things happen.
Definition at line 93 of file BonCbc.hpp.
References model_.
void Bonmin::Bab::setUsingCouenne | ( | bool | v | ) | [inline] |
Say that algorithm is using Couenne.
Definition at line 98 of file BonCbc.hpp.
References usingCouenne_.
bool Bonmin::Bab::getUsingCouenne | ( | ) | [inline] |
Get value of usingCouenne variable.
Definition at line 104 of file BonCbc.hpp.
References usingCouenne_.
double* Bonmin::Bab::bestSolution_ [protected] |
Stores the solution of MIP.
Definition at line 110 of file BonCbc.hpp.
Referenced by bestSolution().
MipStatuses Bonmin::Bab::mipStatus_ [protected] |
double Bonmin::Bab::bestObj_ [protected] |
double Bonmin::Bab::bestBound_ [protected] |
best known (lower) bound.
Definition at line 117 of file BonCbc.hpp.
double Bonmin::Bab::continuousRelaxation_ [protected] |
Continuous relaxation of the problem.
Definition at line 119 of file BonCbc.hpp.
Referenced by continuousRelaxation().
int Bonmin::Bab::numNodes_ [protected] |
int Bonmin::Bab::mipIterationCount_ [protected] |
get total number of iterations in last mip solved.
Definition at line 123 of file BonCbc.hpp.
Referenced by iterationCount().
CbcModel Bonmin::Bab::model_ [protected] |
CoinMessageHandler* Bonmin::Bab::modelHandler_ [protected] |
Message handler for CbcModel.
Definition at line 127 of file BonCbc.hpp.
OsiObject** Bonmin::Bab::objects_ [protected] |
OsiObjects of the model.
this is not null if and only if there are some non-simple-integer branching objects such as SOS constraints. It is up to Bab to pass them over to appropriate components of the algorithm.
Definition at line 131 of file BonCbc.hpp.
int Bonmin::Bab::nObjects_ [protected] |
number of objects.
Definition at line 133 of file BonCbc.hpp.
bool Bonmin::Bab::usingCouenne_ [protected] |
Say if current algorithm is Couenne.
Definition at line 136 of file BonCbc.hpp.
Referenced by getUsingCouenne(), and setUsingCouenne().