Parameters with prefix heuristics/completesol. More...
Variables | |
constexpr Param< bool > | ADDALLSOLS { "heuristics/completesol/addallsols" } |
should all subproblem solutions be added to the original SCIP? | |
constexpr Param< bool > | BEFOREPRESOL { "heuristics/completesol/beforepresol" } |
should the heuristic run before presolving? | |
constexpr Param< double > | BOUNDWIDENING { "heuristics/completesol/boundwidening" } |
bound widening factor applied to continuous variables (0: fix variables to given solution values, 1: relax to global bounds) | |
constexpr Param< int > | FREQ { "heuristics/completesol/freq" } |
frequency for calling primal heuristic <completesol> (-1: never, 0: only at depth freqofs) | |
constexpr Param< int > | FREQOFS { "heuristics/completesol/freqofs" } |
frequency offset for calling primal heuristic <completesol> | |
constexpr Param< bool > | IGNORECONT { "heuristics/completesol/ignorecont" } |
should number of continuous variables be ignored? | |
constexpr Param< double > | LPLIMFAC { "heuristics/completesol/lplimfac" } |
factor by which the limit on the number of LP depends on the node limit | |
constexpr Param< int > | MAXCONTVARS { "heuristics/completesol/maxcontvars" } |
maximal number of continuous variables after presolving | |
constexpr Param< int > | MAXDEPTH { "heuristics/completesol/maxdepth" } |
maximal depth level to call primal heuristic <completesol> (-1: no limit) | |
constexpr Param< long long > | MAXLPITER { "heuristics/completesol/maxlpiter" } |
maximal number of LP iterations (-1: no limit) | |
constexpr Param< long long > | MAXNODES { "heuristics/completesol/maxnodes" } |
maximum number of nodes to regard in the subproblem | |
constexpr Param< int > | MAXPROPROUNDS { "heuristics/completesol/maxproprounds" } |
maximal number of iterations in propagation (-1: no limit) | |
constexpr Param< double > | MAXUNKNOWNRATE { "heuristics/completesol/maxunknownrate" } |
maximal rate of unknown solution values | |
constexpr Param< double > | MINIMPROVE { "heuristics/completesol/minimprove" } |
factor by which the incumbent should be improved at least | |
constexpr Param< long long > | MINNODES { "heuristics/completesol/minnodes" } |
minimum number of nodes required to start the subproblem | |
constexpr Param< long long > | NODESOFS { "heuristics/completesol/nodesofs" } |
number of nodes added to the contingent of the total nodes | |
constexpr Param< double > | NODESQUOT { "heuristics/completesol/nodesquot" } |
contingent of sub problem nodes in relation to the number of nodes of the original problem | |
constexpr Param< double > | OBJWEIGHT { "heuristics/completesol/objweight" } |
weight of the original objective function (1: only original objective) | |
constexpr Param< int > | PRIORITY { "heuristics/completesol/priority" } |
priority of heuristic <completesol> | |
constexpr Param< int > | SOLUTIONS { "heuristics/completesol/solutions" } |
heuristic stops, if the given number of improving solutions were found (-1: no limit) | |
Parameters with prefix heuristics/completesol.
|
constexpr |
should all subproblem solutions be added to the original SCIP?
Definition at line 2610 of file parameters.hpp.
|
constexpr |
should the heuristic run before presolving?
Definition at line 2631 of file parameters.hpp.
|
constexpr |
bound widening factor applied to continuous variables (0: fix variables to given solution values, 1: relax to global bounds)
Definition at line 2621 of file parameters.hpp.
|
constexpr |
frequency for calling primal heuristic <completesol> (-1: never, 0: only at depth freqofs)
Definition at line 2598 of file parameters.hpp.
|
constexpr |
frequency offset for calling primal heuristic <completesol>
Definition at line 2600 of file parameters.hpp.
|
constexpr |
should number of continuous variables be ignored?
Definition at line 2625 of file parameters.hpp.
|
constexpr |
factor by which the limit on the number of LP depends on the node limit
Definition at line 2616 of file parameters.hpp.
|
constexpr |
maximal number of continuous variables after presolving
Definition at line 2635 of file parameters.hpp.
|
constexpr |
maximal depth level to call primal heuristic <completesol> (-1: no limit)
Definition at line 2602 of file parameters.hpp.
|
constexpr |
maximal number of LP iterations (-1: no limit)
Definition at line 2633 of file parameters.hpp.
|
constexpr |
maximum number of nodes to regard in the subproblem
Definition at line 2604 of file parameters.hpp.
|
constexpr |
maximal number of iterations in propagation (-1: no limit)
Definition at line 2629 of file parameters.hpp.
|
constexpr |
maximal rate of unknown solution values
Definition at line 2608 of file parameters.hpp.
|
constexpr |
factor by which the incumbent should be improved at least
Definition at line 2623 of file parameters.hpp.
|
constexpr |
minimum number of nodes required to start the subproblem
Definition at line 2606 of file parameters.hpp.
|
constexpr |
number of nodes added to the contingent of the total nodes
Definition at line 2612 of file parameters.hpp.
|
constexpr |
contingent of sub problem nodes in relation to the number of nodes of the original problem
Definition at line 2614 of file parameters.hpp.
|
constexpr |
weight of the original objective function (1: only original objective)
Definition at line 2618 of file parameters.hpp.
|
constexpr |
priority of heuristic <completesol>
Definition at line 2596 of file parameters.hpp.
|
constexpr |
heuristic stops, if the given number of improving solutions were found (-1: no limit)
Definition at line 2627 of file parameters.hpp.