SCIP++ refs/heads/main
 
Loading...
Searching...
No Matches
scippp::params::HEURISTICS::CONFLICTDIVING Namespace Reference

Parameters with prefix heuristics/conflictdiving. More...

Variables

constexpr Param< bool > BACKTRACK { "heuristics/conflictdiving/backtrack" }
 use one level of backtracking if infeasibility is encountered?
 
constexpr Param< int > FREQ { "heuristics/conflictdiving/freq" }
 frequency for calling primal heuristic <conflictdiving> (-1: never, 0: only at depth freqofs)
 
constexpr Param< int > FREQOFS { "heuristics/conflictdiving/freqofs" }
 frequency offset for calling primal heuristic <conflictdiving>
 
constexpr Param< bool > LIKECOEF { "heuristics/conflictdiving/likecoef" }
 perform rounding like coefficient diving
 
constexpr Param< double > LOCKWEIGHT { "heuristics/conflictdiving/lockweight" }
 weight used in a convex combination of conflict and variable locks
 
constexpr Param< double > LPRESOLVEDOMCHGQUOT { "heuristics/conflictdiving/lpresolvedomchgquot" }
 percentage of immediate domain changes during probing to trigger LP resolve
 
constexpr Param< int > LPSOLVEFREQ { "heuristics/conflictdiving/lpsolvefreq" }
 LP solve frequency for diving heuristics (0: only after enough domain changes have been found)
 
constexpr Param< int > MAXDEPTH { "heuristics/conflictdiving/maxdepth" }
 maximal depth level to call primal heuristic <conflictdiving> (-1: no limit)
 
constexpr Param< double > MAXDIVEAVGQUOT { "heuristics/conflictdiving/maxdiveavgquot" }
 maximal quotient (curlowerbound - lowerbound)/(avglowerbound - lowerbound) where diving is performed (0.0: no limit)
 
constexpr Param< double > MAXDIVEAVGQUOTNOSOL { "heuristics/conflictdiving/maxdiveavgquotnosol" }
 maximal AVGQUOT when no solution was found yet (0.0: no limit)
 
constexpr Param< double > MAXDIVEUBQUOT { "heuristics/conflictdiving/maxdiveubquot" }
 maximal quotient (curlowerbound - lowerbound)/(cutoffbound - lowerbound) where diving is performed (0.0: no limit)
 
constexpr Param< double > MAXDIVEUBQUOTNOSOL { "heuristics/conflictdiving/maxdiveubquotnosol" }
 maximal UBQUOT when no solution was found yet (0.0: no limit)
 
constexpr Param< int > MAXLPITEROFS { "heuristics/conflictdiving/maxlpiterofs" }
 additional number of allowed LP iterations
 
constexpr Param< double > MAXLPITERQUOT { "heuristics/conflictdiving/maxlpiterquot" }
 maximal fraction of diving LP iterations compared to node LP iterations
 
constexpr Param< double > MAXRELDEPTH { "heuristics/conflictdiving/maxreldepth" }
 maximal relative depth to start diving
 
constexpr Param< bool > MAXVIOL { "heuristics/conflictdiving/maxviol" }
 try to maximize the violation
 
constexpr Param< int > MINCONFLICTLOCKS { "heuristics/conflictdiving/minconflictlocks" }
 minimal number of conflict locks per variable
 
constexpr Param< double > MINRELDEPTH { "heuristics/conflictdiving/minreldepth" }
 minimal relative depth to start diving
 
constexpr Param< bool > ONLYLPBRANCHCANDS { "heuristics/conflictdiving/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/conflictdiving/priority" }
 priority of heuristic <conflictdiving>
 

Detailed Description

Parameters with prefix heuristics/conflictdiving.

Variable Documentation

◆ BACKTRACK

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

use one level of backtracking if infeasibility is encountered?

Definition at line 2817 of file parameters.hpp.

◆ FREQ

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

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

Definition at line 2793 of file parameters.hpp.

◆ FREQOFS

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

frequency offset for calling primal heuristic <conflictdiving>

Definition at line 2795 of file parameters.hpp.

◆ LIKECOEF

Param<bool> scippp::params::HEURISTICS::CONFLICTDIVING::LIKECOEF { "heuristics/conflictdiving/likecoef" }
constexpr

perform rounding like coefficient diving

Definition at line 2828 of file parameters.hpp.

◆ LOCKWEIGHT

Param<double> scippp::params::HEURISTICS::CONFLICTDIVING::LOCKWEIGHT { "heuristics/conflictdiving/lockweight" }
constexpr

weight used in a convex combination of conflict and variable locks

Definition at line 2832 of file parameters.hpp.

◆ LPRESOLVEDOMCHGQUOT

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

percentage of immediate domain changes during probing to trigger LP resolve

Definition at line 2819 of file parameters.hpp.

◆ LPSOLVEFREQ

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

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

Definition at line 2821 of file parameters.hpp.

◆ MAXDEPTH

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

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

Definition at line 2797 of file parameters.hpp.

◆ MAXDIVEAVGQUOT

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

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

Definition at line 2811 of file parameters.hpp.

◆ MAXDIVEAVGQUOTNOSOL

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

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

Definition at line 2815 of file parameters.hpp.

◆ MAXDIVEUBQUOT

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

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

Definition at line 2808 of file parameters.hpp.

◆ MAXDIVEUBQUOTNOSOL

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

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

Definition at line 2813 of file parameters.hpp.

◆ MAXLPITEROFS

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

additional number of allowed LP iterations

Definition at line 2805 of file parameters.hpp.

◆ MAXLPITERQUOT

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

maximal fraction of diving LP iterations compared to node LP iterations

Definition at line 2803 of file parameters.hpp.

◆ MAXRELDEPTH

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

maximal relative depth to start diving

Definition at line 2801 of file parameters.hpp.

◆ MAXVIOL

Param<bool> scippp::params::HEURISTICS::CONFLICTDIVING::MAXVIOL { "heuristics/conflictdiving/maxviol" }
constexpr

try to maximize the violation

Definition at line 2826 of file parameters.hpp.

◆ MINCONFLICTLOCKS

Param<int> scippp::params::HEURISTICS::CONFLICTDIVING::MINCONFLICTLOCKS { "heuristics/conflictdiving/minconflictlocks" }
constexpr

minimal number of conflict locks per variable

Definition at line 2830 of file parameters.hpp.

◆ MINRELDEPTH

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

minimal relative depth to start diving

Definition at line 2799 of file parameters.hpp.

◆ ONLYLPBRANCHCANDS

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

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

Definition at line 2824 of file parameters.hpp.

◆ PRIORITY

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

priority of heuristic <conflictdiving>

Definition at line 2791 of file parameters.hpp.