8 #ifndef CbcCompareDefault_H
9 #define CbcCompareDefault_H
57 double objectiveAtContinuous,
58 int numberInfeasibilitiesAtContinuous);
126 #endif //CbcCompareDefault_H
int startNodeNumber_
Chosen node from estimated (-1 is off)
int treeSize_
Tree size (at last check)
double weight_
Weight for each infeasibility.
double bestPossible_
Best possible solution.
void setWeight(double weight)
virtual bool newSolution(CbcModel *)
Reconsider behaviour after discovering a new solution.
int breadthDepth_
Depth above which want to explore first.
CbcCompareDefault()
Default Constructor.
int afterNodeNumber_
Node number when dive started.
virtual bool every1000Nodes(CbcModel *model, int numberNodes)
This allows method to change behavior Return true if want tree re-sorted.
void setBreadthDepth(int value)
Depth above which want to explore first.
virtual bool newSolution(CbcModel *model, double objectiveAtContinuous, int numberInfeasibilitiesAtContinuous)
This allows method to change behavior as it is called after each solution.
void setCutoff(double cutoff)
void cleanDive()
Clean up diving (i.e. switch off or prepare)
virtual void generateCpp(FILE *fp)
Create C++ lines to get to current state.
Information required while the node is live.
double saveWeight_
Weight for each infeasibility - computed from solution.
virtual CbcCompareBase * clone() const
Clone.
bool setupForDiving_
Indicates doing setup for diving.
void setBestPossible(double bestPossible)
int numberSolutions_
Number of solutions.
virtual bool test(CbcNode *x, CbcNode *y)
This is test function.
double getBestPossible() const
Best possible solution.
double getCutoff() const
Cutoff.
CbcCompareDefault & operator=(const CbcCompareDefault &rhs)
Assignment operator.
Simple Branch and bound class.
void startDive(CbcModel *model)
Start dive.