10 #ifndef BonHeuristicDiveMIP_HPP 11 #define BonHeuristicDiveMIP_HPP 14 #include "CbcHeuristic.hpp" 15 #include "CbcStrategy.hpp" 40 virtual CbcHeuristic *
clone()
const = 0;
57 virtual int solution(
double &solutionValue,
double *betterSolution);
67 const double* newSolution,
virtual void selectVariableToBranch(TMINLP2TNLP *minlp, const vector< int > &integerColumns, const double *newSolution, int &bestColumn, int &bestRound)=0
Selects the next variable to branch on.
(C) Copyright International Business Machines Corporation 2007
void Initialize(BonminSetup *setup)
Initialize method.
BonminSetup * setup_
Setup to use for local searches (will make copies).
HeuristicDiveMIP & operator=(const HeuristicDiveMIP &rhs)
Assignment operator.
virtual void setSetup(BonminSetup *setup)
Change setup used for heuristic.
A very simple class to provide a common interface for solving MIPs with Cplex and Cbc.
virtual CbcHeuristic * clone() const =0
Clone.
virtual void resetModel(CbcModel *model)
Resets stuff if model changes.
~HeuristicDiveMIP()
Destructor.
This is an adapter class that converts a TMINLP to a TNLP to be solved by Ipopt.
HeuristicDiveMIP(BonminSetup *setup)
Constructor with setup.
virtual void setInternalVariables(TMINLP2TNLP *minlp)=0
sets internal variables
virtual int solution(double &solutionValue, double *betterSolution)
Performs heuristic.