Parameters with prefix branching/lookahead. More...

Variables
constexpr Param< bool >	ABBREVIATED { "branching/lookahead/abbreviated" }
	toggles the abbreviated LAB.

constexpr Param< bool >	ABBREVPSEUDO { "branching/lookahead/abbrevpseudo" }
	if abbreviated: Use pseudo costs to estimate the score of a candidate.

constexpr Param< int >	ADDBINCONSROW { "branching/lookahead/addbinconsrow" }
	should binary constraints be added as rows to the base LP? (0: no, 1: separate, 2: as initial rows)

constexpr Param< bool >	ADDCLIQUE { "branching/lookahead/addclique" }
	add binary constraints with two variables found at the root node also as a clique

constexpr Param< bool >	ADDNONVIOCONS { "branching/lookahead/addnonviocons" }
	should binary constraints, that are not violated by the base LP, be collected and added?

constexpr Param< bool >	APPLYCHILDBOUNDS { "branching/lookahead/applychildbounds" }
	should bounds known for child nodes be applied?

constexpr Param< char >	DEEPERSCORINGFUNCTION { "branching/lookahead/deeperscoringfunction" }
	scoring function to be used at deeper levels

constexpr Param< bool >	ENFORCEMAXDOMREDS { "branching/lookahead/enforcemaxdomreds" }
	should the maximum number of domain reductions maxnviolateddomreds be enforced?

constexpr Param< bool >	FILTERBYMAXGAIN { "branching/lookahead/filterbymaxgain" }
	should lookahead branching only be applied if the max gain in level 1 is not uniquely that of the best candidate?

constexpr Param< bool >	LEVEL2AVGSCORE { "branching/lookahead/level2avgscore" }
	should the average score be used for uninitialized scores in level 2?

constexpr Param< bool >	LEVEL2ZEROSCORE { "branching/lookahead/level2zeroscore" }
	should uninitialized scores in level 2 be set to 0?

constexpr Param< double >	MAXBOUNDDIST { "branching/lookahead/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/lookahead/maxdepth" }
	maximal depth level, up to which branching rule <lookahead> should be used (-1 for no limit)

constexpr Param< int >	MAXNCANDS { "branching/lookahead/maxncands" }
	if abbreviated: The max number of candidates to consider at the node.

constexpr Param< int >	MAXNDEEPERCANDS { "branching/lookahead/maxndeepercands" }
	if abbreviated: The max number of candidates to consider per deeper node.

constexpr Param< int >	MAXNVIOLATEDBINCONS { "branching/lookahead/maxnviolatedbincons" }
	how many binary constraints that are violated by the base lp solution should be gathered until the rule is stopped and they are added? [0 for unrestricted]

constexpr Param< int >	MAXNVIOLATEDCONS { "branching/lookahead/maxnviolatedcons" }
	how many constraints that are violated by the base lp solution should be gathered until the rule is stopped and they are added? [0 for unrestricted]

constexpr Param< int >	MAXNVIOLATEDDOMREDS { "branching/lookahead/maxnviolateddomreds" }
	how many domain reductions that are violated by the base lp solution should be gathered until the rule is stopped and they are added? [0 for unrestricted]

constexpr Param< int >	MAXPROPROUNDS { "branching/lookahead/maxproprounds" }
	maximum number of propagation rounds to perform at each temporary node (-1: unlimited, 0: SCIP default)

constexpr Param< bool >	MERGEDOMAINREDUCTIONS { "branching/lookahead/mergedomainreductions" }
	should domain reductions of feasible siblings should be merged?

constexpr Param< double >	MINWEIGHT { "branching/lookahead/minweight" }
	if scoringfunction is 's', this value is used to weight the min of the gains of two child problems in the convex combination

constexpr Param< bool >	ONLYVIOLDOMREDS { "branching/lookahead/onlyvioldomreds" }
	should only domain reductions that violate the LP solution be applied?

constexpr Param< bool >	PREFERSIMPLEBOUNDS { "branching/lookahead/prefersimplebounds" }
	should domain reductions only be applied if there are simple bound changes?

constexpr Param< int >	PRIORITY { "branching/lookahead/priority" }
	priority of branching rule <lookahead>

constexpr Param< bool >	PROPAGATE { "branching/lookahead/propagate" }
	should domain propagation be executed before each temporary node is solved?

constexpr Param< int >	RECURSIONDEPTH { "branching/lookahead/recursiondepth" }
	the max depth of LAB.

constexpr Param< long long >	REEVALAGE { "branching/lookahead/reevalage" }
	max number of LPs solved after which a previous prob branching results are recalculated

constexpr Param< long long >	REEVALAGEFSB { "branching/lookahead/reevalagefsb" }
	max number of LPs solved after which a previous FSB scoring results are recalculated

constexpr Param< bool >	REUSEBASIS { "branching/lookahead/reusebasis" }
	if abbreviated: Should the information gathered to obtain the best candidates be reused?

constexpr Param< char >	SCORINGFUNCTION { "branching/lookahead/scoringfunction" }
	scoring function to be used at the base level

constexpr Param< char >	SCORINGSCORINGFUNCTION { "branching/lookahead/scoringscoringfunction" }
	scoring function to be used during FSB scoring

constexpr Param< bool >	STOREUNVIOLATEDSOL { "branching/lookahead/storeunviolatedsol" }
	if only non violating constraints are added, should the branching decision be stored till the next call?

constexpr Param< bool >	UPDATEBRANCHINGRESULTS { "branching/lookahead/updatebranchingresults" }
	should branching results (and scores) be updated w.r.t. proven dual bounds?

constexpr Param< bool >	USEDOMAINREDUCTION { "branching/lookahead/usedomainreduction" }
	should domain reductions be collected and applied?

constexpr Param< bool >	USEIMPLIEDBINCONS { "branching/lookahead/useimpliedbincons" }
	should binary constraints be collected and applied?

constexpr Param< bool >	USELEVEL2DATA { "branching/lookahead/uselevel2data" }
	should branching data generated at depth level 2 be stored for re-using it?

constexpr Param< double >	WORSEFACTOR { "branching/lookahead/worsefactor" }
	if the FSB score is of a candidate is worse than the best by this factor, skip this candidate (-1: disable)

Detailed Description

Parameters with prefix branching/lookahead.

Variable Documentation

◆ ABBREVIATED

constexpr Param<bool> scippp::params::BRANCHING::LOOKAHEAD::ABBREVIATED { "branching/lookahead/abbreviated" }

constexpr

toggles the abbreviated LAB.

Definition at line 301 of file parameters.hpp.

◆ ABBREVPSEUDO

constexpr Param<bool> scippp::params::BRANCHING::LOOKAHEAD::ABBREVPSEUDO { "branching/lookahead/abbrevpseudo" }

constexpr

if abbreviated: Use pseudo costs to estimate the score of a candidate.

Definition at line 311 of file parameters.hpp.

◆ ADDBINCONSROW

constexpr Param<int> scippp::params::BRANCHING::LOOKAHEAD::ADDBINCONSROW { "branching/lookahead/addbinconsrow" }

constexpr

should binary constraints be added as rows to the base LP? (0: no, 1: separate, 2: as initial rows)

Definition at line 274 of file parameters.hpp.

◆ ADDCLIQUE

constexpr Param<bool> scippp::params::BRANCHING::LOOKAHEAD::ADDCLIQUE { "branching/lookahead/addclique" }

constexpr

add binary constraints with two variables found at the root node also as a clique

Definition at line 317 of file parameters.hpp.

◆ ADDNONVIOCONS

constexpr Param<bool> scippp::params::BRANCHING::LOOKAHEAD::ADDNONVIOCONS { "branching/lookahead/addnonviocons" }

constexpr

should binary constraints, that are not violated by the base LP, be collected and added?

Definition at line 299 of file parameters.hpp.

◆ APPLYCHILDBOUNDS

constexpr Param<bool> scippp::params::BRANCHING::LOOKAHEAD::APPLYCHILDBOUNDS { "branching/lookahead/applychildbounds" }

constexpr

should bounds known for child nodes be applied?

Definition at line 323 of file parameters.hpp.

◆ DEEPERSCORINGFUNCTION

constexpr Param<char> scippp::params::BRANCHING::LOOKAHEAD::DEEPERSCORINGFUNCTION { "branching/lookahead/deeperscoringfunction" }

constexpr

scoring function to be used at deeper levels

Definition at line 333 of file parameters.hpp.

◆ ENFORCEMAXDOMREDS

constexpr Param<bool> scippp::params::BRANCHING::LOOKAHEAD::ENFORCEMAXDOMREDS { "branching/lookahead/enforcemaxdomreds" }

constexpr

should the maximum number of domain reductions maxnviolateddomreds be enforced?

Definition at line 325 of file parameters.hpp.

◆ FILTERBYMAXGAIN

constexpr Param<bool> scippp::params::BRANCHING::LOOKAHEAD::FILTERBYMAXGAIN { "branching/lookahead/filterbymaxgain" }

constexpr

should lookahead branching only be applied if the max gain in level 1 is not uniquely that of the best candidate?

Definition at line 343 of file parameters.hpp.

◆ LEVEL2AVGSCORE

constexpr Param<bool> scippp::params::BRANCHING::LOOKAHEAD::LEVEL2AVGSCORE { "branching/lookahead/level2avgscore" }

constexpr

should the average score be used for uninitialized scores in level 2?

Definition at line 313 of file parameters.hpp.

◆ LEVEL2ZEROSCORE

constexpr Param<bool> scippp::params::BRANCHING::LOOKAHEAD::LEVEL2ZEROSCORE { "branching/lookahead/level2zeroscore" }

constexpr

should uninitialized scores in level 2 be set to 0?

Definition at line 315 of file parameters.hpp.

◆ MAXBOUNDDIST

constexpr Param<double> scippp::params::BRANCHING::LOOKAHEAD::MAXBOUNDDIST { "branching/lookahead/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 270 of file parameters.hpp.

◆ MAXDEPTH

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

constexpr

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

Definition at line 267 of file parameters.hpp.

◆ MAXNCANDS

constexpr Param<int> scippp::params::BRANCHING::LOOKAHEAD::MAXNCANDS { "branching/lookahead/maxncands" }

constexpr

if abbreviated: The max number of candidates to consider at the node.

Definition at line 303 of file parameters.hpp.

◆ MAXNDEEPERCANDS

constexpr Param<int> scippp::params::BRANCHING::LOOKAHEAD::MAXNDEEPERCANDS { "branching/lookahead/maxndeepercands" }

constexpr

if abbreviated: The max number of candidates to consider per deeper node.

Definition at line 305 of file parameters.hpp.

◆ MAXNVIOLATEDBINCONS

constexpr Param<int> scippp::params::BRANCHING::LOOKAHEAD::MAXNVIOLATEDBINCONS { "branching/lookahead/maxnviolatedbincons" }

constexpr

how many binary constraints that are violated by the base lp solution should be gathered until the rule is stopped and they are added? [0 for unrestricted]

Definition at line 280 of file parameters.hpp.

◆ MAXNVIOLATEDCONS

constexpr Param<int> scippp::params::BRANCHING::LOOKAHEAD::MAXNVIOLATEDCONS { "branching/lookahead/maxnviolatedcons" }

constexpr

how many constraints that are violated by the base lp solution should be gathered until the rule is stopped and they are added? [0 for unrestricted]

Definition at line 277 of file parameters.hpp.

◆ MAXNVIOLATEDDOMREDS

constexpr Param<int> scippp::params::BRANCHING::LOOKAHEAD::MAXNVIOLATEDDOMREDS { "branching/lookahead/maxnviolateddomreds" }

constexpr

how many domain reductions that are violated by the base lp solution should be gathered until the rule is stopped and they are added? [0 for unrestricted]

Definition at line 283 of file parameters.hpp.

◆ MAXPROPROUNDS

constexpr Param<int> scippp::params::BRANCHING::LOOKAHEAD::MAXPROPROUNDS { "branching/lookahead/maxproprounds" }

constexpr

maximum number of propagation rounds to perform at each temporary node (-1: unlimited, 0: SCIP default)

Definition at line 329 of file parameters.hpp.

◆ MERGEDOMAINREDUCTIONS

constexpr Param<bool> scippp::params::BRANCHING::LOOKAHEAD::MERGEDOMAINREDUCTIONS { "branching/lookahead/mergedomainreductions" }

constexpr

should domain reductions of feasible siblings should be merged?

Definition at line 293 of file parameters.hpp.

◆ MINWEIGHT

constexpr Param<double> scippp::params::BRANCHING::LOOKAHEAD::MINWEIGHT { "branching/lookahead/minweight" }

constexpr

if scoringfunction is 's', this value is used to weight the min of the gains of two child problems in the convex combination

Definition at line 338 of file parameters.hpp.

◆ ONLYVIOLDOMREDS

constexpr Param<bool> scippp::params::BRANCHING::LOOKAHEAD::ONLYVIOLDOMREDS { "branching/lookahead/onlyvioldomreds" }

constexpr

should only domain reductions that violate the LP solution be applied?

Definition at line 297 of file parameters.hpp.

◆ PREFERSIMPLEBOUNDS

constexpr Param<bool> scippp::params::BRANCHING::LOOKAHEAD::PREFERSIMPLEBOUNDS { "branching/lookahead/prefersimplebounds" }

constexpr

should domain reductions only be applied if there are simple bound changes?

Definition at line 295 of file parameters.hpp.

◆ PRIORITY

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

constexpr

priority of branching rule <lookahead>

Definition at line 265 of file parameters.hpp.

◆ PROPAGATE

constexpr Param<bool> scippp::params::BRANCHING::LOOKAHEAD::PROPAGATE { "branching/lookahead/propagate" }

constexpr

should domain propagation be executed before each temporary node is solved?

Definition at line 319 of file parameters.hpp.

◆ RECURSIONDEPTH

constexpr Param<int> scippp::params::BRANCHING::LOOKAHEAD::RECURSIONDEPTH { "branching/lookahead/recursiondepth" }

constexpr

the max depth of LAB.

Definition at line 289 of file parameters.hpp.

◆ REEVALAGE

constexpr Param<long long> scippp::params::BRANCHING::LOOKAHEAD::REEVALAGE { "branching/lookahead/reevalage" }

constexpr

max number of LPs solved after which a previous prob branching results are recalculated

Definition at line 285 of file parameters.hpp.

◆ REEVALAGEFSB

constexpr Param<long long> scippp::params::BRANCHING::LOOKAHEAD::REEVALAGEFSB { "branching/lookahead/reevalagefsb" }

constexpr

max number of LPs solved after which a previous FSB scoring results are recalculated

Definition at line 287 of file parameters.hpp.

◆ REUSEBASIS

constexpr Param<bool> scippp::params::BRANCHING::LOOKAHEAD::REUSEBASIS { "branching/lookahead/reusebasis" }

constexpr

if abbreviated: Should the information gathered to obtain the best candidates be reused?

Definition at line 307 of file parameters.hpp.

◆ SCORINGFUNCTION

constexpr Param<char> scippp::params::BRANCHING::LOOKAHEAD::SCORINGFUNCTION { "branching/lookahead/scoringfunction" }

constexpr

scoring function to be used at the base level

Definition at line 331 of file parameters.hpp.

◆ SCORINGSCORINGFUNCTION

constexpr Param<char> scippp::params::BRANCHING::LOOKAHEAD::SCORINGSCORINGFUNCTION { "branching/lookahead/scoringscoringfunction" }

constexpr

scoring function to be used during FSB scoring

Definition at line 335 of file parameters.hpp.

◆ STOREUNVIOLATEDSOL

constexpr Param<bool> scippp::params::BRANCHING::LOOKAHEAD::STOREUNVIOLATEDSOL { "branching/lookahead/storeunviolatedsol" }

constexpr

if only non violating constraints are added, should the branching decision be stored till the next call?

Definition at line 309 of file parameters.hpp.

◆ UPDATEBRANCHINGRESULTS

constexpr Param<bool> scippp::params::BRANCHING::LOOKAHEAD::UPDATEBRANCHINGRESULTS { "branching/lookahead/updatebranchingresults" }

constexpr

should branching results (and scores) be updated w.r.t. proven dual bounds?

Definition at line 327 of file parameters.hpp.

◆ USEDOMAINREDUCTION

constexpr Param<bool> scippp::params::BRANCHING::LOOKAHEAD::USEDOMAINREDUCTION { "branching/lookahead/usedomainreduction" }

constexpr

should domain reductions be collected and applied?

Definition at line 291 of file parameters.hpp.

◆ USEIMPLIEDBINCONS

constexpr Param<bool> scippp::params::BRANCHING::LOOKAHEAD::USEIMPLIEDBINCONS { "branching/lookahead/useimpliedbincons" }

constexpr

should binary constraints be collected and applied?

Definition at line 272 of file parameters.hpp.

◆ USELEVEL2DATA

constexpr Param<bool> scippp::params::BRANCHING::LOOKAHEAD::USELEVEL2DATA { "branching/lookahead/uselevel2data" }

constexpr

should branching data generated at depth level 2 be stored for re-using it?

Definition at line 321 of file parameters.hpp.

◆ WORSEFACTOR

constexpr Param<double> scippp::params::BRANCHING::LOOKAHEAD::WORSEFACTOR { "branching/lookahead/worsefactor" }

constexpr

if the FSB score is of a candidate is worse than the best by this factor, skip this candidate (-1: disable)

Definition at line 340 of file parameters.hpp.

SCIP++ refs/heads/main

Variables

Detailed Description

Variable Documentation

◆ ABBREVIATED

◆ ABBREVPSEUDO

◆ ADDBINCONSROW

◆ ADDCLIQUE

◆ ADDNONVIOCONS

◆ APPLYCHILDBOUNDS

◆ DEEPERSCORINGFUNCTION

◆ ENFORCEMAXDOMREDS

◆ FILTERBYMAXGAIN

◆ LEVEL2AVGSCORE

◆ LEVEL2ZEROSCORE

◆ MAXBOUNDDIST

◆ MAXDEPTH

◆ MAXNCANDS

◆ MAXNDEEPERCANDS

◆ MAXNVIOLATEDBINCONS

◆ MAXNVIOLATEDCONS

◆ MAXNVIOLATEDDOMREDS

◆ MAXPROPROUNDS

◆ MERGEDOMAINREDUCTIONS

◆ MINWEIGHT

◆ ONLYVIOLDOMREDS

◆ PREFERSIMPLEBOUNDS

◆ PRIORITY

◆ PROPAGATE

◆ RECURSIONDEPTH

◆ REEVALAGE

◆ REEVALAGEFSB

◆ REUSEBASIS

◆ SCORINGFUNCTION

◆ SCORINGSCORINGFUNCTION

◆ STOREUNVIOLATEDSOL

◆ UPDATEBRANCHINGRESULTS

◆ USEDOMAINREDUCTION

◆ USEIMPLIEDBINCONS

◆ USELEVEL2DATA

◆ WORSEFACTOR