Parameters with prefix constraints/knapsack. More...

Variables
constexpr Param< double >	CLIQUEEXTRACTFACTOR { "constraints/knapsack/cliqueextractfactor" }
	lower clique size limit for greedy clique extraction algorithm (relative to largest clique)

constexpr Param< double >	CLQPARTUPDATEFAC { "constraints/knapsack/clqpartupdatefac" }
	factor on the growth of global cliques to decide when to update a previous (negated) clique partition (used only if updatecliquepartitions is set to TRUE)

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

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

constexpr Param< bool >	DETECTCUTOFFBOUND { "constraints/knapsack/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/knapsack/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 >	DISAGGREGATION { "constraints/knapsack/disaggregation" }
	should disaggregation of knapsack constraints be allowed in preprocessing?

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

constexpr Param< int >	EAGERFREQ { "constraints/knapsack/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< double >	MAXCARDBOUNDDIST { "constraints/knapsack/maxcardbounddist" }
	maximal relative distance from current node's dual bound to primal bound compared to best node's dual bound for separating knapsack cuts

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

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

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

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

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

constexpr Param< bool >	NEGATEDCLIQUE { "constraints/knapsack/negatedclique" }
	should negated clique information be used in solving process

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

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

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

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

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

constexpr Param< int >	SEPACARDFREQ { "constraints/knapsack/sepacardfreq" }
	multiplier on separation frequency, how often knapsack cuts are separated (-1: never, 0: only at root)

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

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

constexpr Param< bool >	UPDATECLIQUEPARTITIONS { "constraints/knapsack/updatecliquepartitions" }
	should clique partition information be updated when old partition seems outdated?

constexpr Param< bool >	USEGUBS { "constraints/knapsack/usegubs" }
	should GUB information be used for separation?

Detailed Description

Parameters with prefix constraints/knapsack.

Variable Documentation

◆ CLIQUEEXTRACTFACTOR

constexpr Param<double> scippp::params::CONSTRAINTS::KNAPSACK::CLIQUEEXTRACTFACTOR { "constraints/knapsack/cliqueextractfactor" }

constexpr

lower clique size limit for greedy clique extraction algorithm (relative to largest clique)

Definition at line 1215 of file parameters.hpp.

◆ CLQPARTUPDATEFAC

constexpr Param<double> scippp::params::CONSTRAINTS::KNAPSACK::CLQPARTUPDATEFAC { "constraints/knapsack/clqpartupdatefac" }

constexpr

factor on the growth of global cliques to decide when to update a previous (negated) clique partition (used only if updatecliquepartitions is set to TRUE)

Definition at line 1248 of file parameters.hpp.

◆ DELAYPROP

constexpr Param<bool> scippp::params::CONSTRAINTS::KNAPSACK::DELAYPROP { "constraints/knapsack/delayprop" }

constexpr

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

Definition at line 1206 of file parameters.hpp.

◆ DELAYSEPA

constexpr Param<bool> scippp::params::CONSTRAINTS::KNAPSACK::DELAYSEPA { "constraints/knapsack/delaysepa" }

constexpr

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

Definition at line 1204 of file parameters.hpp.

◆ DETECTCUTOFFBOUND

constexpr Param<bool> scippp::params::CONSTRAINTS::KNAPSACK::DETECTCUTOFFBOUND { "constraints/knapsack/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 1240 of file parameters.hpp.

◆ DETECTLOWERBOUND

constexpr Param<bool> scippp::params::CONSTRAINTS::KNAPSACK::DETECTLOWERBOUND { "constraints/knapsack/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 1243 of file parameters.hpp.

◆ DISAGGREGATION

constexpr Param<bool> scippp::params::CONSTRAINTS::KNAPSACK::DISAGGREGATION { "constraints/knapsack/disaggregation" }

constexpr

should disaggregation of knapsack constraints be allowed in preprocessing?

Definition at line 1225 of file parameters.hpp.

◆ DUALPRESOLVING

constexpr Param<bool> scippp::params::CONSTRAINTS::KNAPSACK::DUALPRESOLVING { "constraints/knapsack/dualpresolving" }

constexpr

should dual presolving steps be performed?

Definition at line 1235 of file parameters.hpp.

◆ EAGERFREQ

constexpr Param<int> scippp::params::CONSTRAINTS::KNAPSACK::EAGERFREQ { "constraints/knapsack/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 1200 of file parameters.hpp.

◆ MAXCARDBOUNDDIST

constexpr Param<double> scippp::params::CONSTRAINTS::KNAPSACK::MAXCARDBOUNDDIST { "constraints/knapsack/maxcardbounddist" }

constexpr

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

Definition at line 1213 of file parameters.hpp.

◆ MAXPREROUNDS

constexpr Param<int> scippp::params::CONSTRAINTS::KNAPSACK::MAXPREROUNDS { "constraints/knapsack/maxprerounds" }

constexpr

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

Definition at line 1202 of file parameters.hpp.

◆ MAXROUNDS

constexpr Param<int> scippp::params::CONSTRAINTS::KNAPSACK::MAXROUNDS { "constraints/knapsack/maxrounds" }

constexpr

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

Definition at line 1217 of file parameters.hpp.

◆ MAXROUNDSROOT

constexpr Param<int> scippp::params::CONSTRAINTS::KNAPSACK::MAXROUNDSROOT { "constraints/knapsack/maxroundsroot" }

constexpr

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

Definition at line 1219 of file parameters.hpp.

◆ MAXSEPACUTS

constexpr Param<int> scippp::params::CONSTRAINTS::KNAPSACK::MAXSEPACUTS { "constraints/knapsack/maxsepacuts" }

constexpr

maximal number of cuts separated per separation round

Definition at line 1221 of file parameters.hpp.

◆ MAXSEPACUTSROOT

constexpr Param<int> scippp::params::CONSTRAINTS::KNAPSACK::MAXSEPACUTSROOT { "constraints/knapsack/maxsepacutsroot" }

constexpr

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

Definition at line 1223 of file parameters.hpp.

◆ NEGATEDCLIQUE

constexpr Param<bool> scippp::params::CONSTRAINTS::KNAPSACK::NEGATEDCLIQUE { "constraints/knapsack/negatedclique" }

constexpr

should negated clique information be used in solving process

Definition at line 1229 of file parameters.hpp.

◆ PRESOLPAIRWISE

constexpr Param<bool> scippp::params::CONSTRAINTS::KNAPSACK::PRESOLPAIRWISE { "constraints/knapsack/presolpairwise" }

constexpr

should pairwise constraint comparison be performed in presolving?

Definition at line 1231 of file parameters.hpp.

◆ PRESOLTIMING

constexpr Param<int> scippp::params::CONSTRAINTS::KNAPSACK::PRESOLTIMING { "constraints/knapsack/presoltiming" }

constexpr

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

Definition at line 1208 of file parameters.hpp.

◆ PRESOLUSEHASHING

constexpr Param<bool> scippp::params::CONSTRAINTS::KNAPSACK::PRESOLUSEHASHING { "constraints/knapsack/presolusehashing" }

constexpr

should hash table be used for detecting redundant constraints in advance

Definition at line 1233 of file parameters.hpp.

◆ PROPFREQ

constexpr Param<int> scippp::params::CONSTRAINTS::KNAPSACK::PROPFREQ { "constraints/knapsack/propfreq" }

constexpr

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

Definition at line 1195 of file parameters.hpp.

◆ PROPTIMING

constexpr Param<int> scippp::params::CONSTRAINTS::KNAPSACK::PROPTIMING { "constraints/knapsack/proptiming" }

constexpr

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

Definition at line 1197 of file parameters.hpp.

◆ SEPACARDFREQ

constexpr Param<int> scippp::params::CONSTRAINTS::KNAPSACK::SEPACARDFREQ { "constraints/knapsack/sepacardfreq" }

constexpr

multiplier on separation frequency, how often knapsack cuts are separated (-1: never, 0: only at root)

Definition at line 1210 of file parameters.hpp.

◆ SEPAFREQ

constexpr Param<int> scippp::params::CONSTRAINTS::KNAPSACK::SEPAFREQ { "constraints/knapsack/sepafreq" }

constexpr

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

Definition at line 1193 of file parameters.hpp.

◆ SIMPLIFYINEQUALITIES

constexpr Param<bool> scippp::params::CONSTRAINTS::KNAPSACK::SIMPLIFYINEQUALITIES { "constraints/knapsack/simplifyinequalities" }

constexpr

should presolving try to simplify knapsacks

Definition at line 1227 of file parameters.hpp.

◆ UPDATECLIQUEPARTITIONS

constexpr Param<bool> scippp::params::CONSTRAINTS::KNAPSACK::UPDATECLIQUEPARTITIONS { "constraints/knapsack/updatecliquepartitions" }

constexpr

should clique partition information be updated when old partition seems outdated?

Definition at line 1245 of file parameters.hpp.

◆ USEGUBS

constexpr Param<bool> scippp::params::CONSTRAINTS::KNAPSACK::USEGUBS { "constraints/knapsack/usegubs" }

constexpr

should GUB information be used for separation?

Definition at line 1237 of file parameters.hpp.

SCIP++ refs/heads/main

Variables

Detailed Description

Variable Documentation

◆ CLIQUEEXTRACTFACTOR

◆ CLQPARTUPDATEFAC

◆ DELAYPROP

◆ DELAYSEPA

◆ DETECTCUTOFFBOUND

◆ DETECTLOWERBOUND

◆ DISAGGREGATION

◆ DUALPRESOLVING

◆ EAGERFREQ

◆ MAXCARDBOUNDDIST

◆ MAXPREROUNDS

◆ MAXROUNDS

◆ MAXROUNDSROOT

◆ MAXSEPACUTS

◆ MAXSEPACUTSROOT

◆ NEGATEDCLIQUE

◆ PRESOLPAIRWISE

◆ PRESOLTIMING

◆ PRESOLUSEHASHING

◆ PROPFREQ

◆ PROPTIMING

◆ SEPACARDFREQ

◆ SEPAFREQ

◆ SIMPLIFYINEQUALITIES

◆ UPDATECLIQUEPARTITIONS

◆ USEGUBS