10#ifndef BonHeuristicDiveMIPVectorLength_H
11#define BonHeuristicDiveMIPVectorLength_H
35 delete [] columnLength_;
42 virtual CbcHeuristic *
clone()
const;
58 const double* newSolution,
Ipopt::SmartPtr< Ipopt::OptionsList > options()
Acces list of Options.
HeuristicDiveMIPVectorLength(const HeuristicDiveMIPVectorLength ©)
Copy constructor.
virtual void selectVariableToBranch(TMINLP2TNLP *minlp, const vector< int > &integerColumns, const double *newSolution, int &bestColumn, int &bestRound)
Selects the next variable to branch on.
virtual void setSetup(BonminSetup *setup)
Change setup used for heuristic.
~HeuristicDiveMIPVectorLength()
Destructor.
virtual CbcHeuristic * clone() const
Clone.
HeuristicDiveMIPVectorLength(BonminSetup *setup)
Constructor with setup.
HeuristicDiveMIPVectorLength & operator=(const HeuristicDiveMIPVectorLength &rhs)
Assignment operator.
void Initialize(Ipopt::SmartPtr< Ipopt::OptionsList > options)
Initiaize using passed options.
static void registerOptions(Ipopt::SmartPtr< Bonmin::RegisteredOptions > roptions)
Register the options common to all local search based heuristics.
virtual void setInternalVariables(TMINLP2TNLP *minlp)
sets internal variables
HeuristicDiveMIPVectorLength()
Default Constructor.
virtual void setSetup(BonminSetup *setup)
Change setup used for heuristic.
This is an adapter class that converts a TMINLP to a TNLP to be solved by Ipopt.
A small wrap around std::vector to give easy access to array for interfacing with fortran code.
(C) Copyright International Business Machines Corporation 2007