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