8 #ifndef CbcFullNodeInfo_H 
    9 #define CbcFullNodeInfo_H 
   30 class CbcGeneralBranchingObject;
 
   94     int ¤tNumberCuts) 
const;
 
  110     int numberRowsAtContinuous);
 
  168 #endif //CbcFullNodeInfo_H 
virtual CbcNodeInfo * buildRowBasis(CoinWarmStartBasis &basis) const 
Builds up row basis backwards (until original model). 
 
void setColLower(int sequence, double value)
Set a bound. 
 
CoinWarmStartBasis * basis_
Full basis. 
 
double * mutableLower() const 
Mutable lower bounds. 
 
Collections of row cuts and column cuts. 
 
The default COIN simplex (basis-oriented) warm start class. 
 
virtual CbcNodeInfo * clone() const 
Clone. 
 
void setColUpper(int sequence, double value)
Set a bound. 
 
Abstract Base Class for describing an interface to a solver. 
 
virtual int applyBounds(int iColumn, double &lower, double &upper, int force)
Just apply bounds to one variable - force means overwrite by lower,upper (1=>infeasible) ...
 
virtual void applyToModel(CbcModel *model, CoinWarmStartBasis *&basis, CbcCountRowCut **addCuts, int ¤tNumberCuts) const 
Modify model according to information at node. 
 
OsiRowCut augmented with bookkeeping. 
 
Information required while the node is live. 
 
const double * upper() const 
Upper bounds. 
 
CbcFullNodeInfo & operator=(const CbcFullNodeInfo &rhs)
Illegal Assignment operator. 
 
double * mutableUpper() const 
Mutable upper bounds. 
 
Information required to recreate the subproblem at this node. 
 
Information required to recreate the subproblem at this node. 
 
Validate cuts against a known solution. 
 
const double * lower() const 
Lower bounds. 
 
Simple Branch and bound class. 
 
void addCuts(OsiCuts &cuts, int numberToBranch, int numberPointingToThis)