|
SCIP++ refs/heads/main
|
|
| |
|
SCIP++ refs/heads/main
|
|
|
| |
Parameters with prefix heuristics/vbounds. More...
Variables | |
| constexpr Param< bool > | COPYCUTS { "heuristics/vbounds/copycuts" } |
| should all active cuts from cutpool be copied to constraints in subproblem? | |
| constexpr Param< int > | FEASVARIANT { "heuristics/vbounds/feasvariant" } |
| which variants of the vbounds heuristic that try to stay feasible should be called? (0: off, 1: w/o looking at obj, 2: only fix to best bound, 4: only fix to worst bound | |
| constexpr Param< int > | FREQ { "heuristics/vbounds/freq" } |
| frequency for calling primal heuristic <vbounds> (-1: never, 0: only at depth freqofs) | |
| constexpr Param< int > | FREQOFS { "heuristics/vbounds/freqofs" } |
| frequency offset for calling primal heuristic <vbounds> | |
| constexpr Param< int > | MAXBACKTRACKS { "heuristics/vbounds/maxbacktracks" } |
| maximum number of backtracks during the fixing process | |
| constexpr Param< int > | MAXDEPTH { "heuristics/vbounds/maxdepth" } |
| maximal depth level to call primal heuristic <vbounds> (-1: no limit) | |
| constexpr Param< long long > | MAXNODES { "heuristics/vbounds/maxnodes" } |
| maximum number of nodes to regard in the subproblem | |
| constexpr Param< int > | MAXPROPROUNDS { "heuristics/vbounds/maxproprounds" } |
| maximum number of propagation rounds during probing (-1 infinity) | |
| constexpr Param< double > | MINIMPROVE { "heuristics/vbounds/minimprove" } |
| factor by which vbounds heuristic should at least improve the incumbent | |
| constexpr Param< double > | MININTFIXINGRATE { "heuristics/vbounds/minintfixingrate" } |
| minimum percentage of integer variables that have to be fixed | |
| constexpr Param< double > | MINMIPFIXINGRATE { "heuristics/vbounds/minmipfixingrate" } |
| minimum percentage of variables that have to be fixed within sub-SCIP (integer and continuous) | |
| constexpr Param< long long > | MINNODES { "heuristics/vbounds/minnodes" } |
| minimum number of nodes required to start the subproblem | |
| constexpr Param< long long > | NODESOFS { "heuristics/vbounds/nodesofs" } |
| number of nodes added to the contingent of the total nodes | |
| constexpr Param< double > | NODESQUOT { "heuristics/vbounds/nodesquot" } |
| contingent of sub problem nodes in relation to the number of nodes of the original problem | |
| constexpr Param< int > | PRIORITY { "heuristics/vbounds/priority" } |
| priority of heuristic <vbounds> | |
| constexpr Param< int > | TIGHTENVARIANT { "heuristics/vbounds/tightenvariant" } |
| which tightening variants of the vbounds heuristic should be called? (0: off, 1: w/o looking at obj, 2: only fix to best bound, 4: only fix to worst bound | |
| constexpr Param< bool > | USELOCKFIXINGS { "heuristics/vbounds/uselockfixings" } |
| should more variables be fixed based on variable locks if the fixing rate was not reached? | |
Parameters with prefix heuristics/vbounds.
|
constexpr |
should all active cuts from cutpool be copied to constraints in subproblem?
Definition at line 4151 of file parameters.hpp.
|
constexpr |
which variants of the vbounds heuristic that try to stay feasible should be called? (0: off, 1: w/o looking at obj, 2: only fix to best bound, 4: only fix to worst bound
Definition at line 4158 of file parameters.hpp.
|
constexpr |
frequency for calling primal heuristic <vbounds> (-1: never, 0: only at depth freqofs)
Definition at line 4129 of file parameters.hpp.
|
constexpr |
frequency offset for calling primal heuristic <vbounds>
Definition at line 4131 of file parameters.hpp.
|
constexpr |
maximum number of backtracks during the fixing process
Definition at line 4155 of file parameters.hpp.
|
constexpr |
maximal depth level to call primal heuristic <vbounds> (-1: no limit)
Definition at line 4133 of file parameters.hpp.
|
constexpr |
maximum number of nodes to regard in the subproblem
Definition at line 4139 of file parameters.hpp.
|
constexpr |
maximum number of propagation rounds during probing (-1 infinity)
Definition at line 4149 of file parameters.hpp.
|
constexpr |
factor by which vbounds heuristic should at least improve the incumbent
Definition at line 4147 of file parameters.hpp.
|
constexpr |
minimum percentage of integer variables that have to be fixed
Definition at line 4135 of file parameters.hpp.
|
constexpr |
minimum percentage of variables that have to be fixed within sub-SCIP (integer and continuous)
Definition at line 4137 of file parameters.hpp.
|
constexpr |
minimum number of nodes required to start the subproblem
Definition at line 4143 of file parameters.hpp.
|
constexpr |
number of nodes added to the contingent of the total nodes
Definition at line 4141 of file parameters.hpp.
|
constexpr |
contingent of sub problem nodes in relation to the number of nodes of the original problem
Definition at line 4145 of file parameters.hpp.
|
constexpr |
priority of heuristic <vbounds>
Definition at line 4127 of file parameters.hpp.
|
constexpr |
which tightening variants of the vbounds heuristic should be called? (0: off, 1: w/o looking at obj, 2: only fix to best bound, 4: only fix to worst bound
Definition at line 4161 of file parameters.hpp.
|
constexpr |
should more variables be fixed based on variable locks if the fixing rate was not reached?
Definition at line 4153 of file parameters.hpp.
1.9.6