11 #include "CglCutGenerator.hpp"
16 using namespace Couenne;
45 for (
int i=0,
j =
problem_ -> nVars ();
j--; i++) {
47 if (CoinCpuTime () >
problem_ -> getMaxCpuTime ())
52 if ((var -> Multiplicity () > 0) &&
53 (var -> Type () ==
AUX)) {
61 for (
int i = 0,
j =
problem_ -> nVars ();
j--; i++) {
86 if ((var -> Type () ==
AUX) &&
87 (var -> Multiplicity () > 0) &&
88 (var -> Image () -> Linearity () >
LINEAR)) {
90 if (CoinCpuTime () >
problem_ -> getMaxCpuTime ())
bool firstcall_
True if no convexification cuts have been generated yet for this problem.
status of lower/upper bound of a variable, to be checked/modified in bound tightening ...
void genRowCuts(const OsiSolverInterface &, OsiCuts &cs, int, int *, t_chg_bounds *=NULL) const
generate OsiRowCuts for current convexification
CouenneProblem * problem_
pointer to symbolic repr. of constraint, variables, and bounds
void generateCuts(const OsiSolverInterface &, OsiCuts &, const CglTreeInfo=CglTreeInfo()) const
the main CglCutGenerator