Parameters with prefix branching/relpscost. More...

Variables
constexpr Param< int >	CONFIDENCELEVEL { "branching/relpscost/confidencelevel" }
	the confidence level for statistical methods, between 0 (Min) and 4 (Max).

constexpr Param< double >	CONFLICTLENGTHWEIGHT { "branching/relpscost/conflictlengthweight" }
	weight in score calculations for conflict length score

constexpr Param< double >	CONFLICTWEIGHT { "branching/relpscost/conflictweight" }
	weight in score calculations for conflict score

constexpr Param< double >	CUTOFFWEIGHT { "branching/relpscost/cutoffweight" }
	weight in score calculations for cutoff score

constexpr Param< int >	DEGENERACYAWARE { "branching/relpscost/degeneracyaware" }
	should degeneracy be taken into account to update weights and skip strong branching? (0: off, 1: after root, 2: always)

constexpr Param< bool >	DYNAMICWEIGHTS { "branching/relpscost/dynamicweights" }
	should the weights of the branching rule be adjusted dynamically during solving based on objective and infeasible leaf counters?

constexpr Param< bool >	FILTERCANDSSYM { "branching/relpscost/filtercandssym" }
	Use symmetry to filter branching candidates?

constexpr Param< double >	HIGHERRORTOL { "branching/relpscost/higherrortol" }
	high relative error tolerance for reliability

constexpr Param< double >	INFERENCEWEIGHT { "branching/relpscost/inferenceweight" }
	weight in score calculations for inference score

constexpr Param< int >	INITCAND { "branching/relpscost/initcand" }
	maximal number of candidates initialized with strong branching per node

constexpr Param< int >	INITITER { "branching/relpscost/inititer" }
	iteration limit for strong branching initializations of pseudo cost entries (0: auto)

constexpr Param< double >	LOWERRORTOL { "branching/relpscost/lowerrortol" }
	low relative error tolerance for reliability

constexpr Param< int >	MAXBDCHGS { "branching/relpscost/maxbdchgs" }
	maximal number of bound tightenings before the node is reevaluated (-1: unlimited)

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

constexpr Param< int >	MAXLOOKAHEAD { "branching/relpscost/maxlookahead" }
	maximal number of further variables evaluated without better score

constexpr Param< int >	MAXPROPROUNDS { "branching/relpscost/maxproprounds" }
	maximum number of propagation rounds to be performed during strong branching before solving the LP (-1: no limit, -2: parameter settings)

constexpr Param< double >	MAXRELIABLE { "branching/relpscost/maxreliable" }
	maximal value for minimum pseudo cost size to regard pseudo cost value as reliable

constexpr Param< double >	MINRELIABLE { "branching/relpscost/minreliable" }
	minimal value for minimum pseudo cost size to regard pseudo cost value as reliable

constexpr Param< double >	NLSCOREWEIGHT { "branching/relpscost/nlscoreweight" }
	weight in score calculations for nlcount score

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

constexpr Param< bool >	PROBINGBOUNDS { "branching/relpscost/probingbounds" }
	should valid bounds be identified in a probing-like fashion during strong branching (only with propagation)?

constexpr Param< double >	PSCOSTWEIGHT { "branching/relpscost/pscostweight" }
	weight in score calculations for pseudo cost score

constexpr Param< bool >	RANDINITORDER { "branching/relpscost/randinitorder" }
	should candidates be initialized in randomized order?

constexpr Param< int >	SBITEROFS { "branching/relpscost/sbiterofs" }
	additional number of allowed strong branching LP iterations

constexpr Param< double >	SBITERQUOT { "branching/relpscost/sbiterquot" }
	maximal fraction of strong branching LP iterations compared to node relaxation LP iterations

constexpr Param< bool >	SKIPBADINITCANDS { "branching/relpscost/skipbadinitcands" }
	should branching rule skip candidates that have a low probability to be better than the best strong-branching or pseudo-candidate?

constexpr Param< int >	STARTRANDSEED { "branching/relpscost/startrandseed" }
	start seed for random number generation

constexpr Param< bool >	STORESEMIINITCOSTS { "branching/relpscost/storesemiinitcosts" }
	should strong branching result be considered for pseudo costs if the other direction was infeasible?

constexpr Param< bool >	TRANSSYMPSCOST { "branching/relpscost/transsympscost" }
	Transfer pscost information to symmetric variables?

constexpr Param< bool >	USEDYNAMICCONFIDENCE { "branching/relpscost/usedynamicconfidence" }
	should the confidence level be adjusted dynamically?

constexpr Param< bool >	USEHYPTESTFORRELIABILITY { "branching/relpscost/usehyptestforreliability" }
	should the strong branching decision be based on a hypothesis test?

constexpr Param< bool >	USERELERRORRELIABILITY { "branching/relpscost/userelerrorreliability" }
	should reliability be based on relative errors?

constexpr Param< bool >	USESBLOCALINFO { "branching/relpscost/usesblocalinfo" }
	should the scoring function use only local cutoff and inference information obtained for strong branching candidates?

constexpr Param< bool >	USESMALLWEIGHTSITLIM { "branching/relpscost/usesmallweightsitlim" }
	should smaller weights be used for pseudo cost updates after hitting the LP iteration limit?

Detailed Description

Parameters with prefix branching/relpscost.

Variable Documentation

◆ CONFIDENCELEVEL

constexpr Param<int> scippp::params::BRANCHING::RELPSCOST::CONFIDENCELEVEL { "branching/relpscost/confidencelevel" }

constexpr

the confidence level for statistical methods, between 0 (Min) and 4 (Max).

Definition at line 483 of file parameters.hpp.

◆ CONFLICTLENGTHWEIGHT

constexpr Param<double> scippp::params::BRANCHING::RELPSCOST::CONFLICTLENGTHWEIGHT { "branching/relpscost/conflictlengthweight" }

constexpr

weight in score calculations for conflict length score

Definition at line 434 of file parameters.hpp.

◆ CONFLICTWEIGHT

constexpr Param<double> scippp::params::BRANCHING::RELPSCOST::CONFLICTWEIGHT { "branching/relpscost/conflictweight" }

constexpr

weight in score calculations for conflict score

Definition at line 432 of file parameters.hpp.

◆ CUTOFFWEIGHT

constexpr Param<double> scippp::params::BRANCHING::RELPSCOST::CUTOFFWEIGHT { "branching/relpscost/cutoffweight" }

constexpr

weight in score calculations for cutoff score

Definition at line 438 of file parameters.hpp.

◆ DEGENERACYAWARE

constexpr Param<int> scippp::params::BRANCHING::RELPSCOST::DEGENERACYAWARE { "branching/relpscost/degeneracyaware" }

constexpr

should degeneracy be taken into account to update weights and skip strong branching? (0: off, 1: after root, 2: always)

Definition at line 493 of file parameters.hpp.

◆ DYNAMICWEIGHTS

constexpr Param<bool> scippp::params::BRANCHING::RELPSCOST::DYNAMICWEIGHTS { "branching/relpscost/dynamicweights" }

constexpr

should the weights of the branching rule be adjusted dynamically during solving based on objective and infeasible leaf counters?

Definition at line 490 of file parameters.hpp.

◆ FILTERCANDSSYM

constexpr Param<bool> scippp::params::BRANCHING::RELPSCOST::FILTERCANDSSYM { "branching/relpscost/filtercandssym" }

constexpr

Use symmetry to filter branching candidates?

Definition at line 497 of file parameters.hpp.

◆ HIGHERRORTOL

constexpr Param<double> scippp::params::BRANCHING::RELPSCOST::HIGHERRORTOL { "branching/relpscost/higherrortol" }

constexpr

high relative error tolerance for reliability

Definition at line 469 of file parameters.hpp.

◆ INFERENCEWEIGHT

constexpr Param<double> scippp::params::BRANCHING::RELPSCOST::INFERENCEWEIGHT { "branching/relpscost/inferenceweight" }

constexpr

weight in score calculations for inference score

Definition at line 436 of file parameters.hpp.

◆ INITCAND

constexpr Param<int> scippp::params::BRANCHING::RELPSCOST::INITCAND { "branching/relpscost/initcand" }

constexpr

maximal number of candidates initialized with strong branching per node

Definition at line 454 of file parameters.hpp.

◆ INITITER

constexpr Param<int> scippp::params::BRANCHING::RELPSCOST::INITITER { "branching/relpscost/inititer" }

constexpr

iteration limit for strong branching initializations of pseudo cost entries (0: auto)

Definition at line 456 of file parameters.hpp.

◆ LOWERRORTOL

constexpr Param<double> scippp::params::BRANCHING::RELPSCOST::LOWERRORTOL { "branching/relpscost/lowerrortol" }

constexpr

low relative error tolerance for reliability

Definition at line 467 of file parameters.hpp.

◆ MAXBDCHGS

constexpr Param<int> scippp::params::BRANCHING::RELPSCOST::MAXBDCHGS { "branching/relpscost/maxbdchgs" }

constexpr

maximal number of bound tightenings before the node is reevaluated (-1: unlimited)

Definition at line 458 of file parameters.hpp.

◆ MAXBOUNDDIST

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

◆ MAXDEPTH

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

constexpr

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

Definition at line 427 of file parameters.hpp.

◆ MAXLOOKAHEAD

constexpr Param<int> scippp::params::BRANCHING::RELPSCOST::MAXLOOKAHEAD { "branching/relpscost/maxlookahead" }

constexpr

maximal number of further variables evaluated without better score

Definition at line 452 of file parameters.hpp.

◆ MAXPROPROUNDS

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

constexpr

maximum number of propagation rounds to be performed during strong branching before solving the LP (-1: no limit, -2: parameter settings)

Definition at line 461 of file parameters.hpp.

◆ MAXRELIABLE

constexpr Param<double> scippp::params::BRANCHING::RELPSCOST::MAXRELIABLE { "branching/relpscost/maxreliable" }

constexpr

maximal value for minimum pseudo cost size to regard pseudo cost value as reliable

Definition at line 446 of file parameters.hpp.

◆ MINRELIABLE

constexpr Param<double> scippp::params::BRANCHING::RELPSCOST::MINRELIABLE { "branching/relpscost/minreliable" }

constexpr

minimal value for minimum pseudo cost size to regard pseudo cost value as reliable

Definition at line 444 of file parameters.hpp.

◆ NLSCOREWEIGHT

constexpr Param<double> scippp::params::BRANCHING::RELPSCOST::NLSCOREWEIGHT { "branching/relpscost/nlscoreweight" }

constexpr

weight in score calculations for nlcount score

Definition at line 442 of file parameters.hpp.

◆ PRIORITY

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

constexpr

priority of branching rule <relpscost>

Definition at line 425 of file parameters.hpp.

◆ PROBINGBOUNDS

constexpr Param<bool> scippp::params::BRANCHING::RELPSCOST::PROBINGBOUNDS { "branching/relpscost/probingbounds" }

constexpr

should valid bounds be identified in a probing-like fashion during strong branching (only with propagation)?

Definition at line 463 of file parameters.hpp.

◆ PSCOSTWEIGHT

constexpr Param<double> scippp::params::BRANCHING::RELPSCOST::PSCOSTWEIGHT { "branching/relpscost/pscostweight" }

constexpr

weight in score calculations for pseudo cost score

Definition at line 440 of file parameters.hpp.

◆ RANDINITORDER

constexpr Param<bool> scippp::params::BRANCHING::RELPSCOST::RANDINITORDER { "branching/relpscost/randinitorder" }

constexpr

should candidates be initialized in randomized order?

Definition at line 485 of file parameters.hpp.

◆ SBITEROFS

constexpr Param<int> scippp::params::BRANCHING::RELPSCOST::SBITEROFS { "branching/relpscost/sbiterofs" }

constexpr

additional number of allowed strong branching LP iterations

Definition at line 450 of file parameters.hpp.

◆ SBITERQUOT

constexpr Param<double> scippp::params::BRANCHING::RELPSCOST::SBITERQUOT { "branching/relpscost/sbiterquot" }

constexpr

maximal fraction of strong branching LP iterations compared to node relaxation LP iterations

Definition at line 448 of file parameters.hpp.

◆ SKIPBADINITCANDS

constexpr Param<bool> scippp::params::BRANCHING::RELPSCOST::SKIPBADINITCANDS { "branching/relpscost/skipbadinitcands" }

constexpr

should branching rule skip candidates that have a low probability to be better than the best strong-branching or pseudo-candidate?

Definition at line 481 of file parameters.hpp.

◆ STARTRANDSEED

constexpr Param<int> scippp::params::BRANCHING::RELPSCOST::STARTRANDSEED { "branching/relpscost/startrandseed" }

constexpr

start seed for random number generation

Definition at line 495 of file parameters.hpp.

◆ STORESEMIINITCOSTS

constexpr Param<bool> scippp::params::BRANCHING::RELPSCOST::STORESEMIINITCOSTS { "branching/relpscost/storesemiinitcosts" }

constexpr

should strong branching result be considered for pseudo costs if the other direction was infeasible?

Definition at line 471 of file parameters.hpp.

◆ TRANSSYMPSCOST

constexpr Param<bool> scippp::params::BRANCHING::RELPSCOST::TRANSSYMPSCOST { "branching/relpscost/transsympscost" }

constexpr

Transfer pscost information to symmetric variables?

Definition at line 499 of file parameters.hpp.

◆ USEDYNAMICCONFIDENCE

constexpr Param<bool> scippp::params::BRANCHING::RELPSCOST::USEDYNAMICCONFIDENCE { "branching/relpscost/usedynamicconfidence" }

constexpr

should the confidence level be adjusted dynamically?

Definition at line 478 of file parameters.hpp.

◆ USEHYPTESTFORRELIABILITY

constexpr Param<bool> scippp::params::BRANCHING::RELPSCOST::USEHYPTESTFORRELIABILITY { "branching/relpscost/usehyptestforreliability" }

constexpr

should the strong branching decision be based on a hypothesis test?

Definition at line 476 of file parameters.hpp.

◆ USERELERRORRELIABILITY

constexpr Param<bool> scippp::params::BRANCHING::RELPSCOST::USERELERRORRELIABILITY { "branching/relpscost/userelerrorreliability" }

constexpr

should reliability be based on relative errors?

Definition at line 465 of file parameters.hpp.

◆ USESBLOCALINFO

constexpr Param<bool> scippp::params::BRANCHING::RELPSCOST::USESBLOCALINFO { "branching/relpscost/usesblocalinfo" }

constexpr

should the scoring function use only local cutoff and inference information obtained for strong branching candidates?

Definition at line 474 of file parameters.hpp.

◆ USESMALLWEIGHTSITLIM

constexpr Param<bool> scippp::params::BRANCHING::RELPSCOST::USESMALLWEIGHTSITLIM { "branching/relpscost/usesmallweightsitlim" }

constexpr

should smaller weights be used for pseudo cost updates after hitting the LP iteration limit?

Definition at line 487 of file parameters.hpp.

SCIP++ refs/heads/main

Variables

Detailed Description

Variable Documentation

◆ CONFIDENCELEVEL

◆ CONFLICTLENGTHWEIGHT

◆ CONFLICTWEIGHT

◆ CUTOFFWEIGHT

◆ DEGENERACYAWARE

◆ DYNAMICWEIGHTS

◆ FILTERCANDSSYM

◆ HIGHERRORTOL

◆ INFERENCEWEIGHT

◆ INITCAND

◆ INITITER

◆ LOWERRORTOL

◆ MAXBDCHGS

◆ MAXBOUNDDIST

◆ MAXDEPTH

◆ MAXLOOKAHEAD

◆ MAXPROPROUNDS

◆ MAXRELIABLE

◆ MINRELIABLE

◆ NLSCOREWEIGHT

◆ PRIORITY

◆ PROBINGBOUNDS

◆ PSCOSTWEIGHT

◆ RANDINITORDER

◆ SBITEROFS

◆ SBITERQUOT

◆ SKIPBADINITCANDS

◆ STARTRANDSEED

◆ STORESEMIINITCOSTS

◆ TRANSSYMPSCOST

◆ USEDYNAMICCONFIDENCE

◆ USEHYPTESTFORRELIABILITY

◆ USERELERRORRELIABILITY

◆ USESBLOCALINFO

◆ USESMALLWEIGHTSITLIM