#include <CbcCompareDefault.hpp>
Definition at line 30 of file CbcCompareDefault.hpp.
◆ CbcCompareDefault() [1/3]
| CbcCompareDefault::CbcCompareDefault |
( |
| ) |
|
◆ CbcCompareDefault() [2/3]
| CbcCompareDefault::CbcCompareDefault |
( |
double | weight | ) |
|
◆ CbcCompareDefault() [3/3]
◆ ~CbcCompareDefault()
| CbcCompareDefault::~CbcCompareDefault |
( |
| ) |
|
◆ operator=()
◆ clone()
◆ generateCpp()
| virtual void CbcCompareDefault::generateCpp |
( |
FILE * | fp | ) |
|
|
virtual |
Create C++ lines to get to current state.
Reimplemented from CbcCompareBase.
◆ test()
| virtual bool CbcCompareDefault::test |
( |
CbcNode * | , |
|
|
CbcNode * | ) |
|
virtual |
◆ newSolution() [1/2]
| virtual bool CbcCompareDefault::newSolution |
( |
CbcModel * | model, |
|
|
double | objectiveAtContinuous, |
|
|
int | numberInfeasibilitiesAtContinuous ) |
|
virtual |
This allows method to change behavior as it is called after each solution.
Reimplemented from CbcCompareBase.
◆ every1000Nodes()
| virtual bool CbcCompareDefault::every1000Nodes |
( |
CbcModel * | model, |
|
|
int | numberNodes ) |
|
virtual |
This allows method to change behavior Return true if want tree re-sorted.
Reimplemented from CbcCompareBase.
◆ getWeight()
| double CbcCompareDefault::getWeight |
( |
| ) |
const |
|
inline |
◆ setWeight()
| void CbcCompareDefault::setWeight |
( |
double | weight | ) |
|
|
inline |
◆ getCutoff()
| double CbcCompareDefault::getCutoff |
( |
| ) |
const |
|
inline |
◆ setCutoff()
| void CbcCompareDefault::setCutoff |
( |
double | cutoff | ) |
|
|
inline |
◆ getBestPossible()
| double CbcCompareDefault::getBestPossible |
( |
| ) |
const |
|
inline |
◆ setBestPossible()
| void CbcCompareDefault::setBestPossible |
( |
double | bestPossible | ) |
|
|
inline |
◆ setBreadthDepth()
| void CbcCompareDefault::setBreadthDepth |
( |
int | value | ) |
|
|
inline |
◆ startDive()
| void CbcCompareDefault::startDive |
( |
CbcModel * | model | ) |
|
◆ cleanDive()
| void CbcCompareDefault::cleanDive |
( |
| ) |
|
Clean up diving (i.e. switch off or prepare).
◆ newSolution() [2/2]
Reconsider behaviour after discovering a new solution.
This allows any method to change its behaviour. It is called after each solution.
The method should return true if changes are made which will alter the evaluation criteria applied to a node. (So that in cases where the search tree is sorted, it can be properly rebuilt.)
Reimplemented from CbcCompareBase.
Definition at line 45 of file CbcCompareBase.hpp.
◆ weight_
| double CbcCompareDefault::weight_ |
|
protected |
◆ saveWeight_
| double CbcCompareDefault::saveWeight_ |
|
protected |
◆ cutoff_
| double CbcCompareDefault::cutoff_ |
|
protected |
◆ bestPossible_
| double CbcCompareDefault::bestPossible_ |
|
protected |
◆ numberSolutions_
| int CbcCompareDefault::numberSolutions_ |
|
protected |
◆ treeSize_
| int CbcCompareDefault::treeSize_ |
|
protected |
◆ breadthDepth_
| int CbcCompareDefault::breadthDepth_ |
|
protected |
◆ startNodeNumber_
| int CbcCompareDefault::startNodeNumber_ |
|
protected |
◆ afterNodeNumber_
| int CbcCompareDefault::afterNodeNumber_ |
|
protected |
◆ setupForDiving_
| bool CbcCompareDefault::setupForDiving_ |
|
protected |
The documentation for this class was generated from the following file: