Go to the documentation of this file.
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;
94 int ¤tNumberCuts)
const;
110 int numberRowsAtContinuous);
168 #endif //CbcFullNodeInfo_H
void setColLower(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.
OsiRowCut augmented with bookkeeping.
const double * upper() const
Upper bounds.
double * mutableLower() const
Mutable lower bounds.
void setColUpper(int sequence, double value)
Set a bound.
virtual CbcNodeInfo * buildRowBasis(CoinWarmStartBasis &basis) const
Builds up row basis backwards (until original model).
double * mutableUpper() const
Mutable upper bounds.
virtual CbcNodeInfo * clone() const
Clone.
CoinWarmStartBasis * basis_
Full basis.
CbcFullNodeInfo & operator=(const CbcFullNodeInfo &rhs)
Illegal Assignment operator.
Simple Branch and bound class.
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)
Information required to recreate the subproblem at this node.
const double * lower() const
Lower bounds.
Information required while the node is live.
Information required to recreate the subproblem at this node.
void addCuts(OsiCuts &cuts, int numberToBranch, int numberPointingToThis)