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