SCIP++ refs/heads/main
 
Loading...
Searching...
No Matches
scippp::params::BRANCHING::PSCOST Namespace Reference

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
 

Detailed Description

Parameters with prefix branching/pscost.

Variable Documentation

◆ MAXBOUNDDIST

Param<double> scippp::params::BRANCHING::PSCOST::MAXBOUNDDIST { "branching/pscost/maxbounddist" }
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 418 of file parameters.hpp.

◆ MAXDEPTH

Param<int> scippp::params::BRANCHING::PSCOST::MAXDEPTH { "branching/pscost/maxdepth" }
constexpr

maximal depth level, up to which branching rule <pscost> should be used (-1 for no limit)

Definition at line 415 of file parameters.hpp.

◆ MAXSCOREWEIGHT

Param<double> scippp::params::BRANCHING::PSCOST::MAXSCOREWEIGHT { "branching/pscost/maxscoreweight" }
constexpr

weight for maximum of scores of a branching candidate when building weighted sum of min/max/sum of scores

Definition at line 425 of file parameters.hpp.

◆ MINSCOREWEIGHT

Param<double> scippp::params::BRANCHING::PSCOST::MINSCOREWEIGHT { "branching/pscost/minscoreweight" }
constexpr

weight for minimum of scores of a branching candidate when building weighted sum of min/max/sum of scores

Definition at line 423 of file parameters.hpp.

◆ NARYMAXDEPTH

Param<int> scippp::params::BRANCHING::PSCOST::NARYMAXDEPTH { "branching/pscost/narymaxdepth" }
constexpr

maximal depth where to do n-ary branching, -1 to turn off

Definition at line 431 of file parameters.hpp.

◆ NARYMINWIDTH

Param<double> scippp::params::BRANCHING::PSCOST::NARYMINWIDTH { "branching/pscost/naryminwidth" }
constexpr

minimal domain width in children when doing n-ary branching, relative to global bounds

Definition at line 433 of file parameters.hpp.

◆ NARYWIDTHFACTOR

Param<double> scippp::params::BRANCHING::PSCOST::NARYWIDTHFACTOR { "branching/pscost/narywidthfactor" }
constexpr

factor of domain width in n-ary branching when creating nodes with increasing distance from branching value

Definition at line 435 of file parameters.hpp.

◆ NCHILDREN

Param<int> scippp::params::BRANCHING::PSCOST::NCHILDREN { "branching/pscost/nchildren" }
constexpr

number of children to create in n-ary branching

Definition at line 429 of file parameters.hpp.

◆ PRIORITY

Param<int> scippp::params::BRANCHING::PSCOST::PRIORITY { "branching/pscost/priority" }
constexpr

priority of branching rule <pscost>

Definition at line 413 of file parameters.hpp.

◆ STRATEGY

Param<char> scippp::params::BRANCHING::PSCOST::STRATEGY { "branching/pscost/strategy" }
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 421 of file parameters.hpp.

◆ SUMSCOREWEIGHT

Param<double> scippp::params::BRANCHING::PSCOST::SUMSCOREWEIGHT { "branching/pscost/sumscoreweight" }
constexpr

weight for sum of scores of a branching candidate when building weighted sum of min/max/sum of scores

Definition at line 427 of file parameters.hpp.