#include <CbcCompareUser.hpp>
Definition at line 17 of file CbcCompareUser.hpp.
◆ CbcCompareUser() [1/3]
| CbcCompareUser::CbcCompareUser |
( |
| ) |
|
◆ CbcCompareUser() [2/3]
| CbcCompareUser::CbcCompareUser |
( |
double |
weight | ) |
|
◆ CbcCompareUser() [3/3]
◆ ~CbcCompareUser()
| CbcCompareUser::~CbcCompareUser |
( |
| ) |
|
◆ operator=()
◆ clone()
◆ test()
◆ alternateTest()
| virtual bool CbcCompareUser::alternateTest |
( |
CbcNode * |
x, |
|
|
CbcNode * |
y |
|
) |
| |
|
virtual |
◆ newSolution()
| virtual bool CbcCompareUser::newSolution |
( |
CbcModel * |
, |
|
|
double |
, |
|
|
int |
|
|
) |
| |
|
virtual |
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.
◆ fullScan()
| virtual bool CbcCompareUser::fullScan |
( |
| ) |
const |
|
virtual |
Returns true if wants code to do scan with alternate criterion.
Reimplemented from CbcCompareBase.
◆ every1000Nodes()
| virtual bool CbcCompareUser::every1000Nodes |
( |
CbcModel * |
model, |
|
|
int |
numberNodes |
|
) |
| |
|
virtual |
◆ getWeight()
| double CbcCompareUser::getWeight |
( |
| ) |
const |
|
inline |
◆ setWeight()
| void CbcCompareUser::setWeight |
( |
double |
weight | ) |
|
|
inline |
◆ weight_
| double CbcCompareUser::weight_ |
|
protected |
◆ saveWeight_
| double CbcCompareUser::saveWeight_ |
|
protected |
◆ numberSolutions_
| int CbcCompareUser::numberSolutions_ |
|
protected |
◆ count_
| int CbcCompareUser::count_ |
|
mutableprotected |
◆ treeSize_
| int CbcCompareUser::treeSize_ |
|
protected |
The documentation for this class was generated from the following file: