Parameters with prefix heuristics/dualval. More...
Variables | |
constexpr Param< int > | DYNAMICDEPTH { "heuristics/dualval/dynamicdepth" } |
says if and how the recursion depth is computed at runtime | |
constexpr Param< bool > | FORCEIMPROVEMENTS { "heuristics/dualval/forceimprovements" } |
exit if objective doesn't improve | |
constexpr Param< int > | FREQ { "heuristics/dualval/freq" } |
frequency for calling primal heuristic <dualval> (-1: never, 0: only at depth freqofs) | |
constexpr Param< int > | FREQOFS { "heuristics/dualval/freqofs" } |
frequency offset for calling primal heuristic <dualval> | |
constexpr Param< int > | HEURVERBLEVEL { "heuristics/dualval/heurverblevel" } |
verblevel of the heuristic, default is 0 to display nothing | |
constexpr Param< double > | LAMBDAOBJ { "heuristics/dualval/lambdaobj" } |
scaling factor for the objective function | |
constexpr Param< double > | LAMBDASLACK { "heuristics/dualval/lambdaslack" } |
value added to objective of slack variables, must not be zero | |
constexpr Param< int > | MAXCALLS { "heuristics/dualval/maxcalls" } |
maximal number of recursive calls of the heuristic (if dynamicdepth is off) | |
constexpr Param< int > | MAXDEPTH { "heuristics/dualval/maxdepth" } |
maximal depth level to call primal heuristic <dualval> (-1: no limit) | |
constexpr Param< int > | MAXEQUALRANKS { "heuristics/dualval/maxequalranks" } |
maximal number of variables that may have maximal rank, quit if there are more, turn off by setting -1 | |
constexpr Param< double > | MINGAP { "heuristics/dualval/mingap" } |
minimal gap for which we still run the heuristic, if gap is less we return without doing anything | |
constexpr Param< int > | NLPVERBLEVEL { "heuristics/dualval/nlpverblevel" } |
verblevel of the nlp solver, can be 0 or 1 | |
constexpr Param< bool > | ONLYCHEAPER { "heuristics/dualval/onlycheaper" } |
add constraint to ensure that discrete vars are improving | |
constexpr Param< bool > | ONLYLEAVES { "heuristics/dualval/onlyleaves" } |
disable the heuristic if it was not called at a leaf of the B&B tree | |
constexpr Param< int > | PRIORITY { "heuristics/dualval/priority" } |
priority of heuristic <dualval> | |
constexpr Param< int > | RANKVALUE { "heuristics/dualval/rankvalue" } |
number of ranks that should be displayed when the heuristic is called | |
constexpr Param< bool > | RELAXCONTVARS { "heuristics/dualval/relaxcontvars" } |
relax the continous variables | |
constexpr Param< bool > | RELAXINDICATORS { "heuristics/dualval/relaxindicators" } |
relax the indicator variables by introducing continuous copies | |
Parameters with prefix heuristics/dualval.
|
constexpr |
says if and how the recursion depth is computed at runtime
Definition at line 2856 of file parameters.hpp.
|
constexpr |
exit if objective doesn't improve
Definition at line 2838 of file parameters.hpp.
|
constexpr |
frequency for calling primal heuristic <dualval> (-1: never, 0: only at depth freqofs)
Definition at line 2832 of file parameters.hpp.
|
constexpr |
frequency offset for calling primal heuristic <dualval>
Definition at line 2834 of file parameters.hpp.
|
constexpr |
verblevel of the heuristic, default is 0 to display nothing
Definition at line 2848 of file parameters.hpp.
|
constexpr |
scaling factor for the objective function
Definition at line 2864 of file parameters.hpp.
|
constexpr |
value added to objective of slack variables, must not be zero
Definition at line 2862 of file parameters.hpp.
|
constexpr |
maximal number of recursive calls of the heuristic (if dynamicdepth is off)
Definition at line 2854 of file parameters.hpp.
|
constexpr |
maximal depth level to call primal heuristic <dualval> (-1: no limit)
Definition at line 2836 of file parameters.hpp.
|
constexpr |
maximal number of variables that may have maximal rank, quit if there are more, turn off by setting -1
Definition at line 2858 of file parameters.hpp.
|
constexpr |
minimal gap for which we still run the heuristic, if gap is less we return without doing anything
Definition at line 2860 of file parameters.hpp.
|
constexpr |
verblevel of the nlp solver, can be 0 or 1
Definition at line 2850 of file parameters.hpp.
|
constexpr |
add constraint to ensure that discrete vars are improving
Definition at line 2840 of file parameters.hpp.
|
constexpr |
disable the heuristic if it was not called at a leaf of the B&B tree
Definition at line 2842 of file parameters.hpp.
|
constexpr |
priority of heuristic <dualval>
Definition at line 2830 of file parameters.hpp.
|
constexpr |
number of ranks that should be displayed when the heuristic is called
Definition at line 2852 of file parameters.hpp.
|
constexpr |
relax the continous variables
Definition at line 2846 of file parameters.hpp.
|
constexpr |
relax the indicator variables by introducing continuous copies
Definition at line 2844 of file parameters.hpp.