11 #ifndef COUENNEAGGRPROBING_HPP 12 #define COUENNEAGGRPROBING_HPP 59 #if CGL_VERSION_MAJOR == 0 && CGL_VERSION_MINOR <= 57 double probeVariable2(int index, bool lower)
Alternative probing algorithm.
double initCutoff_
Initial cutoff.
CouenneSetup * couenne_
Pointer to the CouenneProblem representation.
Cut Generator for aggressive BT; i.e., an aggressive probing.
int getMaxFailedSteps() const
void setRestoreCutoff(bool value)
Set/get restoreCutoff parameter (should we restore the initial cutoff value after each probing run?...
int maxFailedSteps_
Maximum number of failed iterations.
int numCols_
Number of columns (want to have this handy)
static void registerOptions(Ipopt::SmartPtr< Bonmin::RegisteredOptions > roptions)
Add list of options to be read from file.
CouenneAggrProbing(CouenneSetup *couenne, const Ipopt::SmartPtr< Ipopt::OptionsList > options)
Constructor.
CouenneAggrProbing * clone() const
Clone method (necessary for the abstract CglCutGenerator class)
void setMaxNodes(int value)
Set/get maximum number of nodes to probe one variable.
bool getRestoreCutoff() const
void generateCuts(const OsiSolverInterface &solver, OsiCuts &cuts, const CglTreeInfo=CglTreeInfo()) const
The main CglCutGenerator; not implemented yet.
~CouenneAggrProbing()
Destructor.
int maxNodes_
Maximum number of nodes in probing.
void setMaxTime(double value)
Set/get maximum time to probe one variable.
double maxTime_
Maximum time to probe one variable.
double probeVariable(int index, bool probeLower)
Probe one variable (try to tigthen the lower or the upper bound, depending on the value of the second...
double getMaxTime() const
bool restoreCutoff_
Restore initial cutoff (value and solution)?
void setMaxFailedSteps(int value)
Set/get maximum number of failed steps.
general include file for different compilers