Bonmin 1.8.9
|
#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. | |
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. | |
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 |
destructor.
|
virtual |
Perform a branch-and-bound using given setup.
|
virtual |
operator() performs the branchAndBound
|
inlinevirtual |
operator() performs the branchAndBound
Definition at line 42 of file BonCbc.hpp.
|
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.
|
inline |
return objective value of the bestSolution
Definition at line 52 of file BonCbc.hpp.
|
inline |
return Mip Status
Definition at line 58 of file BonCbc.hpp.
double Bonmin::Bab::bestBound | ( | ) |
return the best known lower bound on the objective value
|
inline |
return the total number of nodes explored.
Definition at line 67 of file BonCbc.hpp.
|
inline |
return the total number of iterations in the last mip solved.
Definition at line 72 of file BonCbc.hpp.
|
inline |
returns the value of the continuous relaxation.
Definition at line 77 of file BonCbc.hpp.
|
inlinevirtual |
virtual callback function to eventually modify objects for integer variable (replace with user set).
This is called after CbcModel::findIntegers
Definition at line 84 of file BonCbc.hpp.
|
inline |
Get cbc model used to solve.
Definition at line 87 of file BonCbc.hpp.
|
inline |
Get cbc model used to solve as non-const, in case we want to change options before things happen.
Definition at line 94 of file BonCbc.hpp.
|
protected |
Stores the solution of MIP.
Definition at line 101 of file BonCbc.hpp.
|
protected |
Status of the mip solved.
Definition at line 104 of file BonCbc.hpp.
|
protected |
objValue of MIP
Definition at line 106 of file BonCbc.hpp.
|
protected |
best known (lower) bound.
Definition at line 108 of file BonCbc.hpp.
|
protected |
Continuous relaxation of the problem.
Definition at line 110 of file BonCbc.hpp.
|
protected |
Number of nodes enumerated.
Definition at line 112 of file BonCbc.hpp.
|
protected |
get total number of iterations in last mip solved.
Definition at line 114 of file BonCbc.hpp.
|
protected |
CbcModel used to solve problem.
Definition at line 116 of file BonCbc.hpp.
|
protected |
Message handler for CbcModel.
Definition at line 118 of file BonCbc.hpp.
|
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 122 of file BonCbc.hpp.
|
protected |
number of objects.
Definition at line 124 of file BonCbc.hpp.