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_;
virtual void allBranchesGone()
Method called when all direct sons have been explored to flush useless warm start information.
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.
(C) Copyright International Business Machines Corporation 2007
virtual CbcNodeInfo * clone() const
Clone.
virtual CbcNodeInfo * clone() const
Clone.
Holds information for recreating a subproblem by incremental change from the parent for.
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.
int getSequenceOfUnsolvedSize()
Number of consecutive unsolved parents only recorded if node is infeasible.
virtual void allBranchesGone()
Method called when all direct sons have been explored to flush useless warm start information.
Holds information for recreating a subproblem by incremental change from the parent for Bonmin.