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