Parameters with prefix heuristics/subnlp. More...
Variables | |
constexpr Param< double > | EXPECTINFEAS { "heuristics/subnlp/expectinfeas" } |
percentage of NLP solves with infeasible status required to tell NLP solver to expect an infeasible NLP | |
constexpr Param< double > | FEASTOLFACTOR { "heuristics/subnlp/feastolfactor" } |
factor on SCIP feasibility tolerance for NLP solves if resolving when NLP solution not feasible in CIP | |
constexpr Param< bool > | FORBIDFIXINGS { "heuristics/subnlp/forbidfixings" } |
whether to add constraints that forbid specific fixings that turned out to be infeasible | |
constexpr Param< int > | FREQ { "heuristics/subnlp/freq" } |
frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs) | |
constexpr Param< int > | FREQOFS { "heuristics/subnlp/freqofs" } |
frequency offset for calling primal heuristic <subnlp> | |
constexpr Param< int > | ITERINIT { "heuristics/subnlp/iterinit" } |
number of iterations used for initial NLP solves | |
constexpr Param< int > | ITERMIN { "heuristics/subnlp/itermin" } |
minimal number of iterations for NLP solves | |
constexpr Param< bool > | KEEPCOPY { "heuristics/subnlp/keepcopy" } |
whether to keep SCIP copy or to create new copy each time heuristic is applied | |
constexpr Param< int > | MAXDEPTH { "heuristics/subnlp/maxdepth" } |
maximal depth level to call primal heuristic <subnlp> (-1: no limit) | |
constexpr Param< int > | MAXPRESOLVEROUNDS { "heuristics/subnlp/maxpresolverounds" } |
limit on number of presolve rounds in sub-SCIP (-1 for unlimited, 0 for no presolve) | |
constexpr Param< int > | NINITSOLVES { "heuristics/subnlp/ninitsolves" } |
number of successful NLP solves until switching to iterlimit guess and using success rate | |
constexpr Param< int > | NLPVERBLEVEL { "heuristics/subnlp/nlpverblevel" } |
verbosity level of NLP solver | |
constexpr Param< double > | NODESFACTOR { "heuristics/subnlp/nodesfactor" } |
factor on number of nodes in SCIP (plus nodesoffset) to compute itercontingent (higher value runs heuristics more frequently) | |
constexpr Param< int > | NODESOFFSET { "heuristics/subnlp/nodesoffset" } |
number of nodes added to the current number of nodes when computing itercontingent (higher value runs heuristic more often in early search) | |
constexpr Param< double > | OPTTOL { "heuristics/subnlp/opttol" } |
absolute optimality tolerance to use for NLP solves | |
constexpr Param< int > | PRESOLVEEMPHASIS { "heuristics/subnlp/presolveemphasis" } |
presolve emphasis in sub-SCIP (0: default, 1: aggressive, 2: fast, 3: off) | |
constexpr Param< int > | PRIORITY { "heuristics/subnlp/priority" } |
priority of heuristic <subnlp> | |
constexpr Param< bool > | SETCUTOFF { "heuristics/subnlp/setcutoff" } |
whether to set cutoff in sub-SCIP to current primal bound | |
constexpr Param< double > | SUCCESSRATEEXP { "heuristics/subnlp/successrateexp" } |
exponent for power of success rate to be multiplied with itercontingent (lower value decreases impact of success rate) | |
Parameters with prefix heuristics/subnlp.
|
constexpr |
percentage of NLP solves with infeasible status required to tell NLP solver to expect an infeasible NLP
Definition at line 3968 of file parameters.hpp.
|
constexpr |
factor on SCIP feasibility tolerance for NLP solves if resolving when NLP solution not feasible in CIP
Definition at line 3956 of file parameters.hpp.
|
constexpr |
whether to add constraints that forbid specific fixings that turned out to be infeasible
Definition at line 3964 of file parameters.hpp.
|
constexpr |
frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
Definition at line 3931 of file parameters.hpp.
|
constexpr |
frequency offset for calling primal heuristic <subnlp>
Definition at line 3933 of file parameters.hpp.
|
constexpr |
number of iterations used for initial NLP solves
Definition at line 3948 of file parameters.hpp.
|
constexpr |
minimal number of iterations for NLP solves
Definition at line 3952 of file parameters.hpp.
|
constexpr |
whether to keep SCIP copy or to create new copy each time heuristic is applied
Definition at line 3966 of file parameters.hpp.
|
constexpr |
maximal depth level to call primal heuristic <subnlp> (-1: no limit)
Definition at line 3935 of file parameters.hpp.
|
constexpr |
limit on number of presolve rounds in sub-SCIP (-1 for unlimited, 0 for no presolve)
Definition at line 3958 of file parameters.hpp.
|
constexpr |
number of successful NLP solves until switching to iterlimit guess and using success rate
Definition at line 3950 of file parameters.hpp.
|
constexpr |
verbosity level of NLP solver
Definition at line 3937 of file parameters.hpp.
|
constexpr |
factor on number of nodes in SCIP (plus nodesoffset) to compute itercontingent (higher value runs heuristics more frequently)
Definition at line 3943 of file parameters.hpp.
|
constexpr |
number of nodes added to the current number of nodes when computing itercontingent (higher value runs heuristic more often in early search)
Definition at line 3940 of file parameters.hpp.
|
constexpr |
absolute optimality tolerance to use for NLP solves
Definition at line 3954 of file parameters.hpp.
|
constexpr |
presolve emphasis in sub-SCIP (0: default, 1: aggressive, 2: fast, 3: off)
Definition at line 3960 of file parameters.hpp.
|
constexpr |
priority of heuristic <subnlp>
Definition at line 3929 of file parameters.hpp.
|
constexpr |
whether to set cutoff in sub-SCIP to current primal bound
Definition at line 3962 of file parameters.hpp.
|
constexpr |
exponent for power of success rate to be multiplied with itercontingent (lower value decreases impact of success rate)
Definition at line 3946 of file parameters.hpp.