10 #ifndef BonHeuristicDiveMIPVectorLength_H 
   11 #define BonHeuristicDiveMIPVectorLength_H 
   42     virtual CbcHeuristic * 
clone() 
const;
 
   58                                         const double* newSolution,
 
   63     static void registerOptions(Ipopt::SmartPtr<Bonmin::RegisteredOptions> roptions);
 
   66     void Initialize(Ipopt::SmartPtr<Ipopt::OptionsList> options);
 
int * columnLength_
the number of nonzero elements in each column 
 
void Initialize(Ipopt::SmartPtr< Ipopt::OptionsList > options)
Initiaize using passed options. 
 
HeuristicDiveMIPVectorLength()
Default Constructor. 
 
virtual CbcHeuristic * clone() const 
Clone. 
 
~HeuristicDiveMIPVectorLength()
Destructor. 
 
virtual void setSetup(BonminSetup *setup)
Change setup used for heuristic. 
 
HeuristicDiveMIPVectorLength & operator=(const HeuristicDiveMIPVectorLength &rhs)
Assignment operator. 
 
virtual void setSetup(BonminSetup *setup)
Change setup used for heuristic. 
 
Ipopt::SmartPtr< Ipopt::OptionsList > options()
Acces list of Options. 
 
virtual void setInternalVariables(TMINLP2TNLP *minlp)
sets internal variables 
 
This is an adapter class that converts a TMINLP to a TNLP to be solved by Ipopt. 
 
virtual void selectVariableToBranch(TMINLP2TNLP *minlp, const vector< int > &integerColumns, const double *newSolution, int &bestColumn, int &bestRound)
Selects the next variable to branch on. 
 
static void registerOptions(Ipopt::SmartPtr< Bonmin::RegisteredOptions > roptions)
Register the options common to all local search based heuristics.