11 #ifndef BonIpoptHeuristic_HPP
12 #define BonIpoptHeuristic_HPP
59 virtual int solution(
double & objectiveValue,
double * newSolution);
65 numberSolvePerLevel_ = value;}
78 int numberSolvePerLevel_;
Class for MINLP problems with symbolic information.
void setNumberSolvePerLevel(int value)
set number of nlp's solved for each given level of the tree
virtual int solution(double &objectiveValue, double *newSolution)
Run heuristic, return 1 if a better solution than the one passed is found and 0 otherwise.
virtual CbcHeuristic * clone() const
Clone.
NlpSolveHeuristic(const NlpSolveHeuristic &other)
Copy constructor.
void setCouenneProblem(CouenneProblem *)
set the couenne problem to use.
void setMaxNlpInf(double value)
set maxNlpInf.
virtual void resetModel(CbcModel *model)
Does nothing.
static void registerOptions(Ipopt::SmartPtr< Bonmin::RegisteredOptions >)
initialize options
NlpSolveHeuristic()
Default constructor.
NlpSolveHeuristic(CbcModel &mip, Bonmin::OsiTMINLPInterface &nlp, bool cloneNlp=false, CouenneProblem *couenne=NULL)
Constructor with model and Ipopt problems.
void setNlp(Bonmin::OsiTMINLPInterface &nlp, bool cloneNlp=true)
Set the nlp solver.
virtual ~NlpSolveHeuristic()
Destructor.
NlpSolveHeuristic & operator=(const NlpSolveHeuristic &rhs)
Assignment operator.
general include file for different compilers
const double maxNlpInf_0
A heuristic to call an NlpSolver if all CouenneObjects are close to be satisfied (for other integer o...