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