3 #ifndef BonChooseVariable_H 4 #define BonChooseVariable_H 7 #ifdef BONMIN_CURVATURE_BRANCHING 16 #define OLD_USEFULLNESS 49 return infeasibilities_[1];
54 return infeasibilities_[0];
61 infeasibilities_[1] =
x;
67 infeasibilities_[0] =
x;
98 int numberToDo,
int returnCriterion);
99 #ifndef OLD_USEFULLNESS 101 enum CandidateSortCriterion {
190 const double upMult,
const double dowMult,
193 double& value2)
const;
232 double changeInObjective,
double changeInValue,
324 #ifndef OLD_USEFULLNESS 326 CandidateSortCriterion sortCrit_;
All done no variable can be fixed.
Normal termination, found a variable to branch on.
virtual bool isIterationLimitReached() const=0
int trustStrongForPseudoCosts_
Wether or not to trust strong branching results for updating pseudo costs.
void passInMessageHandler(CoinMessageHandler *handler)
double maxmin_crit_no_sol_
maxmin weight in branching decision when no solution has been found yet
virtual int chooseVariable(OsiSolverInterface *solver, OsiBranchingInformation *info, bool fixVariables)
Choose a variable Returns - -1 Node is infeasible 0 Normal termination - we have a candidate 1 All lo...
void setDownInfeasibility(double x)
Set the down infeasibility.
int numberBeforeTrustedList_
number of times a branch has to happen so that it is trusted in setupList
vector< HotInfo > results_
Stores strong branching results.
BonChooseVariable & operator=(const BonChooseVariable &rhs)
Assignment operator.
const OsiPseudoCosts & pseudoCosts() const
Access to pseudo costs storage.
Interupted because of time limit.
int numberBranches() const
int bb_log_level_
verbosity level
virtual int doStrongBranching(OsiSolverInterface *solver, OsiBranchingInformation *info, int numberToDo, int returnCriterion)
This is a utility function which does strong branching on a list of objects and stores the results in...
void computeMultipliers(double &upMult, double &downMult) const
bool isRootNode(const OsiBranchingInformation *info) const
detecting if this is root node
(C) Copyright International Business Machines Corporation 2007
Found variable to fix and also has a (non-strong) branching candidate.
Messages messages_
Messages.
int updateInformation(const OsiSolverInterface *solver, const OsiBranchingInformation *info, OsiChooseVariable *choose)
Fill in some usefull information after a strong branching is done:
virtual ~BonChooseVariable()
Destructor.
Can fix variables but does not have strong branching candidates.
void setOnlyPseudoWhenTrusted(bool only_pseudo_when_trusted)
Ipopt::SmartPtr< Ipopt::Journalist > jnlst_
Holding on the a pointer to the journalist.
CbcModel * cbc_model_
CbcModel, used to get status of search.
int minNumberStrongBranch_
Always strong branch that many first candidate in the list regardless of numberTrusted.
Child is proven feasible.
This class chooses a variable to branch on.
HotInfo()
Default constructor.
OsiBranchingObject * branchingObject_
double computeUsefulness(const double MAXMIN_CRITERION, const double upMult, const double dowMult, const double value, const OsiObject *object, int i, double &value2) const
OsiPseudoCosts pseudoCosts_
Stores the pseudo costs.
int numberLookAhead_
number of look-ahead strong-branching steps
int number_not_trusted_
Number of variables put into the list because there were not trusted.
virtual void updateInformation(const OsiBranchingInformation *info, int branch, OsiHotInfo *hotInfo)
This is a utility function which does strong branching on a list of objects and stores the results in...
Child is proven infeasible.
Interupted and found a variable to fix.
double downInfeasibility() const
down infeasibility
int numberStrongBackup_
backup of numberStrong_ before Root node solve
virtual OsiHotInfo * clone() const
Clone.
void setCbcModel(CbcModel *cbc_model)
Method for setting CbcModel, which is used to get statusOfSearch.
int determineStatus(OsiSolverInterface *solver) const
Determine status of strong branching solution.
A class to have all elements necessary to setup a branch-and-bound.
virtual CoinMessageHandler * clone() const
Several variable can be fixed.
CoinMessageHandler * handler_
Message handler.
virtual bool isProvenOptimal() const=0
bool only_pseudo_when_trusted_
Flag indicating whether we don't want to mix strong branching and pseudo costs during the decision wh...
virtual OsiChooseVariable * clone() const
Clone.
CoinMessageHandler & message(int messageNumber, const CoinMessages &messages)
static void registerOptions(Ipopt::SmartPtr< Bonmin::RegisteredOptions > roptions)
HotInfo & operator=(const HotInfo &rhs)
Assignment operator.
OsiPseudoCosts & pseudoCosts()
Access to pseudo costs storage.
All variable are feasible, the node is feasible.
double maxminCrit(const OsiBranchingInformation *info) const
Helper functions for setupList and chooseVariable.
static const std::string CNAME
Stores the class name for throwing errors.
Found variable to fix and also has remaining candidate for strong branching.
virtual int setupList(OsiBranchingInformation *info, bool initialize)
Sets up strong list and clears all if initialize is true.
virtual ~HotInfo()
Destructor.
StrongStatus
Statuses for strong branching candidates.
int numberStrongRoot_
number of strong branching points at root node
double upInfeasibility() const
up infeasibility
void setUpInfeasibility(double x)
Set the down infeasibility.
chooseVariableReturnStatuses
Return statuses for chooseVariable.
CoinMessageHandler & message(Messages_Types type) const
double setup_pseudo_frac_
fraction of branching candidates that are not trusted yet
virtual bool isDualObjectiveLimitReached() const
double maxmin_crit_have_sol_
maxmin weight in branching decision when no solution has been found yet
void setLogLevel(int value)