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