14 #include "CbcModel.hpp" CbcModel & model()
Get cbc model used to solve as non-const, in case we want to change options before things happen.
int nObjects_
number of objects.
double * bestSolution_
Stores the solution of MIP.
double bestObj() const
return objective value of the bestSolution
virtual void operator()(BabSetupBase &s)
operator() performs the branchAndBound
double continuousRelaxation()
returns the value of the continuous relaxation.
(C) Copyright International Business Machines Corporation 2007
Problem has been proven to be infeasible.
MipStatuses mipStatus() const
return Mip Status
No feasible solution to the problem is known.
int mipIterationCount_
get total number of iterations in last mip solved.
CbcModel model_
CbcModel used to solve problem.
CoinMessageHandler * modelHandler_
Message handler for CbcModel.
double bestObj_
objValue of MIP
MipStatuses mipStatus_
Status of the mip solved.
double continuousRelaxation_
Continuous relaxation of the problem.
Optimum solution has been found and its optimality proved.
A class to have all elements necessary to setup a branch-and-bound.
OsiObject ** objects_
OsiObjects of the model.
double bestBound_
best known (lower) bound.
virtual void replaceIntegers(OsiObject **objects, int numberObjects)
virtual callback function to eventually modify objects for integer variable (replace with user set).
virtual void branchAndBound(BabSetupBase &s)
Perform a branch-and-bound using given setup.
MipStatuses
Integer optimization return codes.
double bestBound()
return the best known lower bound on the objective value
An integer solution to the problem has been found.
int iterationCount()
return the total number of iterations in the last mip solved.
int numNodes() const
return the total number of nodes explored.
int numNodes_
Number of nodes enumerated.
const CbcModel & model() const
Get cbc model used to solve.
virtual void operator()(BabSetupBase *s)
operator() performs the branchAndBound
virtual ~Bab()
destructor.
const double * bestSolution() const
get the best solution known to the problem (is optimal if MipStatus is FeasibleOptimal).