Go to the documentation of this file.
11 #ifndef BonminCbcNode_H
12 #define BonminCbcNode_H
14 #include "CbcNode.hpp"
46 virtual CbcNodeInfo *
clone()
const;
55 return sequenceOfInfeasiblesSize_;
60 return sequenceOfUnsolvedSize_;
68 int sequenceOfInfeasiblesSize_;
70 int sequenceOfUnsolvedSize_;
94 int numberChangedBounds,
const int * variables,
95 const double * boundChanges,
105 virtual CbcNodeInfo *
clone()
const;
114 return sequenceOfInfeasiblesSize_;
119 return sequenceOfUnsolvedSize_;
124 int sequenceOfInfeasiblesSize_;
126 int sequenceOfUnsolvedSize_;
Holds information for recreating a subproblem by incremental change from the parent for Bonmin.
int getSequenceOfInfeasiblesSize()
Number of consecutive infeasible parents only recorded if node is infeasible.
static void registerOptions(Ipopt::SmartPtr< Bonmin::RegisteredOptions > roptions)
Register all the options for class instance.
Holds information for recreating a subproblem by incremental change from the parent for.
(C) Copyright International Business Machines Corporation 2007
virtual CbcNodeInfo * clone() const
Clone.
virtual void allBranchesGone()
Method called when all direct sons have been explored to flush useless warm start information.
virtual void allBranchesGone()
Method called when all direct sons have been explored to flush useless warm start information.
BonCbcPartialNodeInfo(CbcModel *model, CbcNodeInfo *parent, CbcNode *owner, int numberChangedBounds, const int *variables, const double *boundChanges, const CoinWarmStartDiff *basisDiff)
BonCbcPartialNodeInfo(const BonCbcPartialNodeInfo &)
BonCbcFullNodeInfo(const BonCbcFullNodeInfo &)
BonCbcFullNodeInfo(CbcModel *model, int numberRowsAtContinuous)
int getSequenceOfUnsolvedSize()
Number of consecutive unsolved parents only recorded if node is infeasible.
virtual CbcNodeInfo * clone() const
Clone.
int getSequenceOfUnsolvedSize()
Number of consecutive unsolved parents only recorded if node is infeasible.
int getSequenceOfInfeasiblesSize()
Number of consecutive infeasible parents only recorded if node is infeasible.