Parameters with prefix heuristics/farkasdiving. More...

Variables
constexpr Param< bool >	BACKTRACK { "heuristics/farkasdiving/backtrack" }
	use one level of backtracking if infeasibility is encountered?

constexpr Param< bool >	CHECKCANDS { "heuristics/farkasdiving/checkcands" }
	should diving candidates be checked before running?

constexpr Param< int >	FREQ { "heuristics/farkasdiving/freq" }
	frequency for calling primal heuristic <farkasdiving> (-1: never, 0: only at depth freqofs)

constexpr Param< int >	FREQOFS { "heuristics/farkasdiving/freqofs" }
	frequency offset for calling primal heuristic <farkasdiving>

constexpr Param< double >	LPRESOLVEDOMCHGQUOT { "heuristics/farkasdiving/lpresolvedomchgquot" }
	percentage of immediate domain changes during probing to trigger LP resolve

constexpr Param< int >	LPSOLVEFREQ { "heuristics/farkasdiving/lpsolvefreq" }
	LP solve frequency for diving heuristics (0: only after enough domain changes have been found)

constexpr Param< int >	MAXDEPTH { "heuristics/farkasdiving/maxdepth" }
	maximal depth level to call primal heuristic <farkasdiving> (-1: no limit)

constexpr Param< double >	MAXDIVEAVGQUOT { "heuristics/farkasdiving/maxdiveavgquot" }
	maximal quotient (curlowerbound - lowerbound)/(avglowerbound - lowerbound) where diving is performed (0.0: no limit)

constexpr Param< double >	MAXDIVEAVGQUOTNOSOL { "heuristics/farkasdiving/maxdiveavgquotnosol" }
	maximal AVGQUOT when no solution was found yet (0.0: no limit)

constexpr Param< double >	MAXDIVEUBQUOT { "heuristics/farkasdiving/maxdiveubquot" }
	maximal quotient (curlowerbound - lowerbound)/(cutoffbound - lowerbound) where diving is performed (0.0: no limit)

constexpr Param< double >	MAXDIVEUBQUOTNOSOL { "heuristics/farkasdiving/maxdiveubquotnosol" }
	maximal UBQUOT when no solution was found yet (0.0: no limit)

constexpr Param< int >	MAXLPITEROFS { "heuristics/farkasdiving/maxlpiterofs" }
	additional number of allowed LP iterations

constexpr Param< double >	MAXLPITERQUOT { "heuristics/farkasdiving/maxlpiterquot" }
	maximal fraction of diving LP iterations compared to node LP iterations

constexpr Param< double >	MAXOBJOCC { "heuristics/farkasdiving/maxobjocc" }
	maximal occurance factor of an objective coefficient

constexpr Param< double >	MAXRELDEPTH { "heuristics/farkasdiving/maxreldepth" }
	maximal relative depth to start diving

constexpr Param< double >	MINRELDEPTH { "heuristics/farkasdiving/minreldepth" }
	minimal relative depth to start diving

constexpr Param< double >	OBJDYNAMISM { "heuristics/farkasdiving/objdynamism" }
	minimal objective dynamism (log) to run

constexpr Param< bool >	ONLYLPBRANCHCANDS { "heuristics/farkasdiving/onlylpbranchcands" }
	should only LP branching candidates be considered instead of the slower but more general constraint handler diving variable selection?

constexpr Param< int >	PRIORITY { "heuristics/farkasdiving/priority" }
	priority of heuristic <farkasdiving>

constexpr Param< bool >	ROOTSUCCESS { "heuristics/farkasdiving/rootsuccess" }
	should the heuristic only run within the tree if at least one solution was found at the root node?

constexpr Param< bool >	SCALESCORE { "heuristics/farkasdiving/scalescore" }
	should the score be scaled?

constexpr Param< char >	SCALETYPE { "heuristics/farkasdiving/scaletype" }
	scale score by [f]ractionality or [i]mpact on farkasproof

Detailed Description

Parameters with prefix heuristics/farkasdiving.

Variable Documentation

◆ BACKTRACK

constexpr Param<bool> scippp::params::HEURISTICS::FARKASDIVING::BACKTRACK { "heuristics/farkasdiving/backtrack" }

constexpr

use one level of backtracking if infeasibility is encountered?

Definition at line 2895 of file parameters.hpp.

◆ CHECKCANDS

constexpr Param<bool> scippp::params::HEURISTICS::FARKASDIVING::CHECKCANDS { "heuristics/farkasdiving/checkcands" }

constexpr

should diving candidates be checked before running?

Definition at line 2904 of file parameters.hpp.

◆ FREQ

constexpr Param<int> scippp::params::HEURISTICS::FARKASDIVING::FREQ { "heuristics/farkasdiving/freq" }

constexpr

frequency for calling primal heuristic <farkasdiving> (-1: never, 0: only at depth freqofs)

Definition at line 2871 of file parameters.hpp.

◆ FREQOFS

constexpr Param<int> scippp::params::HEURISTICS::FARKASDIVING::FREQOFS { "heuristics/farkasdiving/freqofs" }

constexpr

frequency offset for calling primal heuristic <farkasdiving>

Definition at line 2873 of file parameters.hpp.

◆ LPRESOLVEDOMCHGQUOT

constexpr Param<double> scippp::params::HEURISTICS::FARKASDIVING::LPRESOLVEDOMCHGQUOT { "heuristics/farkasdiving/lpresolvedomchgquot" }

constexpr

percentage of immediate domain changes during probing to trigger LP resolve

Definition at line 2897 of file parameters.hpp.

◆ LPSOLVEFREQ

constexpr Param<int> scippp::params::HEURISTICS::FARKASDIVING::LPSOLVEFREQ { "heuristics/farkasdiving/lpsolvefreq" }

constexpr

LP solve frequency for diving heuristics (0: only after enough domain changes have been found)

Definition at line 2899 of file parameters.hpp.

◆ MAXDEPTH

constexpr Param<int> scippp::params::HEURISTICS::FARKASDIVING::MAXDEPTH { "heuristics/farkasdiving/maxdepth" }

constexpr

maximal depth level to call primal heuristic <farkasdiving> (-1: no limit)

Definition at line 2875 of file parameters.hpp.

◆ MAXDIVEAVGQUOT

constexpr Param<double> scippp::params::HEURISTICS::FARKASDIVING::MAXDIVEAVGQUOT { "heuristics/farkasdiving/maxdiveavgquot" }

constexpr

maximal quotient (curlowerbound - lowerbound)/(avglowerbound - lowerbound) where diving is performed (0.0: no limit)

Definition at line 2889 of file parameters.hpp.

◆ MAXDIVEAVGQUOTNOSOL

constexpr Param<double> scippp::params::HEURISTICS::FARKASDIVING::MAXDIVEAVGQUOTNOSOL { "heuristics/farkasdiving/maxdiveavgquotnosol" }

constexpr

maximal AVGQUOT when no solution was found yet (0.0: no limit)

Definition at line 2893 of file parameters.hpp.

◆ MAXDIVEUBQUOT

constexpr Param<double> scippp::params::HEURISTICS::FARKASDIVING::MAXDIVEUBQUOT { "heuristics/farkasdiving/maxdiveubquot" }

constexpr

maximal quotient (curlowerbound - lowerbound)/(cutoffbound - lowerbound) where diving is performed (0.0: no limit)

Definition at line 2886 of file parameters.hpp.

◆ MAXDIVEUBQUOTNOSOL

constexpr Param<double> scippp::params::HEURISTICS::FARKASDIVING::MAXDIVEUBQUOTNOSOL { "heuristics/farkasdiving/maxdiveubquotnosol" }

constexpr

maximal UBQUOT when no solution was found yet (0.0: no limit)

Definition at line 2891 of file parameters.hpp.

◆ MAXLPITEROFS

constexpr Param<int> scippp::params::HEURISTICS::FARKASDIVING::MAXLPITEROFS { "heuristics/farkasdiving/maxlpiterofs" }

constexpr

additional number of allowed LP iterations

Definition at line 2883 of file parameters.hpp.

◆ MAXLPITERQUOT

constexpr Param<double> scippp::params::HEURISTICS::FARKASDIVING::MAXLPITERQUOT { "heuristics/farkasdiving/maxlpiterquot" }

constexpr

maximal fraction of diving LP iterations compared to node LP iterations

Definition at line 2881 of file parameters.hpp.

◆ MAXOBJOCC

constexpr Param<double> scippp::params::HEURISTICS::FARKASDIVING::MAXOBJOCC { "heuristics/farkasdiving/maxobjocc" }

constexpr

maximal occurance factor of an objective coefficient

Definition at line 2910 of file parameters.hpp.

◆ MAXRELDEPTH

constexpr Param<double> scippp::params::HEURISTICS::FARKASDIVING::MAXRELDEPTH { "heuristics/farkasdiving/maxreldepth" }

constexpr

maximal relative depth to start diving

Definition at line 2879 of file parameters.hpp.

◆ MINRELDEPTH

constexpr Param<double> scippp::params::HEURISTICS::FARKASDIVING::MINRELDEPTH { "heuristics/farkasdiving/minreldepth" }

constexpr

minimal relative depth to start diving

Definition at line 2877 of file parameters.hpp.

◆ OBJDYNAMISM

constexpr Param<double> scippp::params::HEURISTICS::FARKASDIVING::OBJDYNAMISM { "heuristics/farkasdiving/objdynamism" }

constexpr

minimal objective dynamism (log) to run

Definition at line 2912 of file parameters.hpp.

◆ ONLYLPBRANCHCANDS

constexpr Param<bool> scippp::params::HEURISTICS::FARKASDIVING::ONLYLPBRANCHCANDS { "heuristics/farkasdiving/onlylpbranchcands" }

constexpr

should only LP branching candidates be considered instead of the slower but more general constraint handler diving variable selection?

Definition at line 2902 of file parameters.hpp.

◆ PRIORITY

constexpr Param<int> scippp::params::HEURISTICS::FARKASDIVING::PRIORITY { "heuristics/farkasdiving/priority" }

constexpr

priority of heuristic <farkasdiving>

Definition at line 2869 of file parameters.hpp.

◆ ROOTSUCCESS

constexpr Param<bool> scippp::params::HEURISTICS::FARKASDIVING::ROOTSUCCESS { "heuristics/farkasdiving/rootsuccess" }

constexpr

should the heuristic only run within the tree if at least one solution was found at the root node?

Definition at line 2908 of file parameters.hpp.

◆ SCALESCORE

constexpr Param<bool> scippp::params::HEURISTICS::FARKASDIVING::SCALESCORE { "heuristics/farkasdiving/scalescore" }

constexpr

should the score be scaled?

Definition at line 2906 of file parameters.hpp.

◆ SCALETYPE

constexpr Param<char> scippp::params::HEURISTICS::FARKASDIVING::SCALETYPE { "heuristics/farkasdiving/scaletype" }

constexpr

scale score by [f]ractionality or [i]mpact on farkasproof

Definition at line 2914 of file parameters.hpp.

SCIP++ refs/heads/main

Variables

Detailed Description

Variable Documentation

◆ BACKTRACK

◆ CHECKCANDS

◆ FREQ

◆ FREQOFS

◆ LPRESOLVEDOMCHGQUOT

◆ LPSOLVEFREQ

◆ MAXDEPTH

◆ MAXDIVEAVGQUOT

◆ MAXDIVEAVGQUOTNOSOL

◆ MAXDIVEUBQUOT

◆ MAXDIVEUBQUOTNOSOL

◆ MAXLPITEROFS

◆ MAXLPITERQUOT

◆ MAXOBJOCC

◆ MAXRELDEPTH

◆ MINRELDEPTH

◆ OBJDYNAMISM

◆ ONLYLPBRANCHCANDS

◆ PRIORITY

◆ ROOTSUCCESS

◆ SCALESCORE

◆ SCALETYPE