6 #ifndef CbcBranchFollowOn2_H 
    7 #define CbcBranchFollowOn2_H 
   58     int &effectiveRhs) 
const;
 
Abstract branching object base class Now just difference with OsiBranchingObject. ...
CoinPackedMatrix matrix_
data Matrix 
CbcFollowOn2 & operator=(const CbcFollowOn2 &rhs)
virtual void feasibleRegion()
This looks at solution and sets bounds to contain solution. 
virtual int gutsOfFollowOn2(int &otherRow, int &preferredWay, int &effectiveRhs) const 
As some computation is needed in more than one place - returns row. 
virtual CbcObject * clone() const 
Clone. 
virtual CbcBranchingObject * createBranch(int way)
Creates a branching object. 
int maximumRhs() const 
get and set for maximum rhws (affects cuts as branch) 
Sparse Matrix Base Class. 
double infeasibility() const 
Return infeasibility. 
Define a follow on class. 
int preferredWay() const 
If -1 down always chosen first, +1 up always, 0 normal. 
void setMaximumRhs(int value)
int * rhs_
Possible rhs (if 0 then not possible) 
CoinPackedMatrix matrixByRow_
Matrix by row. 
CbcModel * model() const 
Return model. 
int maximumRhs_
If >1 then allow cuts if effective rhs <= this. 
Simple Branch and bound class.