#include <BonHeuristicDiveMIP.hpp>
Public Member Functions | |
| HeuristicDiveMIP (BonminSetup *setup) | |
| Constructor with setup. | |
| HeuristicDiveMIP (const HeuristicDiveMIP ©) | |
| Copy constructor. | |
| ~HeuristicDiveMIP () | |
| Destructor. | |
| HeuristicDiveMIP & | operator= (const HeuristicDiveMIP &rhs) |
| Assignment operator. | |
| virtual CbcHeuristic * | clone () const =0 |
| Clone. | |
| void | Initialize (BonminSetup *setup) |
| Initialize method. | |
| virtual void | resetModel (CbcModel *model) |
| Resets stuff if model changes. | |
| virtual void | setSetup (BonminSetup *setup) |
| Change setup used for heuristic. | |
| virtual int | solution (double &solutionValue, double *betterSolution) |
| Performs heuristic. | |
| virtual void | setInternalVariables (TMINLP2TNLP *minlp)=0 |
| sets internal variables | |
| virtual void | selectVariableToBranch (TMINLP2TNLP *minlp, const vector< int > &integerColumns, const double *newSolution, int &bestColumn, int &bestRound)=0 |
| Selects the next variable to branch on. | |
Protected Attributes | |
| BonminSetup * | setup_ |
| Setup to use for local searches (will make copies). | |
Private Attributes | |
| int | howOften_ |
| How often to do (code can change) | |
| SubMipSolver * | mip_ |
| A subsolver for MIP. | |
Detailed Description
Definition at line 19 of file BonHeuristicDiveMIP.hpp.
Constructor & Destructor Documentation
| Bonmin::HeuristicDiveMIP::HeuristicDiveMIP | ( | BonminSetup * | setup | ) |
Constructor with setup.
| Bonmin::HeuristicDiveMIP::HeuristicDiveMIP | ( | const HeuristicDiveMIP & | copy | ) |
Copy constructor.
| Bonmin::HeuristicDiveMIP::~HeuristicDiveMIP | ( | ) |
Destructor.
Member Function Documentation
| HeuristicDiveMIP& Bonmin::HeuristicDiveMIP::operator= | ( | const HeuristicDiveMIP & | rhs | ) |
Assignment operator.
| virtual CbcHeuristic* Bonmin::HeuristicDiveMIP::clone | ( | ) | const [pure virtual] |
Clone.
Implemented in Bonmin::HeuristicDiveMIPVectorLength, and Bonmin::HeuristicDiveMIPFractional.
| void Bonmin::HeuristicDiveMIP::Initialize | ( | BonminSetup * | setup | ) |
Initialize method.
| virtual void Bonmin::HeuristicDiveMIP::resetModel | ( | CbcModel * | model | ) | [inline, virtual] |
Resets stuff if model changes.
Definition at line 46 of file BonHeuristicDiveMIP.hpp.
| virtual void Bonmin::HeuristicDiveMIP::setSetup | ( | BonminSetup * | setup | ) | [inline, virtual] |
Change setup used for heuristic.
Reimplemented in Bonmin::HeuristicDiveMIPVectorLength, and Bonmin::HeuristicDiveMIPFractional.
Definition at line 51 of file BonHeuristicDiveMIP.hpp.
References setup_.
| virtual int Bonmin::HeuristicDiveMIP::solution | ( | double & | solutionValue, |
| double * | betterSolution | ||
| ) | [virtual] |
Performs heuristic.
| virtual void Bonmin::HeuristicDiveMIP::setInternalVariables | ( | TMINLP2TNLP * | minlp | ) | [pure virtual] |
sets internal variables
Implemented in Bonmin::HeuristicDiveMIPVectorLength, and Bonmin::HeuristicDiveMIPFractional.
| virtual void Bonmin::HeuristicDiveMIP::selectVariableToBranch | ( | TMINLP2TNLP * | minlp, |
| const vector< int > & | integerColumns, | ||
| const double * | newSolution, | ||
| int & | bestColumn, | ||
| int & | bestRound | ||
| ) | [pure virtual] |
Selects the next variable to branch on.
If bestColumn = -1, it means that no variable was found
Implemented in Bonmin::HeuristicDiveMIPVectorLength, and Bonmin::HeuristicDiveMIPFractional.
Member Data Documentation
BonminSetup* Bonmin::HeuristicDiveMIP::setup_ [protected] |
Setup to use for local searches (will make copies).
Definition at line 73 of file BonHeuristicDiveMIP.hpp.
Referenced by setSetup().
int Bonmin::HeuristicDiveMIP::howOften_ [private] |
How often to do (code can change)
Definition at line 77 of file BonHeuristicDiveMIP.hpp.
SubMipSolver* Bonmin::HeuristicDiveMIP::mip_ [private] |
A subsolver for MIP.
Definition at line 79 of file BonHeuristicDiveMIP.hpp.
The documentation for this class was generated from the following file:
