Parameters with prefix branching. More...

Namespaces
namespace	ALLFULLSTRONG
	Parameters with prefix branching/allfullstrong.

namespace	CLOUD
	Parameters with prefix branching/cloud.

namespace	DISTRIBUTION
	Parameters with prefix branching/distribution.

namespace	FULLSTRONG
	Parameters with prefix branching/fullstrong.

namespace	INFERENCE
	Parameters with prefix branching/inference.

namespace	LEASTINF
	Parameters with prefix branching/leastinf.

namespace	LOOKAHEAD
	Parameters with prefix branching/lookahead.

namespace	MOSTINF
	Parameters with prefix branching/mostinf.

namespace	MULTAGGR
	Parameters with prefix branching/multaggr.

namespace	NODEREOPT
	Parameters with prefix branching/nodereopt.

namespace	PSCOST
	Parameters with prefix branching/pscost.

namespace	RANDOM
	Parameters with prefix branching/random.

namespace	RELPSCOST
	Parameters with prefix branching/relpscost.

namespace	TREEMODEL
	Parameters with prefix branching/treemodel.

namespace	VANILLAFULLSTRONG
	Parameters with prefix branching/vanillafullstrong.

Variables
constexpr Param< bool >	CHECKSOL { "branching/checksol" }
	should LP solutions during strong branching with propagation be checked for feasibility?

constexpr Param< double >	CLAMP { "branching/clamp" }
	minimal relative distance of branching point to bounds when branching on a continuous variable

constexpr Param< bool >	DELAYPSCOSTUPDATE { "branching/delaypscostupdate" }
	should updating pseudo costs for continuous variables be delayed to the time after separation?

constexpr Param< bool >	DIVINGPSCOST { "branching/divingpscost" }
	should pseudo costs be updated also in diving and probing mode?

constexpr Param< char >	FIRSTSBCHILD { "branching/firstsbchild" }
	child node to be regarded first during strong branching (only with propagation): 'u'p child, 'd'own child, 'h'istory-based, or 'a'utomatic

constexpr Param< bool >	FORCEALLCHILDREN { "branching/forceallchildren" }
	should all strong branching children be regarded even if one is detected to be infeasible? (only with propagation)

constexpr Param< char >	LPGAINNORMALIZE { "branching/lpgainnormalize" }
	strategy for normalization of LP gain when updating pseudocosts of continuous variables (divide by movement of 'l'p value, reduction in 'd'omain width, or reduction in domain width of 's'ibling)

constexpr Param< double >	MIDPULL { "branching/midpull" }
	fraction by which to move branching point of a continuous variable towards the middle of the domain; a value of 1.0 leads to branching always in the middle of the domain

constexpr Param< double >	MIDPULLRELDOMTRIG { "branching/midpullreldomtrig" }
	multiply midpull by relative domain width if the latter is below this value

constexpr Param< bool >	PREFERBINARY { "branching/preferbinary" }
	should branching on binary variables be preferred?

constexpr Param< bool >	ROUNDSBSOL { "branching/roundsbsol" }
	should LP solutions during strong branching with propagation be rounded? (only when checksbsol=TRUE)

constexpr Param< double >	SCOREFAC { "branching/scorefac" }
	branching score factor to weigh downward and upward gain prediction in sum score function

constexpr Param< char >	SCOREFUNC { "branching/scorefunc" }
	branching score function ('s'um, 'p'roduct, 'q'uotient)

constexpr Param< bool >	SUMADJUSTSCORE { "branching/sumadjustscore" }
	score adjustment near zero by adding epsilon (TRUE) or using maximum (FALSE)

Detailed Description

Parameters with prefix branching.

Variable Documentation

◆ CHECKSOL

constexpr Param<bool> scippp::params::BRANCHING::CHECKSOL { "branching/checksol" }

constexpr

should LP solutions during strong branching with propagation be checked for feasibility?

Definition at line 149 of file parameters.hpp.

◆ CLAMP

constexpr Param<double> scippp::params::BRANCHING::CLAMP { "branching/clamp" }

constexpr

minimal relative distance of branching point to bounds when branching on a continuous variable

Definition at line 129 of file parameters.hpp.

◆ DELAYPSCOSTUPDATE

constexpr Param<bool> scippp::params::BRANCHING::DELAYPSCOSTUPDATE { "branching/delaypscostupdate" }

constexpr

should updating pseudo costs for continuous variables be delayed to the time after separation?

Definition at line 139 of file parameters.hpp.

◆ DIVINGPSCOST

constexpr Param<bool> scippp::params::BRANCHING::DIVINGPSCOST { "branching/divingpscost" }

constexpr

should pseudo costs be updated also in diving and probing mode?

Definition at line 141 of file parameters.hpp.

◆ FIRSTSBCHILD

constexpr Param<char> scippp::params::BRANCHING::FIRSTSBCHILD { "branching/firstsbchild" }

constexpr

child node to be regarded first during strong branching (only with propagation): 'u'p child, 'd'own child, 'h'istory-based, or 'a'utomatic

Definition at line 147 of file parameters.hpp.

◆ FORCEALLCHILDREN

constexpr Param<bool> scippp::params::BRANCHING::FORCEALLCHILDREN { "branching/forceallchildren" }

constexpr

should all strong branching children be regarded even if one is detected to be infeasible? (only with propagation)

Definition at line 144 of file parameters.hpp.

◆ LPGAINNORMALIZE

constexpr Param<char> scippp::params::BRANCHING::LPGAINNORMALIZE { "branching/lpgainnormalize" }

constexpr

strategy for normalization of LP gain when updating pseudocosts of continuous variables (divide by movement of 'l'p value, reduction in 'd'omain width, or reduction in domain width of 's'ibling)

Definition at line 137 of file parameters.hpp.

◆ MIDPULL

constexpr Param<double> scippp::params::BRANCHING::MIDPULL { "branching/midpull" }

constexpr

fraction by which to move branching point of a continuous variable towards the middle of the domain; a value of 1.0 leads to branching always in the middle of the domain

Definition at line 132 of file parameters.hpp.

◆ MIDPULLRELDOMTRIG

constexpr Param<double> scippp::params::BRANCHING::MIDPULLRELDOMTRIG { "branching/midpullreldomtrig" }

constexpr

multiply midpull by relative domain width if the latter is below this value

Definition at line 134 of file parameters.hpp.

◆ PREFERBINARY

constexpr Param<bool> scippp::params::BRANCHING::PREFERBINARY { "branching/preferbinary" }

constexpr

should branching on binary variables be preferred?

Definition at line 127 of file parameters.hpp.

◆ ROUNDSBSOL

constexpr Param<bool> scippp::params::BRANCHING::ROUNDSBSOL { "branching/roundsbsol" }

constexpr

should LP solutions during strong branching with propagation be rounded? (only when checksbsol=TRUE)

Definition at line 151 of file parameters.hpp.

◆ SCOREFAC

constexpr Param<double> scippp::params::BRANCHING::SCOREFAC { "branching/scorefac" }

constexpr

branching score factor to weigh downward and upward gain prediction in sum score function

Definition at line 125 of file parameters.hpp.

◆ SCOREFUNC

constexpr Param<char> scippp::params::BRANCHING::SCOREFUNC { "branching/scorefunc" }

constexpr

branching score function ('s'um, 'p'roduct, 'q'uotient)

Definition at line 123 of file parameters.hpp.

◆ SUMADJUSTSCORE

constexpr Param<bool> scippp::params::BRANCHING::SUMADJUSTSCORE { "branching/sumadjustscore" }

constexpr

score adjustment near zero by adding epsilon (TRUE) or using maximum (FALSE)

Definition at line 153 of file parameters.hpp.

SCIP++ refs/heads/main

Namespaces

Variables

Detailed Description

Variable Documentation

◆ CHECKSOL

◆ CLAMP

◆ DELAYPSCOSTUPDATE

◆ DIVINGPSCOST

◆ FIRSTSBCHILD

◆ FORCEALLCHILDREN

◆ LPGAINNORMALIZE

◆ MIDPULL

◆ MIDPULLRELDOMTRIG

◆ PREFERBINARY

◆ ROUNDSBSOL

◆ SCOREFAC

◆ SCOREFUNC

◆ SUMADJUSTSCORE