Parameters with prefix constraints/linear. More...

Namespaces
namespace	UPGRADE
	Parameters with prefix constraints/linear/upgrade.

Variables
constexpr Param< bool >	AGGREGATEVARIABLES { "constraints/linear/aggregatevariables" }
	should presolving search for aggregations in equations

constexpr Param< bool >	CHECKRELMAXABS { "constraints/linear/checkrelmaxabs" }
	should the violation for a constraint with side 0.0 be checked relative to 1.0 (FALSE) or to the maximum absolute value in the activity (TRUE)?

constexpr Param< bool >	DELAYPROP { "constraints/linear/delayprop" }
	should propagation method be delayed, if other propagators found reductions?

constexpr Param< bool >	DELAYSEPA { "constraints/linear/delaysepa" }
	should separation method be delayed, if other separators found cuts?

constexpr Param< bool >	DETECTCUTOFFBOUND { "constraints/linear/detectcutoffbound" }
	should presolving try to detect constraints parallel to the objective function defining an upper bound and prevent these constraints from entering the LP?

constexpr Param< bool >	DETECTLOWERBOUND { "constraints/linear/detectlowerbound" }
	should presolving try to detect constraints parallel to the objective function defining a lower bound and prevent these constraints from entering the LP?

constexpr Param< bool >	DETECTPARTIALOBJECTIVE { "constraints/linear/detectpartialobjective" }
	should presolving try to detect subsets of constraints parallel to the objective function?

constexpr Param< bool >	DUALPRESOLVING { "constraints/linear/dualpresolving" }
	should dual presolving steps be performed?

constexpr Param< int >	EAGERFREQ { "constraints/linear/eagerfreq" }
	frequency for using all instead of only the useful constraints in separation, propagation and enforcement (-1: never, 0: only in first evaluation)

constexpr Param< bool >	EXTRACTCLIQUES { "constraints/linear/extractcliques" }
	should Cliques be extracted?

constexpr Param< double >	MAXAGGRNORMSCALE { "constraints/linear/maxaggrnormscale" }
	maximal allowed relative gain in maximum norm for constraint aggregation (0.0: disable constraint aggregation)

constexpr Param< double >	MAXCARDBOUNDDIST { "constraints/linear/maxcardbounddist" }
	maximal relative distance from current node's dual bound to primal bound compared to best node's dual bound for separating knapsack cardinality cuts

constexpr Param< double >	MAXDUALMULTAGGRQUOT { "constraints/linear/maxdualmultaggrquot" }
	maximum coefficient dynamism (ie. maxabsval / minabsval) for dual multiaggregation

constexpr Param< double >	MAXEASYACTIVITYDELTA { "constraints/linear/maxeasyactivitydelta" }
	maximum activity delta to run easy propagation on linear constraint (faster, but numerically less stable)

constexpr Param< double >	MAXMULTAGGRQUOT { "constraints/linear/maxmultaggrquot" }
	maximum coefficient dynamism (ie. maxabsval / minabsval) for primal multiaggregation

constexpr Param< int >	MAXPREROUNDS { "constraints/linear/maxprerounds" }
	maximal number of presolving rounds the constraint handler participates in (-1: no limit)

constexpr Param< int >	MAXROUNDS { "constraints/linear/maxrounds" }
	maximal number of separation rounds per node (-1: unlimited)

constexpr Param< int >	MAXROUNDSROOT { "constraints/linear/maxroundsroot" }
	maximal number of separation rounds per node in the root node (-1: unlimited)

constexpr Param< int >	MAXSEPACUTS { "constraints/linear/maxsepacuts" }
	maximal number of cuts separated per separation round

constexpr Param< int >	MAXSEPACUTSROOT { "constraints/linear/maxsepacutsroot" }
	maximal number of cuts separated per separation round in the root node

constexpr Param< double >	MINGAINPERNMINCOMPARISONS { "constraints/linear/mingainpernmincomparisons" }
	minimal gain per minimal pairwise presolve comparisons to repeat pairwise comparison round

constexpr Param< bool >	MULTAGGRREMOVE { "constraints/linear/multaggrremove" }
	should multi-aggregations only be performed if the constraint can be removed afterwards?

constexpr Param< int >	NMINCOMPARISONS { "constraints/linear/nmincomparisons" }
	number for minimal pairwise presolve comparisons

constexpr Param< bool >	PRESOLPAIRWISE { "constraints/linear/presolpairwise" }
	should pairwise constraint comparison be performed in presolving?

constexpr Param< int >	PRESOLTIMING { "constraints/linear/presoltiming" }
	timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE, 32:FINAL)

constexpr Param< bool >	PRESOLUSEHASHING { "constraints/linear/presolusehashing" }
	should hash table be used for detecting redundant constraints in advance

constexpr Param< int >	PROPFREQ { "constraints/linear/propfreq" }
	frequency for propagating domains (-1: never, 0: only in root node)

constexpr Param< int >	PROPTIMING { "constraints/linear/proptiming" }
	timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP, 15:ALWAYS)

constexpr Param< bool >	RANGEDROWARTCONS { "constraints/linear/rangedrowartcons" }
	should presolving and propagation extract sub-constraints from ranged rows and equations?

constexpr Param< int >	RANGEDROWFREQ { "constraints/linear/rangedrowfreq" }
	frequency for applying ranged row propagation

constexpr Param< int >	RANGEDROWMAXDEPTH { "constraints/linear/rangedrowmaxdepth" }
	maximum depth to apply ranged row propagation

constexpr Param< bool >	RANGEDROWPROPAGATION { "constraints/linear/rangedrowpropagation" }
	should presolving and propagation try to improve bounds, detect infeasibility, and extract sub-constraints from ranged rows and equations?

constexpr Param< int >	SEPAFREQ { "constraints/linear/sepafreq" }
	frequency for separating cuts (-1: never, 0: only in root node)

constexpr Param< bool >	SEPARATEALL { "constraints/linear/separateall" }
	should all constraints be subject to cardinality cut generation instead of only the ones with non-zero dual value?

constexpr Param< bool >	SIMPLIFYINEQUALITIES { "constraints/linear/simplifyinequalities" }
	should presolving try to simplify inequalities

constexpr Param< bool >	SINGLETONSTUFFING { "constraints/linear/singletonstuffing" }
	should stuffing of singleton continuous variables be performed?

constexpr Param< bool >	SINGLEVARSTUFFING { "constraints/linear/singlevarstuffing" }
	should single variable stuffing be performed, which tries to fulfill constraints using the cheapest variable?

constexpr Param< bool >	SORTVARS { "constraints/linear/sortvars" }
	apply binaries sorting in decr. order of coeff abs value?

constexpr Param< int >	TIGHTENBOUNDSFREQ { "constraints/linear/tightenboundsfreq" }
	multiplier on propagation frequency, how often the bounds are tightened (-1: never, 0: only at root)

Detailed Description

Parameters with prefix constraints/linear.

Variable Documentation

◆ AGGREGATEVARIABLES

Param<bool> scippp::params::CONSTRAINTS::LINEAR::AGGREGATEVARIABLES { "constraints/linear/aggregatevariables" }

constexpr

should presolving search for aggregations in equations

Definition at line 1361 of file parameters.hpp.

◆ CHECKRELMAXABS

Param<bool> scippp::params::CONSTRAINTS::LINEAR::CHECKRELMAXABS { "constraints/linear/checkrelmaxabs" }

constexpr

should the violation for a constraint with side 0.0 be checked relative to 1.0 (FALSE) or to the maximum absolute value in the activity (TRUE)?

Definition at line 1374 of file parameters.hpp.

◆ DELAYPROP

Param<bool> scippp::params::CONSTRAINTS::LINEAR::DELAYPROP { "constraints/linear/delayprop" }

constexpr

should propagation method be delayed, if other propagators found reductions?

Definition at line 1329 of file parameters.hpp.

◆ DELAYSEPA

Param<bool> scippp::params::CONSTRAINTS::LINEAR::DELAYSEPA { "constraints/linear/delaysepa" }

constexpr

should separation method be delayed, if other separators found cuts?

Definition at line 1327 of file parameters.hpp.

◆ DETECTCUTOFFBOUND

Param<bool> scippp::params::CONSTRAINTS::LINEAR::DETECTCUTOFFBOUND { "constraints/linear/detectcutoffbound" }

constexpr

should presolving try to detect constraints parallel to the objective function defining an upper bound and prevent these constraints from entering the LP?

Definition at line 1377 of file parameters.hpp.

◆ DETECTLOWERBOUND

Param<bool> scippp::params::CONSTRAINTS::LINEAR::DETECTLOWERBOUND { "constraints/linear/detectlowerbound" }

constexpr

should presolving try to detect constraints parallel to the objective function defining a lower bound and prevent these constraints from entering the LP?

Definition at line 1380 of file parameters.hpp.

◆ DETECTPARTIALOBJECTIVE

Param<bool> scippp::params::CONSTRAINTS::LINEAR::DETECTPARTIALOBJECTIVE { "constraints/linear/detectpartialobjective" }

constexpr

should presolving try to detect subsets of constraints parallel to the objective function?

Definition at line 1382 of file parameters.hpp.

◆ DUALPRESOLVING

Param<bool> scippp::params::CONSTRAINTS::LINEAR::DUALPRESOLVING { "constraints/linear/dualpresolving" }

constexpr

should dual presolving steps be performed?

Definition at line 1365 of file parameters.hpp.

◆ EAGERFREQ

Param<int> scippp::params::CONSTRAINTS::LINEAR::EAGERFREQ { "constraints/linear/eagerfreq" }

constexpr

frequency for using all instead of only the useful constraints in separation, propagation and enforcement (-1: never, 0: only in first evaluation)

Definition at line 1323 of file parameters.hpp.

◆ EXTRACTCLIQUES

Param<bool> scippp::params::CONSTRAINTS::LINEAR::EXTRACTCLIQUES { "constraints/linear/extractcliques" }

constexpr

should Cliques be extracted?

Definition at line 1399 of file parameters.hpp.

◆ MAXAGGRNORMSCALE

Param<double> scippp::params::CONSTRAINTS::LINEAR::MAXAGGRNORMSCALE { "constraints/linear/maxaggrnormscale" }

constexpr

maximal allowed relative gain in maximum norm for constraint aggregation (0.0: disable constraint aggregation)

Definition at line 1351 of file parameters.hpp.

◆ MAXCARDBOUNDDIST

Param<double> scippp::params::CONSTRAINTS::LINEAR::MAXCARDBOUNDDIST { "constraints/linear/maxcardbounddist" }

constexpr

maximal relative distance from current node's dual bound to primal bound compared to best node's dual bound for separating knapsack cardinality cuts

Definition at line 1356 of file parameters.hpp.

◆ MAXDUALMULTAGGRQUOT

Param<double> scippp::params::CONSTRAINTS::LINEAR::MAXDUALMULTAGGRQUOT { "constraints/linear/maxdualmultaggrquot" }

constexpr

maximum coefficient dynamism (ie. maxabsval / minabsval) for dual multiaggregation

Definition at line 1397 of file parameters.hpp.

◆ MAXEASYACTIVITYDELTA

Param<double> scippp::params::CONSTRAINTS::LINEAR::MAXEASYACTIVITYDELTA { "constraints/linear/maxeasyactivitydelta" }

constexpr

maximum activity delta to run easy propagation on linear constraint (faster, but numerically less stable)

Definition at line 1353 of file parameters.hpp.

◆ MAXMULTAGGRQUOT

Param<double> scippp::params::CONSTRAINTS::LINEAR::MAXMULTAGGRQUOT { "constraints/linear/maxmultaggrquot" }

constexpr

maximum coefficient dynamism (ie. maxabsval / minabsval) for primal multiaggregation

Definition at line 1395 of file parameters.hpp.

◆ MAXPREROUNDS

Param<int> scippp::params::CONSTRAINTS::LINEAR::MAXPREROUNDS { "constraints/linear/maxprerounds" }

constexpr

maximal number of presolving rounds the constraint handler participates in (-1: no limit)

Definition at line 1325 of file parameters.hpp.

◆ MAXROUNDS

Param<int> scippp::params::CONSTRAINTS::LINEAR::MAXROUNDS { "constraints/linear/maxrounds" }

constexpr

maximal number of separation rounds per node (-1: unlimited)

Definition at line 1335 of file parameters.hpp.

◆ MAXROUNDSROOT

Param<int> scippp::params::CONSTRAINTS::LINEAR::MAXROUNDSROOT { "constraints/linear/maxroundsroot" }

constexpr

maximal number of separation rounds per node in the root node (-1: unlimited)

Definition at line 1337 of file parameters.hpp.

◆ MAXSEPACUTS

Param<int> scippp::params::CONSTRAINTS::LINEAR::MAXSEPACUTS { "constraints/linear/maxsepacuts" }

constexpr

maximal number of cuts separated per separation round

Definition at line 1339 of file parameters.hpp.

◆ MAXSEPACUTSROOT

Param<int> scippp::params::CONSTRAINTS::LINEAR::MAXSEPACUTSROOT { "constraints/linear/maxsepacutsroot" }

constexpr

maximal number of cuts separated per separation round in the root node

Definition at line 1341 of file parameters.hpp.

◆ MINGAINPERNMINCOMPARISONS

Param<double> scippp::params::CONSTRAINTS::LINEAR::MINGAINPERNMINCOMPARISONS { "constraints/linear/mingainpernmincomparisons" }

constexpr

minimal gain per minimal pairwise presolve comparisons to repeat pairwise comparison round

Definition at line 1349 of file parameters.hpp.

◆ MULTAGGRREMOVE

Param<bool> scippp::params::CONSTRAINTS::LINEAR::MULTAGGRREMOVE { "constraints/linear/multaggrremove" }

constexpr

should multi-aggregations only be performed if the constraint can be removed afterwards?

Definition at line 1393 of file parameters.hpp.

◆ NMINCOMPARISONS

Param<int> scippp::params::CONSTRAINTS::LINEAR::NMINCOMPARISONS { "constraints/linear/nmincomparisons" }

constexpr

number for minimal pairwise presolve comparisons

Definition at line 1347 of file parameters.hpp.

◆ PRESOLPAIRWISE

Param<bool> scippp::params::CONSTRAINTS::LINEAR::PRESOLPAIRWISE { "constraints/linear/presolpairwise" }

constexpr

should pairwise constraint comparison be performed in presolving?

Definition at line 1343 of file parameters.hpp.

◆ PRESOLTIMING

Param<int> scippp::params::CONSTRAINTS::LINEAR::PRESOLTIMING { "constraints/linear/presoltiming" }

constexpr

timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE, 32:FINAL)

Definition at line 1331 of file parameters.hpp.

◆ PRESOLUSEHASHING

Param<bool> scippp::params::CONSTRAINTS::LINEAR::PRESOLUSEHASHING { "constraints/linear/presolusehashing" }

constexpr

should hash table be used for detecting redundant constraints in advance

Definition at line 1345 of file parameters.hpp.

◆ PROPFREQ

Param<int> scippp::params::CONSTRAINTS::LINEAR::PROPFREQ { "constraints/linear/propfreq" }

constexpr

frequency for propagating domains (-1: never, 0: only in root node)

Definition at line 1318 of file parameters.hpp.

◆ PROPTIMING

Param<int> scippp::params::CONSTRAINTS::LINEAR::PROPTIMING { "constraints/linear/proptiming" }

constexpr

timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP, 15:ALWAYS)

Definition at line 1320 of file parameters.hpp.

◆ RANGEDROWARTCONS

Param<bool> scippp::params::CONSTRAINTS::LINEAR::RANGEDROWARTCONS { "constraints/linear/rangedrowartcons" }

constexpr

should presolving and propagation extract sub-constraints from ranged rows and equations?

Definition at line 1387 of file parameters.hpp.

◆ RANGEDROWFREQ

Param<int> scippp::params::CONSTRAINTS::LINEAR::RANGEDROWFREQ { "constraints/linear/rangedrowfreq" }

constexpr

frequency for applying ranged row propagation

Definition at line 1391 of file parameters.hpp.

◆ RANGEDROWMAXDEPTH

Param<int> scippp::params::CONSTRAINTS::LINEAR::RANGEDROWMAXDEPTH { "constraints/linear/rangedrowmaxdepth" }

constexpr

maximum depth to apply ranged row propagation

Definition at line 1389 of file parameters.hpp.

◆ RANGEDROWPROPAGATION

Param<bool> scippp::params::CONSTRAINTS::LINEAR::RANGEDROWPROPAGATION { "constraints/linear/rangedrowpropagation" }

constexpr

should presolving and propagation try to improve bounds, detect infeasibility, and extract sub-constraints from ranged rows and equations?

Definition at line 1385 of file parameters.hpp.

◆ SEPAFREQ

Param<int> scippp::params::CONSTRAINTS::LINEAR::SEPAFREQ { "constraints/linear/sepafreq" }

constexpr

frequency for separating cuts (-1: never, 0: only in root node)

Definition at line 1316 of file parameters.hpp.

◆ SEPARATEALL

Param<bool> scippp::params::CONSTRAINTS::LINEAR::SEPARATEALL { "constraints/linear/separateall" }

constexpr

should all constraints be subject to cardinality cut generation instead of only the ones with non-zero dual value?

Definition at line 1359 of file parameters.hpp.

◆ SIMPLIFYINEQUALITIES

Param<bool> scippp::params::CONSTRAINTS::LINEAR::SIMPLIFYINEQUALITIES { "constraints/linear/simplifyinequalities" }

constexpr

should presolving try to simplify inequalities

Definition at line 1363 of file parameters.hpp.

◆ SINGLETONSTUFFING

Param<bool> scippp::params::CONSTRAINTS::LINEAR::SINGLETONSTUFFING { "constraints/linear/singletonstuffing" }

constexpr

should stuffing of singleton continuous variables be performed?

Definition at line 1367 of file parameters.hpp.

◆ SINGLEVARSTUFFING

Param<bool> scippp::params::CONSTRAINTS::LINEAR::SINGLEVARSTUFFING { "constraints/linear/singlevarstuffing" }

constexpr

should single variable stuffing be performed, which tries to fulfill constraints using the cheapest variable?

Definition at line 1369 of file parameters.hpp.

◆ SORTVARS

Param<bool> scippp::params::CONSTRAINTS::LINEAR::SORTVARS { "constraints/linear/sortvars" }

constexpr

apply binaries sorting in decr. order of coeff abs value?

Definition at line 1371 of file parameters.hpp.

◆ TIGHTENBOUNDSFREQ

Param<int> scippp::params::CONSTRAINTS::LINEAR::TIGHTENBOUNDSFREQ { "constraints/linear/tightenboundsfreq" }

constexpr

multiplier on propagation frequency, how often the bounds are tightened (-1: never, 0: only at root)

Definition at line 1333 of file parameters.hpp.

SCIP++ refs/heads/main

Namespaces

Variables

Detailed Description

Variable Documentation

◆ AGGREGATEVARIABLES

◆ CHECKRELMAXABS

◆ DELAYPROP

◆ DELAYSEPA

◆ DETECTCUTOFFBOUND

◆ DETECTLOWERBOUND

◆ DETECTPARTIALOBJECTIVE

◆ DUALPRESOLVING

◆ EAGERFREQ

◆ EXTRACTCLIQUES

◆ MAXAGGRNORMSCALE

◆ MAXCARDBOUNDDIST

◆ MAXDUALMULTAGGRQUOT

◆ MAXEASYACTIVITYDELTA

◆ MAXMULTAGGRQUOT

◆ MAXPREROUNDS

◆ MAXROUNDS

◆ MAXROUNDSROOT

◆ MAXSEPACUTS

◆ MAXSEPACUTSROOT

◆ MINGAINPERNMINCOMPARISONS

◆ MULTAGGRREMOVE

◆ NMINCOMPARISONS

◆ PRESOLPAIRWISE

◆ PRESOLTIMING

◆ PRESOLUSEHASHING

◆ PROPFREQ

◆ PROPTIMING

◆ RANGEDROWARTCONS

◆ RANGEDROWFREQ

◆ RANGEDROWMAXDEPTH

◆ RANGEDROWPROPAGATION

◆ SEPAFREQ

◆ SEPARATEALL

◆ SIMPLIFYINEQUALITIES

◆ SINGLETONSTUFFING

◆ SINGLEVARSTUFFING

◆ SORTVARS

◆ TIGHTENBOUNDSFREQ