Parameters with prefix heuristics/lpface. More...
Variables | |
constexpr Param< bool > | COPYCUTS { "heuristics/lpface/copycuts" } |
if uselprows == FALSE, should all active cuts from cutpool be copied to constraints in subproblem? | |
constexpr Param< bool > | DUALBASISEQUATIONS { "heuristics/lpface/dualbasisequations" } |
should dually nonbasic rows be turned into equations? | |
constexpr Param< int > | FREQ { "heuristics/lpface/freq" } |
frequency for calling primal heuristic <lpface> (-1: never, 0: only at depth freqofs) | |
constexpr Param< int > | FREQOFS { "heuristics/lpface/freqofs" } |
frequency offset for calling primal heuristic <lpface> | |
constexpr Param< bool > | KEEPSUBSCIP { "heuristics/lpface/keepsubscip" } |
should the heuristic continue solving the same sub-SCIP? | |
constexpr Param< double > | LPLIMFAC { "heuristics/lpface/lplimfac" } |
factor by which the limit on the number of LP depends on the node limit | |
constexpr Param< int > | MAXDEPTH { "heuristics/lpface/maxdepth" } |
maximal depth level to call primal heuristic <lpface> (-1: no limit) | |
constexpr Param< long long > | MAXNODES { "heuristics/lpface/maxnodes" } |
maximum number of nodes to regard in the subproblem | |
constexpr Param< double > | MINFIXINGRATE { "heuristics/lpface/minfixingrate" } |
required percentage of fixed integer variables in sub-MIP to run | |
constexpr Param< long long > | MINNODES { "heuristics/lpface/minnodes" } |
minimum number of nodes required to start the subproblem | |
constexpr Param< int > | MINPATHLEN { "heuristics/lpface/minpathlen" } |
the minimum active search tree path length along which lower bound hasn't changed before heuristic becomes active | |
constexpr Param< long long > | NODESOFS { "heuristics/lpface/nodesofs" } |
number of nodes added to the contingent of the total nodes | |
constexpr Param< double > | NODESQUOT { "heuristics/lpface/nodesquot" } |
contingent of sub problem nodes in relation to the number of nodes of the original problem | |
constexpr Param< int > | PRIORITY { "heuristics/lpface/priority" } |
priority of heuristic <lpface> | |
constexpr Param< char > | SUBSCIPOBJECTIVE { "heuristics/lpface/subscipobjective" } |
objective function in the sub-SCIP: (z)ero, (r)oot-LP-difference, (i)nference, LP (f)ractionality, (o)riginal | |
constexpr Param< bool > | USELPROWS { "heuristics/lpface/uselprows" } |
should subproblem be created out of the rows in the LP rows? | |
Parameters with prefix heuristics/lpface.
|
constexpr |
if uselprows == FALSE, should all active cuts from cutpool be copied to constraints in subproblem?
Definition at line 3299 of file parameters.hpp.
|
constexpr |
should dually nonbasic rows be turned into equations?
Definition at line 3295 of file parameters.hpp.
|
constexpr |
frequency for calling primal heuristic <lpface> (-1: never, 0: only at depth freqofs)
Definition at line 3275 of file parameters.hpp.
|
constexpr |
frequency offset for calling primal heuristic <lpface>
Definition at line 3277 of file parameters.hpp.
|
constexpr |
should the heuristic continue solving the same sub-SCIP?
Definition at line 3297 of file parameters.hpp.
|
constexpr |
factor by which the limit on the number of LP depends on the node limit
Definition at line 3291 of file parameters.hpp.
|
constexpr |
maximal depth level to call primal heuristic <lpface> (-1: no limit)
Definition at line 3279 of file parameters.hpp.
|
constexpr |
maximum number of nodes to regard in the subproblem
Definition at line 3283 of file parameters.hpp.
|
constexpr |
required percentage of fixed integer variables in sub-MIP to run
Definition at line 3289 of file parameters.hpp.
|
constexpr |
minimum number of nodes required to start the subproblem
Definition at line 3285 of file parameters.hpp.
|
constexpr |
the minimum active search tree path length along which lower bound hasn't changed before heuristic becomes active
Definition at line 3304 of file parameters.hpp.
|
constexpr |
number of nodes added to the contingent of the total nodes
Definition at line 3281 of file parameters.hpp.
|
constexpr |
contingent of sub problem nodes in relation to the number of nodes of the original problem
Definition at line 3287 of file parameters.hpp.
|
constexpr |
priority of heuristic <lpface>
Definition at line 3273 of file parameters.hpp.
|
constexpr |
objective function in the sub-SCIP: (z)ero, (r)oot-LP-difference, (i)nference, LP (f)ractionality, (o)riginal
Definition at line 3301 of file parameters.hpp.
|
constexpr |
should subproblem be created out of the rows in the LP rows?
Definition at line 3293 of file parameters.hpp.