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_;
A class to have all elements necessary to setup a branch-and-bound.
This class chooses a variable to branch on.
static const std::string CNAME
Stores the class name for throwing errors.
double setup_pseudo_frac_
fraction of branching candidates that are not trusted yet
virtual ~BonChooseVariable()
Destructor.
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...
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...
int determineStatus(OsiSolverInterface *solver) const
Determine status of strong branching solution.
virtual OsiChooseVariable * clone() const
Clone.
int numberBeforeTrustedList_
number of times a branch has to happen so that it is trusted in setupList
void setCbcModel(CbcModel *cbc_model)
Method for setting CbcModel, which is used to get statusOfSearch.
int bb_log_level_
verbosity level
void passInMessageHandler(CoinMessageHandler *handler)
chooseVariableReturnStatuses
Return statuses for chooseVariable.
@ canFixAndBranch
Found variable to fix and also has a (non-strong) branching candidate.
@ feasibleNode
All variable are feasible, the node is feasible.
@ hasCandidate
Normal termination, found a variable to branch on.
@ canFixAndStrongBranch
Found variable to fix and also has remaining candidate for strong branching.
@ canFixNoCandidate
Can fix variables but does not have strong branching candidates.
double maxmin_crit_no_sol_
maxmin weight in branching decision when no solution has been found yet
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.
CoinMessageHandler * handler_
Message handler.
Messages messages_
Messages.
static void registerOptions(Ipopt::SmartPtr< Bonmin::RegisteredOptions > roptions)
BonChooseVariable(BabSetupBase &b, const OsiSolverInterface *solver)
Constructor from solver (so we can set up arrays etc)
int numberStrongBackup_
backup of numberStrong_ before Root node solve
BonChooseVariable(const BonChooseVariable &)
Copy constructor.
void computeMultipliers(double &upMult, double &downMult) const
bool only_pseudo_when_trusted_
Flag indicating whether we don't want to mix strong branching and pseudo costs during the decision wh...
vector< HotInfo > results_
Stores strong branching results.
void setOnlyPseudoWhenTrusted(bool only_pseudo_when_trusted)
virtual int setupList(OsiBranchingInformation *info, bool initialize)
Sets up strong list and clears all if initialize is true.
virtual void updateInformation(int whichObject, int branch, double changeInObjective, double changeInValue, int status)
Given a branch fill in useful information e.g. estimates.
@ BON_CHOOSE_MESSAGES_DUMMY_END
StrongStatus
Statuses for strong branching candidates.
@ Infeasible
Child is proven infeasible.
@ NotFinished
Child is not finished.
@ Feasible
Child is proven feasible.
int trustStrongForPseudoCosts_
Wether or not to trust strong branching results for updating pseudo costs.
int numberLookAhead_
number of look-ahead strong-branching steps
BonChooseVariable & operator=(const BonChooseVariable &rhs)
Assignment operator.
int numberStrongRoot_
number of strong branching points at root node
double maxmin_crit_have_sol_
maxmin weight in branching decision when no solution has been found yet
Ipopt::SmartPtr< Ipopt::Journalist > jnlst_
Holding on the a pointer to the journalist.
double computeUsefulness(const double MAXMIN_CRITERION, const double upMult, const double dowMult, const double value, const OsiObject *object, int i, double &value2) const
@ maxTime
Interrupted because of time limit.
@ doneNoFixing
All done no variable can be fixed.
@ interuptedCanFix
Interrupted and found a variable to fix.
@ doneCanFix
Several variable can be fixed.
OsiPseudoCosts pseudoCosts_
Stores the pseudo costs.
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...
bool isRootNode(const OsiBranchingInformation *info) const
detecting if this is root node
OsiPseudoCosts & pseudoCosts()
Access to pseudo costs storage.
const OsiPseudoCosts & pseudoCosts() const
Access to pseudo costs storage.
double maxminCrit(const OsiBranchingInformation *info) const
Helper functions for setupList and chooseVariable.
CoinMessageHandler & message(Messages_Types type) const
int updateInformation(const OsiSolverInterface *solver, const OsiBranchingInformation *info, OsiChooseVariable *choose)
Fill in some usefull information after a strong branching is done:
virtual OsiHotInfo * clone() const
Clone.
HotInfo(OsiSolverInterface *solver, const OsiBranchingInformation *info, const OsiObject *const *objects, int whichObject)
Constructor from usefull information.
double downInfeasibility() const
down infeasibility
virtual ~HotInfo()
Destructor.
void setUpInfeasibility(double x)
Set the down infeasibility.
HotInfo & operator=(const HotInfo &rhs)
Assignment operator.
double upInfeasibility() const
up infeasibility
void setDownInfeasibility(double x)
Set the down infeasibility.
HotInfo()
Default constructor.
HotInfo(const HotInfo &other)
Copy constructor.
A small wrap around std::vector to give easy access to array for interfacing with fortran code.
void setLogLevel(int value)
virtual CoinMessageHandler * clone() const
CoinMessageHandler & message(int messageNumber, const CoinMessages &messages)
int numberBranches() const
OsiBranchingObject * branchingObject_
virtual bool isDualObjectiveLimitReached() const
virtual bool isProvenOptimal() const=0
virtual bool isIterationLimitReached() const=0
(C) Copyright International Business Machines Corporation 2007