11 #ifndef COUENNETWOIMPLIED_HPP
12 #define COUENNETWOIMPLIED_HPP
16 #include "CglConfig.h"
17 #include "CglCutGenerator.hpp"
18 #include "OsiRowCut.hpp"
196 const CglTreeInfo = CglTreeInfo ())
197 #if CGL_VERSION_MAJOR == 0 && CGL_VERSION_MINOR <= 57
int depthStopSeparate_
Depth of the BB tree where stop separation.
CouenneProblem * problem_
pointer to problem data structure (used for post-BT)
JnlstPtr jnlst_
Journalist.
int depthLevelling_
Depth of the BB tree where to start decreasing chance of running this.
double totalInitTime_
CPU time spent columning the row formulation.
double totalTime_
Total CPU time spent separating cuts.
void generateCuts(const OsiSolverInterface &, OsiCuts &, const CglTreeInfo=CglTreeInfo()) const
the main CglCutGenerator
~CouenneTwoImplied()
destructor
Class for MINLP problems with symbolic information.
Cut Generator for implied bounds derived from pairs of linear (in)equalities.
CouenneTwoImplied * clone() const
clone method (necessary for the abstract CglCutGenerator class)
static void registerOptions(Ipopt::SmartPtr< Bonmin::RegisteredOptions > roptions)
Add list of options to be read from file.
CouenneTwoImplied(CouenneProblem *, JnlstPtr, const Ipopt::SmartPtr< Ipopt::OptionsList >)
constructor
bool firstCall_
first call indicator
int nMaxTrials_
maximum number of trials in every call