aggressive_ | CglCutGenerator | |
assignLpInterface(OsiSolverInterface *si) | IpCbcOACutGenerator2 | |
assignNlpInterface(IpoptInterface *nlp) | IpCbcOACutGenerator2 | |
Cbc enum value | IpCbcOACutGenerator2 | |
cbcCutoffIncrement_ | IpCbcOACutGenerator2 | [private] |
cbcIntegerTolerance_ | IpCbcOACutGenerator2 | [private] |
CglCutGenerator() | CglCutGenerator | |
CglCutGenerator(const CglCutGenerator &) | CglCutGenerator | |
clone() const | IpCbcOACutGenerator2 | [inline, virtual] |
Clp enum value | IpCbcOACutGenerator2 | |
Cplex enum value | IpCbcOACutGenerator2 | |
generateCpp(FILE *fp) | CglCutGenerator | [inline, virtual] |
generateCuts(const OsiSolverInterface &si, OsiCuts &cs, const CglTreeInfo info=CglTreeInfo()) const | IpCbcOACutGenerator2 | [virtual] |
getAggressiveness() const | CglCutGenerator | [inline] |
getNSolve() | IpCbcOACutGenerator2 | [inline] |
handler_ | IpCbcOACutGenerator2 | [private] |
IpCbcOACutGenerator2() | IpCbcOACutGenerator2 | |
IpCbcOACutGenerator2(IpoptInterface *nlp=NULL, OsiSolverInterface *si=NULL, CbcStrategy *strategy=NULL, double cbcCutoffIncrement_=1e-07, double cbcIntegerTolerance=1e-05, bool solveAuxiliaryProblem=1, bool leaveSiUnchanged=0) | IpCbcOACutGenerator2 | |
IpCbcOACutGenerator2(const IpCbcOACutGenerator2 ©) | IpCbcOACutGenerator2 | [inline] |
leaveSiUnchanged_ | IpCbcOACutGenerator2 | [private] |
localSearchNodeLimit_ | IpCbcOACutGenerator2 | [private] |
logFrequency_ | IpCbcOACutGenerator2 | [private] |
maxLocalSearch_ | IpCbcOACutGenerator2 | [private] |
maxLocalSearchPerNode_ | IpCbcOACutGenerator2 | [private] |
maxLocalSearchTime_ | IpCbcOACutGenerator2 | [private] |
mayGenerateRowCutsInTree() const | CglCutGenerator | [virtual] |
messageHandler() | IpCbcOACutGenerator2 | [inline] |
messages_ | IpCbcOACutGenerator2 | [private] |
needsOptimalBasis() const | CglCutGenerator | [virtual] |
nLocalSearch_ | IpCbcOACutGenerator2 | [mutable, private] |
nlp_ | IpCbcOACutGenerator2 | [private] |
nSolve_ | IpCbcOACutGenerator2 | [mutable, private] |
operator=(const CglCutGenerator &rhs) | CglCutGenerator | |
Other enum value | IpCbcOACutGenerator2 | |
refreshSolver(OsiSolverInterface *solver) | CglCutGenerator | [inline, virtual] |
setAggressiveness(int value) | CglCutGenerator | [inline] |
setcbcCutoffIncrement(double value) | IpCbcOACutGenerator2 | [inline] |
setcbcIntegerTolerance(double value) | IpCbcOACutGenerator2 | [inline] |
setCutoff(double cutoff) const | IpCbcOACutGenerator2 | [private] |
setLocalSearchNodeLimit(int value) | IpCbcOACutGenerator2 | [inline] |
setLogFrequency(double value) | IpCbcOACutGenerator2 | [inline] |
setLogLevel(int value) | IpCbcOACutGenerator2 | [inline] |
setMaxLocalSearch(int value) | IpCbcOACutGenerator2 | [inline] |
setMaxLocalSearchPerNode(int value) | IpCbcOACutGenerator2 | [inline] |
setMaxLocalSearchTime(double time) | IpCbcOACutGenerator2 | [inline] |
setStrategy(const CbcStrategy &strategy) | IpCbcOACutGenerator2 | [inline] |
setSubMilpLogLevel(int value) | IpCbcOACutGenerator2 | [inline] |
setTheNodeLimit() | IpCbcOACutGenerator2 | [private] |
setTimeLimit(double time) const | IpCbcOACutGenerator2 | [private] |
si_ | IpCbcOACutGenerator2 | [mutable, private] |
siBestObj(CbcModel *model=NULL) const | IpCbcOACutGenerator2 | [private] |
solveAuxiliaryProblem_ | IpCbcOACutGenerator2 | [private] |
strategy_ | IpCbcOACutGenerator2 | [private] |
subMilpLogLevel_ | IpCbcOACutGenerator2 | [private] |
subSolver enum name | IpCbcOACutGenerator2 | |
timeBegin_ | IpCbcOACutGenerator2 | [private] |
~CglCutGenerator() | CglCutGenerator | [virtual] |
~IpCbcOACutGenerator2() | IpCbcOACutGenerator2 | |