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.
~HeuristicDiveMIP()
Destructor.
HeuristicDiveMIP(const HeuristicDiveMIP ©)
Copy constructor.
virtual void resetModel(CbcModel *model)
Resets stuff if model changes.
virtual int solution(double &solutionValue, double *betterSolution)
Performs heuristic.
virtual void setInternalVariables(TMINLP2TNLP *minlp)=0
sets internal variables
HeuristicDiveMIP(BonminSetup *setup)
Constructor with setup.
void Initialize(BonminSetup *setup)
Initialize method.
HeuristicDiveMIP & operator=(const HeuristicDiveMIP &rhs)
Assignment operator.
virtual void setSetup(BonminSetup *setup)
Change setup used for heuristic.
virtual CbcHeuristic * clone() const =0
Clone.
BonminSetup * setup_
Setup to use for local searches (will make copies).
A very simple class to provide a common interface for solving MIPs with Cplex and Cbc.
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