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