Parameters with prefix heuristics/undercover. More...
Variables | |
constexpr Param< bool > | BEFORECUTS { "heuristics/undercover/beforecuts" } |
should the heuristic be called at root node before cut separation? | |
constexpr Param< double > | CONFLICTWEIGHT { "heuristics/undercover/conflictweight" } |
weight for conflict score in fixing order | |
constexpr Param< bool > | COPYCUTS { "heuristics/undercover/copycuts" } |
should all active cuts from cutpool be copied to constraints in subproblem? | |
constexpr Param< bool > | COVERBD { "heuristics/undercover/coverbd" } |
should bounddisjunction constraints be covered (or just copied)? | |
constexpr Param< char > | COVERINGOBJ { "heuristics/undercover/coveringobj" } |
objective function of the covering problem (influenced nonlinear 'c'onstraints/'t'erms, 'd'omain size, 'l'ocks, 'm'in of up/down locks, 'u'nit penalties) | |
constexpr Param< double > | CUTOFFWEIGHT { "heuristics/undercover/cutoffweight" } |
weight for cutoff score in fixing order | |
constexpr Param< std::string > | FIXINGALTS { "heuristics/undercover/fixingalts" } |
prioritized sequence of fixing values used ('l'p relaxation, 'n'lp relaxation, 'i'ncumbent solution) | |
constexpr Param< char > | FIXINGORDER { "heuristics/undercover/fixingorder" } |
order in which variables should be fixed (increasing 'C'onflict score, decreasing 'c'onflict score, increasing 'V'ariable index, decreasing 'v'ariable index | |
constexpr Param< bool > | FIXINTFIRST { "heuristics/undercover/fixintfirst" } |
should integer variables in the cover be fixed first? | |
constexpr Param< int > | FREQ { "heuristics/undercover/freq" } |
frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs) | |
constexpr Param< int > | FREQOFS { "heuristics/undercover/freqofs" } |
frequency offset for calling primal heuristic <undercover> | |
constexpr Param< double > | INFERENCEWEIGHT { "heuristics/undercover/inferenceweight" } |
weight for inference score in fixing order | |
constexpr Param< bool > | LOCKSROUNDING { "heuristics/undercover/locksrounding" } |
shall LP values for integer vars be rounded according to locks? | |
constexpr Param< int > | MAXBACKTRACKS { "heuristics/undercover/maxbacktracks" } |
maximum number of backtracks in fix-and-propagate | |
constexpr Param< double > | MAXCOVERSIZECONSS { "heuristics/undercover/maxcoversizeconss" } |
maximum coversize (as ratio to the percentage of non-affected constraints) | |
constexpr Param< double > | MAXCOVERSIZEVARS { "heuristics/undercover/maxcoversizevars" } |
maximum coversize (as fraction of total number of variables) | |
constexpr Param< int > | MAXDEPTH { "heuristics/undercover/maxdepth" } |
maximal depth level to call primal heuristic <undercover> (-1: no limit) | |
constexpr Param< long long > | MAXNODES { "heuristics/undercover/maxnodes" } |
maximum number of nodes to regard in the subproblem | |
constexpr Param< int > | MAXRECOVERS { "heuristics/undercover/maxrecovers" } |
maximum number of recoverings | |
constexpr Param< int > | MAXREORDERS { "heuristics/undercover/maxreorders" } |
maximum number of reorderings of the fixing order | |
constexpr Param< int > | MINCOVEREDABS { "heuristics/undercover/mincoveredabs" } |
minimum number of nonlinear constraints in the original problem | |
constexpr Param< double > | MINCOVEREDREL { "heuristics/undercover/mincoveredrel" } |
minimum percentage of nonlinear constraints in the original problem | |
constexpr Param< double > | MINIMPROVE { "heuristics/undercover/minimprove" } |
factor by which the heuristic should at least improve the incumbent | |
constexpr Param< long long > | MINNODES { "heuristics/undercover/minnodes" } |
minimum number of nodes required to start the subproblem | |
constexpr Param< long long > | NODESOFS { "heuristics/undercover/nodesofs" } |
number of nodes added to the contingent of the total nodes | |
constexpr Param< double > | NODESQUOT { "heuristics/undercover/nodesquot" } |
contingent of sub problem nodes in relation to the number of nodes of the original problem | |
constexpr Param< bool > | ONLYCONVEXIFY { "heuristics/undercover/onlyconvexify" } |
should we only fix variables in order to obtain a convex problem? | |
constexpr Param< bool > | POSTNLP { "heuristics/undercover/postnlp" } |
should the NLP heuristic be called to polish a feasible solution? | |
constexpr Param< int > | PRIORITY { "heuristics/undercover/priority" } |
priority of heuristic <undercover> | |
constexpr Param< double > | RECOVERDIV { "heuristics/undercover/recoverdiv" } |
fraction of covering variables in the last cover which need to change their value when recovering | |
constexpr Param< bool > | REUSECOVER { "heuristics/undercover/reusecover" } |
shall the cover be reused if a conflict was added after an infeasible subproblem? | |
Parameters with prefix heuristics/undercover.
|
constexpr |
should the heuristic be called at root node before cut separation?
Definition at line 4108 of file parameters.hpp.
|
constexpr |
weight for conflict score in fixing order
Definition at line 4076 of file parameters.hpp.
|
constexpr |
should all active cuts from cutpool be copied to constraints in subproblem?
Definition at line 4120 of file parameters.hpp.
|
constexpr |
should bounddisjunction constraints be covered (or just copied)?
Definition at line 4118 of file parameters.hpp.
|
constexpr |
objective function of the covering problem (influenced nonlinear 'c'onstraints/'t'erms, 'd'omain size, 'l'ocks, 'm'in of up/down locks, 'u'nit penalties)
Definition at line 4103 of file parameters.hpp.
|
constexpr |
weight for cutoff score in fixing order
Definition at line 4078 of file parameters.hpp.
|
constexpr |
prioritized sequence of fixing values used ('l'p relaxation, 'n'lp relaxation, 'i'ncumbent solution)
Definition at line 4068 of file parameters.hpp.
|
constexpr |
order in which variables should be fixed (increasing 'C'onflict score, decreasing 'c'onflict score, increasing 'V'ariable index, decreasing 'v'ariable index
Definition at line 4106 of file parameters.hpp.
|
constexpr |
should integer variables in the cover be fixed first?
Definition at line 4110 of file parameters.hpp.
|
constexpr |
frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
Definition at line 4062 of file parameters.hpp.
|
constexpr |
frequency offset for calling primal heuristic <undercover>
Definition at line 4064 of file parameters.hpp.
|
constexpr |
weight for inference score in fixing order
Definition at line 4080 of file parameters.hpp.
|
constexpr |
shall LP values for integer vars be rounded according to locks?
Definition at line 4112 of file parameters.hpp.
|
constexpr |
maximum number of backtracks in fix-and-propagate
Definition at line 4096 of file parameters.hpp.
|
constexpr |
maximum coversize (as ratio to the percentage of non-affected constraints)
Definition at line 4084 of file parameters.hpp.
|
constexpr |
maximum coversize (as fraction of total number of variables)
Definition at line 4082 of file parameters.hpp.
|
constexpr |
maximal depth level to call primal heuristic <undercover> (-1: no limit)
Definition at line 4066 of file parameters.hpp.
|
constexpr |
maximum number of nodes to regard in the subproblem
Definition at line 4070 of file parameters.hpp.
|
constexpr |
maximum number of recoverings
Definition at line 4098 of file parameters.hpp.
|
constexpr |
maximum number of reorderings of the fixing order
Definition at line 4100 of file parameters.hpp.
|
constexpr |
minimum number of nonlinear constraints in the original problem
Definition at line 4094 of file parameters.hpp.
|
constexpr |
minimum percentage of nonlinear constraints in the original problem
Definition at line 4086 of file parameters.hpp.
|
constexpr |
factor by which the heuristic should at least improve the incumbent
Definition at line 4088 of file parameters.hpp.
|
constexpr |
minimum number of nodes required to start the subproblem
Definition at line 4072 of file parameters.hpp.
|
constexpr |
number of nodes added to the contingent of the total nodes
Definition at line 4074 of file parameters.hpp.
|
constexpr |
contingent of sub problem nodes in relation to the number of nodes of the original problem
Definition at line 4090 of file parameters.hpp.
|
constexpr |
should we only fix variables in order to obtain a convex problem?
Definition at line 4114 of file parameters.hpp.
|
constexpr |
should the NLP heuristic be called to polish a feasible solution?
Definition at line 4116 of file parameters.hpp.
|
constexpr |
priority of heuristic <undercover>
Definition at line 4060 of file parameters.hpp.
|
constexpr |
fraction of covering variables in the last cover which need to change their value when recovering
Definition at line 4092 of file parameters.hpp.
|
constexpr |
shall the cover be reused if a conflict was added after an infeasible subproblem?
Definition at line 4122 of file parameters.hpp.