Bonmin 1.8.9
Loading...
Searching...
No Matches
Public Member Functions | List of all members
Bonmin::DiverCompare Class Reference

#include <BonDiver.hpp>

+ Inheritance diagram for Bonmin::DiverCompare:
+ Collaboration diagram for Bonmin::DiverCompare:

Public Member Functions

 DiverCompare ()
 
virtual ~DiverCompare ()
 
 DiverCompare (const DiverCompare &rhs)
 
DiverCompareoperator= (const DiverCompare &rhs)
 
virtual CbcCompareBase * clone () const
 Clone.
 
virtual bool test (CbcNode *x, CbcNode *y)
 This is test function.
 
virtual bool newSolution (CbcModel *model)
 Called after each new solution.
 
virtual bool newSolution (CbcModel *model, double objectiveAtContinuous, int numberInfeasibilitiesAtContinuous)
 Called after each new solution.
 
virtual bool every1000Nodes (CbcModel *model, int numberNodes)
 Called 1000 nodes.
 
void setDiver (CbcDfsDiver *diver)
 Set the dfs diver to use.
 
void setNumberSolToStopDive (int val)
 Set numberSolToStopDive_.
 
void setNumberNodesToLimitTreeSize (int val)
 Set numberNodesToLimitTreeSize_.
 
void setComparisonDive (const CbcCompareBase &val)
 Set comparison method when diving.
 
void setComparisonBound (const CbcCompareBase &val)
 Set comparison method when closing bound.
 

Detailed Description

Definition at line 309 of file BonDiver.hpp.

Constructor & Destructor Documentation

◆ DiverCompare() [1/2]

Bonmin::DiverCompare::DiverCompare ( )
inline

Definition at line 313 of file BonDiver.hpp.

◆ ~DiverCompare()

virtual Bonmin::DiverCompare::~DiverCompare ( )
inlinevirtual

Definition at line 323 of file BonDiver.hpp.

◆ DiverCompare() [2/2]

Bonmin::DiverCompare::DiverCompare ( const DiverCompare & rhs)
inline

Definition at line 330 of file BonDiver.hpp.

Member Function Documentation

◆ operator=()

DiverCompare & Bonmin::DiverCompare::operator= ( const DiverCompare & rhs)
inline

Definition at line 340 of file BonDiver.hpp.

◆ clone()

virtual CbcCompareBase * Bonmin::DiverCompare::clone ( ) const
inlinevirtual

Clone.

Definition at line 358 of file BonDiver.hpp.

◆ test()

virtual bool Bonmin::DiverCompare::test ( CbcNode * x,
CbcNode * y )
virtual

This is test function.

◆ newSolution() [1/2]

virtual bool Bonmin::DiverCompare::newSolution ( CbcModel * model)
virtual

Called after each new solution.

◆ newSolution() [2/2]

virtual bool Bonmin::DiverCompare::newSolution ( CbcModel * model,
double objectiveAtContinuous,
int numberInfeasibilitiesAtContinuous )
virtual

Called after each new solution.

◆ every1000Nodes()

virtual bool Bonmin::DiverCompare::every1000Nodes ( CbcModel * model,
int numberNodes )
virtual

Called 1000 nodes.

Return true if want tree re-sorted.

◆ setDiver()

void Bonmin::DiverCompare::setDiver ( CbcDfsDiver * diver)
inline

Set the dfs diver to use.

Definition at line 379 of file BonDiver.hpp.

◆ setNumberSolToStopDive()

void Bonmin::DiverCompare::setNumberSolToStopDive ( int val)
inline

Set numberSolToStopDive_.

Definition at line 385 of file BonDiver.hpp.

◆ setNumberNodesToLimitTreeSize()

void Bonmin::DiverCompare::setNumberNodesToLimitTreeSize ( int val)
inline

Set numberNodesToLimitTreeSize_.

Definition at line 391 of file BonDiver.hpp.

◆ setComparisonDive()

void Bonmin::DiverCompare::setComparisonDive ( const CbcCompareBase & val)
inline

Set comparison method when diving.

Definition at line 397 of file BonDiver.hpp.

◆ setComparisonBound()

void Bonmin::DiverCompare::setComparisonBound ( const CbcCompareBase & val)
inline

Set comparison method when closing bound.

Definition at line 402 of file BonDiver.hpp.


The documentation for this class was generated from the following file: