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> | |
Parameters with prefix heuristics/conflictdiving.
|
constexpr |
use one level of backtracking if infeasibility is encountered?
Definition at line 2666 of file parameters.hpp.
|
constexpr |
frequency for calling primal heuristic <conflictdiving> (-1: never, 0: only at depth freqofs)
Definition at line 2642 of file parameters.hpp.
|
constexpr |
frequency offset for calling primal heuristic <conflictdiving>
Definition at line 2644 of file parameters.hpp.
|
constexpr |
perform rounding like coefficient diving
Definition at line 2677 of file parameters.hpp.
|
constexpr |
weight used in a convex combination of conflict and variable locks
Definition at line 2681 of file parameters.hpp.
|
constexpr |
percentage of immediate domain changes during probing to trigger LP resolve
Definition at line 2668 of file parameters.hpp.
|
constexpr |
LP solve frequency for diving heuristics (0: only after enough domain changes have been found)
Definition at line 2670 of file parameters.hpp.
|
constexpr |
maximal depth level to call primal heuristic <conflictdiving> (-1: no limit)
Definition at line 2646 of file parameters.hpp.
|
constexpr |
maximal quotient (curlowerbound - lowerbound)/(avglowerbound - lowerbound) where diving is performed (0.0: no limit)
Definition at line 2660 of file parameters.hpp.
|
constexpr |
maximal AVGQUOT when no solution was found yet (0.0: no limit)
Definition at line 2664 of file parameters.hpp.
|
constexpr |
maximal quotient (curlowerbound - lowerbound)/(cutoffbound - lowerbound) where diving is performed (0.0: no limit)
Definition at line 2657 of file parameters.hpp.
|
constexpr |
maximal UBQUOT when no solution was found yet (0.0: no limit)
Definition at line 2662 of file parameters.hpp.
|
constexpr |
additional number of allowed LP iterations
Definition at line 2654 of file parameters.hpp.
|
constexpr |
maximal fraction of diving LP iterations compared to node LP iterations
Definition at line 2652 of file parameters.hpp.
|
constexpr |
maximal relative depth to start diving
Definition at line 2650 of file parameters.hpp.
|
constexpr |
try to maximize the violation
Definition at line 2675 of file parameters.hpp.
|
constexpr |
minimal number of conflict locks per variable
Definition at line 2679 of file parameters.hpp.
|
constexpr |
minimal relative depth to start diving
Definition at line 2648 of file parameters.hpp.
|
constexpr |
should only LP branching candidates be considered instead of the slower but more general constraint handler diving variable selection?
Definition at line 2673 of file parameters.hpp.
|
constexpr |
priority of heuristic <conflictdiving>
Definition at line 2640 of file parameters.hpp.