Parameters with prefix branching/pscost. More...
Variables | |
constexpr Param< double > | MAXBOUNDDIST { "branching/pscost/maxbounddist" } |
maximal relative distance from current node's dual bound to primal bound compared to best node's dual bound for applying branching rule (0.0: only on current best node, 1.0: on all nodes) | |
constexpr Param< int > | MAXDEPTH { "branching/pscost/maxdepth" } |
maximal depth level, up to which branching rule <pscost> should be used (-1 for no limit) | |
constexpr Param< double > | MAXSCOREWEIGHT { "branching/pscost/maxscoreweight" } |
weight for maximum of scores of a branching candidate when building weighted sum of min/max/sum of scores | |
constexpr Param< double > | MINSCOREWEIGHT { "branching/pscost/minscoreweight" } |
weight for minimum of scores of a branching candidate when building weighted sum of min/max/sum of scores | |
constexpr Param< int > | NARYMAXDEPTH { "branching/pscost/narymaxdepth" } |
maximal depth where to do n-ary branching, -1 to turn off | |
constexpr Param< double > | NARYMINWIDTH { "branching/pscost/naryminwidth" } |
minimal domain width in children when doing n-ary branching, relative to global bounds | |
constexpr Param< double > | NARYWIDTHFACTOR { "branching/pscost/narywidthfactor" } |
factor of domain width in n-ary branching when creating nodes with increasing distance from branching value | |
constexpr Param< int > | NCHILDREN { "branching/pscost/nchildren" } |
number of children to create in n-ary branching | |
constexpr Param< int > | PRIORITY { "branching/pscost/priority" } |
priority of branching rule <pscost> | |
constexpr Param< char > | STRATEGY { "branching/pscost/strategy" } |
strategy for utilizing pseudo-costs of external branching candidates (multiply as in pseudo costs 'u'pdate rule, or by 'd'omain reduction, or by domain reduction of 's'ibling, or by 'v'ariable score) | |
constexpr Param< double > | SUMSCOREWEIGHT { "branching/pscost/sumscoreweight" } |
weight for sum of scores of a branching candidate when building weighted sum of min/max/sum of scores | |
Parameters with prefix branching/pscost.
|
constexpr |
maximal relative distance from current node's dual bound to primal bound compared to best node's dual bound for applying branching rule (0.0: only on current best node, 1.0: on all nodes)
Definition at line 391 of file parameters.hpp.
|
constexpr |
maximal depth level, up to which branching rule <pscost> should be used (-1 for no limit)
Definition at line 388 of file parameters.hpp.
|
constexpr |
weight for maximum of scores of a branching candidate when building weighted sum of min/max/sum of scores
Definition at line 398 of file parameters.hpp.
|
constexpr |
weight for minimum of scores of a branching candidate when building weighted sum of min/max/sum of scores
Definition at line 396 of file parameters.hpp.
|
constexpr |
maximal depth where to do n-ary branching, -1 to turn off
Definition at line 404 of file parameters.hpp.
|
constexpr |
minimal domain width in children when doing n-ary branching, relative to global bounds
Definition at line 406 of file parameters.hpp.
|
constexpr |
factor of domain width in n-ary branching when creating nodes with increasing distance from branching value
Definition at line 408 of file parameters.hpp.
|
constexpr |
number of children to create in n-ary branching
Definition at line 402 of file parameters.hpp.
|
constexpr |
priority of branching rule <pscost>
Definition at line 386 of file parameters.hpp.
|
constexpr |
strategy for utilizing pseudo-costs of external branching candidates (multiply as in pseudo costs 'u'pdate rule, or by 'd'omain reduction, or by domain reduction of 's'ibling, or by 'v'ariable score)
Definition at line 394 of file parameters.hpp.
|
constexpr |
weight for sum of scores of a branching candidate when building weighted sum of min/max/sum of scores
Definition at line 400 of file parameters.hpp.