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