Parameters with prefix heuristics/zeroobj. More...
Variables | |
constexpr Param< bool > | ADDALLSOLS { "heuristics/zeroobj/addallsols" } |
should all subproblem solutions be added to the original SCIP? | |
constexpr Param< int > | FREQ { "heuristics/zeroobj/freq" } |
frequency for calling primal heuristic <zeroobj> (-1: never, 0: only at depth freqofs) | |
constexpr Param< int > | FREQOFS { "heuristics/zeroobj/freqofs" } |
frequency offset for calling primal heuristic <zeroobj> | |
constexpr Param< int > | MAXDEPTH { "heuristics/zeroobj/maxdepth" } |
maximal depth level to call primal heuristic <zeroobj> (-1: no limit) | |
constexpr Param< long long > | MAXLPITERS { "heuristics/zeroobj/maxlpiters" } |
maximum number of LP iterations to be performed in the subproblem | |
constexpr Param< long long > | MAXNODES { "heuristics/zeroobj/maxnodes" } |
maximum number of nodes to regard in the subproblem | |
constexpr Param< double > | MINIMPROVE { "heuristics/zeroobj/minimprove" } |
factor by which zeroobj should at least improve the incumbent | |
constexpr Param< long long > | MINNODES { "heuristics/zeroobj/minnodes" } |
minimum number of nodes required to start the subproblem | |
constexpr Param< long long > | NODESOFS { "heuristics/zeroobj/nodesofs" } |
number of nodes added to the contingent of the total nodes | |
constexpr Param< double > | NODESQUOT { "heuristics/zeroobj/nodesquot" } |
contingent of sub problem nodes in relation to the number of nodes of the original problem | |
constexpr Param< bool > | ONLYWITHOUTSOL { "heuristics/zeroobj/onlywithoutsol" } |
should heuristic only be executed if no primal solution was found, yet? | |
constexpr Param< int > | PRIORITY { "heuristics/zeroobj/priority" } |
priority of heuristic <zeroobj> | |
constexpr Param< bool > | USEUCT { "heuristics/zeroobj/useuct" } |
should uct node selection be used at the beginning of the search? | |
Parameters with prefix heuristics/zeroobj.
|
constexpr |
should all subproblem solutions be added to the original SCIP?
Definition at line 4224 of file parameters.hpp.
|
constexpr |
frequency for calling primal heuristic <zeroobj> (-1: never, 0: only at depth freqofs)
Definition at line 4206 of file parameters.hpp.
|
constexpr |
frequency offset for calling primal heuristic <zeroobj>
Definition at line 4208 of file parameters.hpp.
|
constexpr |
maximal depth level to call primal heuristic <zeroobj> (-1: no limit)
Definition at line 4210 of file parameters.hpp.
|
constexpr |
maximum number of LP iterations to be performed in the subproblem
Definition at line 4218 of file parameters.hpp.
|
constexpr |
maximum number of nodes to regard in the subproblem
Definition at line 4212 of file parameters.hpp.
|
constexpr |
factor by which zeroobj should at least improve the incumbent
Definition at line 4222 of file parameters.hpp.
|
constexpr |
minimum number of nodes required to start the subproblem
Definition at line 4216 of file parameters.hpp.
|
constexpr |
number of nodes added to the contingent of the total nodes
Definition at line 4214 of file parameters.hpp.
|
constexpr |
contingent of sub problem nodes in relation to the number of nodes of the original problem
Definition at line 4220 of file parameters.hpp.
|
constexpr |
should heuristic only be executed if no primal solution was found, yet?
Definition at line 4226 of file parameters.hpp.
|
constexpr |
priority of heuristic <zeroobj>
Definition at line 4204 of file parameters.hpp.
|
constexpr |
should uct node selection be used at the beginning of the search?
Definition at line 4228 of file parameters.hpp.