#include <CoinSearchTree.hpp>
Definition at line 450 of file CoinSearchTree.hpp.
◆ CoinSearchTreeManager() [1/4]
◆ CoinSearchTreeManager() [2/4]
CoinSearchTreeManager::CoinSearchTreeManager |
( |
| ) |
|
|
inline |
◆ ~CoinSearchTreeManager() [1/2]
virtual CoinSearchTreeManager::~CoinSearchTreeManager |
( |
| ) |
|
|
inlinevirtual |
◆ CoinSearchTreeManager() [3/4]
◆ CoinSearchTreeManager() [4/4]
CoinSearchTreeManager::CoinSearchTreeManager |
( |
| ) |
|
|
inline |
◆ ~CoinSearchTreeManager() [2/2]
virtual CoinSearchTreeManager::~CoinSearchTreeManager |
( |
| ) |
|
|
inlinevirtual |
◆ operator=() [1/2]
◆ setTree() [1/2]
◆ getTree() [1/2]
◆ empty() [1/2]
bool CoinSearchTreeManager::empty |
( |
| ) |
const |
|
inline |
◆ size() [1/2]
size_t CoinSearchTreeManager::size |
( |
| ) |
const |
|
inline |
◆ numInserted() [1/2]
size_t CoinSearchTreeManager::numInserted |
( |
| ) |
const |
|
inline |
◆ top() [1/2]
◆ pop() [1/2]
void CoinSearchTreeManager::pop |
( |
| ) |
|
|
inline |
◆ push() [1/6]
void CoinSearchTreeManager::push |
( |
CoinTreeNode * |
node, |
|
|
const bool |
incrInserted = true |
|
) |
| |
|
inline |
◆ push() [2/6]
void CoinSearchTreeManager::push |
( |
const CoinTreeSiblings & |
s, |
|
|
const bool |
incrInserted = true |
|
) |
| |
|
inline |
◆ push() [3/6]
void CoinSearchTreeManager::push |
( |
const int |
n, |
|
|
CoinTreeNode ** |
nodes, |
|
|
const bool |
incrInserted = true |
|
) |
| |
|
inline |
◆ bestQualityCandidate() [1/2]
CoinTreeNode* CoinSearchTreeManager::bestQualityCandidate |
( |
| ) |
const |
|
inline |
◆ bestQuality() [1/2]
double CoinSearchTreeManager::bestQuality |
( |
| ) |
const |
|
inline |
◆ newSolution() [1/2]
void CoinSearchTreeManager::newSolution |
( |
double |
solValue | ) |
|
◆ reevaluateSearchStrategy() [1/2]
void CoinSearchTreeManager::reevaluateSearchStrategy |
( |
| ) |
|
◆ operator=() [2/2]
◆ setTree() [2/2]
◆ getTree() [2/2]
◆ empty() [2/2]
bool CoinSearchTreeManager::empty |
( |
| ) |
const |
|
inline |
◆ size() [2/2]
size_t CoinSearchTreeManager::size |
( |
| ) |
const |
|
inline |
◆ numInserted() [2/2]
size_t CoinSearchTreeManager::numInserted |
( |
| ) |
const |
|
inline |
◆ top() [2/2]
◆ pop() [2/2]
void CoinSearchTreeManager::pop |
( |
| ) |
|
|
inline |
◆ push() [4/6]
void CoinSearchTreeManager::push |
( |
CoinTreeNode * |
node, |
|
|
const bool |
incrInserted = true |
|
) |
| |
|
inline |
◆ push() [5/6]
void CoinSearchTreeManager::push |
( |
const CoinTreeSiblings & |
s, |
|
|
const bool |
incrInserted = true |
|
) |
| |
|
inline |
◆ push() [6/6]
void CoinSearchTreeManager::push |
( |
const int |
n, |
|
|
CoinTreeNode ** |
nodes, |
|
|
const bool |
incrInserted = true |
|
) |
| |
|
inline |
◆ bestQualityCandidate() [2/2]
CoinTreeNode* CoinSearchTreeManager::bestQualityCandidate |
( |
| ) |
const |
|
inline |
◆ bestQuality() [2/2]
double CoinSearchTreeManager::bestQuality |
( |
| ) |
const |
|
inline |
◆ newSolution() [2/2]
void CoinSearchTreeManager::newSolution |
( |
double |
solValue | ) |
|
◆ reevaluateSearchStrategy() [2/2]
void CoinSearchTreeManager::reevaluateSearchStrategy |
( |
| ) |
|
◆ candidates_
◆ numSolution
int CoinSearchTreeManager::numSolution |
|
private |
◆ hasUB_
bool CoinSearchTreeManager::hasUB_ |
|
private |
Whether there is an upper bound or not.
The upper bound may have come as input, not necessarily from a solution
Definition at line 460 of file CoinSearchTree.hpp.
◆ recentlyReevaluatedSearchStrategy_
bool CoinSearchTreeManager::recentlyReevaluatedSearchStrategy_ |
|
private |
variable used to test whether we need to reevaluate search strategy
Definition at line 463 of file CoinSearchTree.hpp.
The documentation for this class was generated from the following file: