8 #ifndef CbcFullNodeInfo_H
9 #define CbcFullNodeInfo_H
14 #include "CoinWarmStartBasis.hpp"
15 #include "CoinSearchTree.hpp"
19 class OsiSolverInterface;
20 class OsiSolverBranch;
24 class OsiRowCutDebugger;
25 class CoinWarmStartBasis;
30 class CbcGeneralBranchingObject;
96 int ¤tNumberCuts)
const ;
112 int numberRowsAtContinuous);
123 inline const double *
lower()
const {
128 {
lower_[sequence]=value;}
134 inline const double *
upper()
const {
139 {
upper_[sequence]=value;}
160 #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.
virtual CbcNodeInfo * clone() const
Clone.
void setColUpper(int sequence, double value)
Set a bound.
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.
double * mutableUpper() const
Mutable upper bounds.
Information required to recreate the subproblem at this node.
Information required to recreate the subproblem at this node.
const double * lower() const
Lower bounds.
Simple Branch and bound class.
void addCuts(OsiCuts &cuts, int numberToBranch, int numberPointingToThis)