Parameters with prefix heuristics/nlpdiving. More...
Variables | |
constexpr Param< bool > | BACKTRACK { "heuristics/nlpdiving/backtrack" } |
use one level of backtracking if infeasibility is encountered? | |
constexpr Param< double > | FIXQUOT { "heuristics/nlpdiving/fixquot" } |
percentage of fractional variables that should be fixed before the next NLP solve | |
constexpr Param< int > | FREQ { "heuristics/nlpdiving/freq" } |
frequency for calling primal heuristic <nlpdiving> (-1: never, 0: only at depth freqofs) | |
constexpr Param< int > | FREQOFS { "heuristics/nlpdiving/freqofs" } |
frequency offset for calling primal heuristic <nlpdiving> | |
constexpr Param< bool > | LP { "heuristics/nlpdiving/lp" } |
should the LP relaxation be solved before the NLP relaxation? | |
constexpr Param< int > | MAXDEPTH { "heuristics/nlpdiving/maxdepth" } |
maximal depth level to call primal heuristic <nlpdiving> (-1: no limit) | |
constexpr Param< double > | MAXDIVEAVGQUOT { "heuristics/nlpdiving/maxdiveavgquot" } |
maximal quotient (curlowerbound - lowerbound)/(avglowerbound - lowerbound) where diving is performed (0.0: no limit) | |
constexpr Param< double > | MAXDIVEAVGQUOTNOSOL { "heuristics/nlpdiving/maxdiveavgquotnosol" } |
maximal AVGQUOT when no solution was found yet (0.0: no limit) | |
constexpr Param< double > | MAXDIVEUBQUOT { "heuristics/nlpdiving/maxdiveubquot" } |
maximal quotient (curlowerbound - lowerbound)/(cutoffbound - lowerbound) where diving is performed (0.0: no limit) | |
constexpr Param< double > | MAXDIVEUBQUOTNOSOL { "heuristics/nlpdiving/maxdiveubquotnosol" } |
maximal UBQUOT when no solution was found yet (0.0: no limit) | |
constexpr Param< int > | MAXFEASNLPS { "heuristics/nlpdiving/maxfeasnlps" } |
maximal number of NLPs with feasible solution to solve during one dive | |
constexpr Param< int > | MAXNLPITERABS { "heuristics/nlpdiving/maxnlpiterabs" } |
minimial absolute number of allowed NLP iterations | |
constexpr Param< int > | MAXNLPITERREL { "heuristics/nlpdiving/maxnlpiterrel" } |
additional allowed number of NLP iterations relative to successfully found solutions | |
constexpr Param< double > | MAXRELDEPTH { "heuristics/nlpdiving/maxreldepth" } |
maximal relative depth to start diving | |
constexpr Param< double > | MINRELDEPTH { "heuristics/nlpdiving/minreldepth" } |
minimal relative depth to start diving | |
constexpr Param< double > | MINSUCCQUOT { "heuristics/nlpdiving/minsuccquot" } |
heuristic will not run if less then this percentage of calls succeeded (0.0: no limit) | |
constexpr Param< bool > | NLPFASTFAIL { "heuristics/nlpdiving/nlpfastfail" } |
should the NLP solver stop early if it converges slow? | |
constexpr Param< char > | NLPSTART { "heuristics/nlpdiving/nlpstart" } |
which point should be used as starting point for the NLP solver? ('n'one, last 'f'easible, from dive's'tart) | |
constexpr Param< bool > | PREFERCOVER { "heuristics/nlpdiving/prefercover" } |
should variables in a minimal cover be preferred? | |
constexpr Param< bool > | PREFERLPFRACS { "heuristics/nlpdiving/preferlpfracs" } |
prefer variables that are also fractional in LP solution? | |
constexpr Param< int > | PRIORITY { "heuristics/nlpdiving/priority" } |
priority of heuristic <nlpdiving> | |
constexpr Param< bool > | SOLVESUBMIP { "heuristics/nlpdiving/solvesubmip" } |
should a sub-MIP be solved if all cover variables are fixed? | |
constexpr Param< char > | VARSELRULE { "heuristics/nlpdiving/varselrule" } |
which variable selection should be used? ('f'ractionality, 'c'oefficient, 'p'seudocost, 'g'uided, 'd'ouble, 'v'eclen) | |
Parameters with prefix heuristics/nlpdiving.
|
constexpr |
use one level of backtracking if infeasibility is encountered?
Definition at line 3428 of file parameters.hpp.
|
constexpr |
percentage of fractional variables that should be fixed before the next NLP solve
Definition at line 3436 of file parameters.hpp.
|
constexpr |
frequency for calling primal heuristic <nlpdiving> (-1: never, 0: only at depth freqofs)
Definition at line 3402 of file parameters.hpp.
|
constexpr |
frequency offset for calling primal heuristic <nlpdiving>
Definition at line 3404 of file parameters.hpp.
|
constexpr |
should the LP relaxation be solved before the NLP relaxation?
Definition at line 3430 of file parameters.hpp.
|
constexpr |
maximal depth level to call primal heuristic <nlpdiving> (-1: no limit)
Definition at line 3406 of file parameters.hpp.
|
constexpr |
maximal quotient (curlowerbound - lowerbound)/(avglowerbound - lowerbound) where diving is performed (0.0: no limit)
Definition at line 3420 of file parameters.hpp.
|
constexpr |
maximal AVGQUOT when no solution was found yet (0.0: no limit)
Definition at line 3424 of file parameters.hpp.
|
constexpr |
maximal quotient (curlowerbound - lowerbound)/(cutoffbound - lowerbound) where diving is performed (0.0: no limit)
Definition at line 3417 of file parameters.hpp.
|
constexpr |
maximal UBQUOT when no solution was found yet (0.0: no limit)
Definition at line 3422 of file parameters.hpp.
|
constexpr |
maximal number of NLPs with feasible solution to solve during one dive
Definition at line 3426 of file parameters.hpp.
|
constexpr |
minimial absolute number of allowed NLP iterations
Definition at line 3412 of file parameters.hpp.
|
constexpr |
additional allowed number of NLP iterations relative to successfully found solutions
Definition at line 3414 of file parameters.hpp.
|
constexpr |
maximal relative depth to start diving
Definition at line 3410 of file parameters.hpp.
|
constexpr |
minimal relative depth to start diving
Definition at line 3408 of file parameters.hpp.
|
constexpr |
heuristic will not run if less then this percentage of calls succeeded (0.0: no limit)
Definition at line 3434 of file parameters.hpp.
|
constexpr |
should the NLP solver stop early if it converges slow?
Definition at line 3442 of file parameters.hpp.
|
constexpr |
which point should be used as starting point for the NLP solver? ('n'one, last 'f'easible, from dive's'tart)
Definition at line 3444 of file parameters.hpp.
|
constexpr |
should variables in a minimal cover be preferred?
Definition at line 3438 of file parameters.hpp.
|
constexpr |
prefer variables that are also fractional in LP solution?
Definition at line 3432 of file parameters.hpp.
|
constexpr |
priority of heuristic <nlpdiving>
Definition at line 3400 of file parameters.hpp.
|
constexpr |
should a sub-MIP be solved if all cover variables are fixed?
Definition at line 3440 of file parameters.hpp.
|
constexpr |
which variable selection should be used? ('f'ractionality, 'c'oefficient, 'p'seudocost, 'g'uided, 'd'ouble, 'v'eclen)
Definition at line 3447 of file parameters.hpp.