Parameters with prefix heuristics/locks. More...
Variables | |
constexpr Param< bool > | COPYCUTS { "heuristics/locks/copycuts" } |
should all active cuts from cutpool be copied to constraints in subproblem? | |
constexpr Param< int > | FREQ { "heuristics/locks/freq" } |
frequency for calling primal heuristic <locks> (-1: never, 0: only at depth freqofs) | |
constexpr Param< int > | FREQOFS { "heuristics/locks/freqofs" } |
frequency offset for calling primal heuristic <locks> | |
constexpr Param< int > | MAXDEPTH { "heuristics/locks/maxdepth" } |
maximal depth level to call primal heuristic <locks> (-1: no limit) | |
constexpr Param< long long > | MAXNODES { "heuristics/locks/maxnodes" } |
maximum number of nodes to regard in the subproblem | |
constexpr Param< int > | MAXPROPROUNDS { "heuristics/locks/maxproprounds" } |
maximum number of propagation rounds to be performed in each propagation call (-1: no limit, -2: parameter settings) | |
constexpr Param< double > | MINFIXINGRATE { "heuristics/locks/minfixingrate" } |
minimum percentage of integer variables that have to be fixable | |
constexpr Param< double > | MINFIXINGRATELP { "heuristics/locks/minfixingratelp" } |
minimum fixing rate over all variables (including continuous) to solve LP | |
constexpr Param< double > | MINIMPROVE { "heuristics/locks/minimprove" } |
factor by which locks heuristic should at least improve the incumbent | |
constexpr Param< long long > | MINNODES { "heuristics/locks/minnodes" } |
minimum number of nodes required to start the subproblem | |
constexpr Param< long long > | NODESOFS { "heuristics/locks/nodesofs" } |
number of nodes added to the contingent of the total nodes | |
constexpr Param< double > | NODESQUOT { "heuristics/locks/nodesquot" } |
contingent of sub problem nodes in relation to the number of nodes of the original problem | |
constexpr Param< int > | PRIORITY { "heuristics/locks/priority" } |
priority of heuristic <locks> | |
constexpr Param< double > | ROUNDUPPROBABILITY { "heuristics/locks/roundupprobability" } |
probability for rounding a variable up in case of ties | |
constexpr Param< bool > | UPDATELOCKS { "heuristics/locks/updatelocks" } |
should the locks be updated based on LP rows? | |
constexpr Param< bool > | USEFINALSUBMIP { "heuristics/locks/usefinalsubmip" } |
should a final sub-MIP be solved to costruct a feasible solution if the LP was not roundable? | |
Parameters with prefix heuristics/locks.
|
constexpr |
should all active cuts from cutpool be copied to constraints in subproblem?
Definition at line 3264 of file parameters.hpp.
|
constexpr |
frequency for calling primal heuristic <locks> (-1: never, 0: only at depth freqofs)
Definition at line 3239 of file parameters.hpp.
|
constexpr |
frequency offset for calling primal heuristic <locks>
Definition at line 3241 of file parameters.hpp.
|
constexpr |
maximal depth level to call primal heuristic <locks> (-1: no limit)
Definition at line 3243 of file parameters.hpp.
|
constexpr |
maximum number of nodes to regard in the subproblem
Definition at line 3254 of file parameters.hpp.
|
constexpr |
maximum number of propagation rounds to be performed in each propagation call (-1: no limit, -2: parameter settings)
Definition at line 3246 of file parameters.hpp.
|
constexpr |
minimum percentage of integer variables that have to be fixable
Definition at line 3248 of file parameters.hpp.
|
constexpr |
minimum fixing rate over all variables (including continuous) to solve LP
Definition at line 3268 of file parameters.hpp.
|
constexpr |
factor by which locks heuristic should at least improve the incumbent
Definition at line 3262 of file parameters.hpp.
|
constexpr |
minimum number of nodes required to start the subproblem
Definition at line 3258 of file parameters.hpp.
|
constexpr |
number of nodes added to the contingent of the total nodes
Definition at line 3256 of file parameters.hpp.
|
constexpr |
contingent of sub problem nodes in relation to the number of nodes of the original problem
Definition at line 3260 of file parameters.hpp.
|
constexpr |
priority of heuristic <locks>
Definition at line 3237 of file parameters.hpp.
|
constexpr |
probability for rounding a variable up in case of ties
Definition at line 3250 of file parameters.hpp.
|
constexpr |
should the locks be updated based on LP rows?
Definition at line 3266 of file parameters.hpp.
|
constexpr |
should a final sub-MIP be solved to costruct a feasible solution if the LP was not roundable?
Definition at line 3252 of file parameters.hpp.