8 #ifndef CbcPartialNodeInfo_H
9 #define CbcPartialNodeInfo_H
14 #include "CoinWarmStartBasis.hpp"
15 #include "CoinSearchTree.hpp"
19 class OsiSolverInterface;
20 class OsiSolverBranch;
24 class OsiRowCutDebugger;
25 class CoinWarmStartBasis;
30 class CbcGeneralBranchingObject;
50 int ¤tNumberCuts)
const ;
53 virtual int applyBounds(
int iColumn,
double & lower,
double & upper,
int force) ;
65 const double * boundChanges,
109 #endif //CbcPartialNodeInfo_H
int numberChangedBounds() const
Number of bound changes.
virtual CbcNodeInfo * buildRowBasis(CoinWarmStartBasis &basis) const
Builds up row basis backwards (until original model).
virtual void applyToModel(CbcModel *model, CoinWarmStartBasis *&basis, CbcCountRowCut **addCuts, int ¤tNumberCuts) const
Modify model according to information at node.
const CbcNode * owner() const
int numberChangedBounds_
Number of bound changes.
const int * variables() const
Which variable (top bit if upper bound changing)
Holds information for recreating a subproblem by incremental change from the parent.
const CoinWarmStartDiff * basisDiff() const
Basis diff information.
CbcNodeInfo * parent() const
Parent of this.
int * variables_
Which variable (top bit if upper bound changing)
CoinWarmStartDiff * basisDiff_
Basis diff information.
OsiRowCut augmented with bookkeeping.
Information required while the node is live.
Information required to recreate the subproblem at this node.
const double * newBounds() const
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) ...
Simple Branch and bound class.
virtual CbcNodeInfo * clone() const
Clone.
void addCuts(OsiCuts &cuts, int numberToBranch, int numberPointingToThis)