Parameters with prefix propagating/obbt. More...
Variables | |
constexpr Param< bool > | APPLYFILTERROUNDS { "propagating/obbt/applyfilterrounds" } |
try to filter bounds in so-called filter rounds by solving auxiliary LPs? | |
constexpr Param< bool > | APPLYTRIVIALFILTER { "propagating/obbt/applytrivialfilter" } |
try to filter bounds with the LP solution after each solve? | |
constexpr Param< double > | BOUNDSTREPS { "propagating/obbt/boundstreps" } |
minimal relative improve for strengthening bounds | |
constexpr Param< double > | CONDITIONLIMIT { "propagating/obbt/conditionlimit" } |
maximum condition limit used in LP solver (-1.0: no limit) | |
constexpr Param< bool > | CREATEBILININEQS { "propagating/obbt/createbilinineqs" } |
solve auxiliary LPs in order to find valid inequalities for bilinear terms? | |
constexpr Param< bool > | CREATEGENVBOUNDS { "propagating/obbt/creategenvbounds" } |
should obbt try to provide genvbounds if possible? | |
constexpr Param< bool > | CREATELINCONS { "propagating/obbt/createlincons" } |
create linear constraints from inequalities for bilinear terms? | |
constexpr Param< bool > | DELAY { "propagating/obbt/delay" } |
should propagator be delayed, if other propagators found reductions? | |
constexpr Param< double > | DUALFEASTOL { "propagating/obbt/dualfeastol" } |
feasibility tolerance for reduced costs used in obbt; this value is used if SCIP's dual feastol is greater | |
constexpr Param< int > | FREQ { "propagating/obbt/freq" } |
frequency for calling propagator <obbt> (-1: never, 0: only in root node) | |
constexpr Param< bool > | GENVBDSDURINGFILTER { "propagating/obbt/genvbdsduringfilter" } |
should we try to generate genvbounds during trivial and aggressive filtering? | |
constexpr Param< bool > | GENVBDSDURINGSEPA { "propagating/obbt/genvbdsduringsepa" } |
try to create genvbounds during separation process? | |
constexpr Param< double > | ITLIMITFACTOR { "propagating/obbt/itlimitfactor" } |
multiple of root node LP iterations used as total LP iteration limit for obbt (<= 0: no limit ) | |
constexpr Param< double > | ITLIMITFACTORBILIN { "propagating/obbt/itlimitfactorbilin" } |
multiple of OBBT LP limit used as total LP iteration limit for solving bilinear inequality LPs (< 0 for no limit) | |
constexpr Param< int > | MAXPREROUNDS { "propagating/obbt/maxprerounds" } |
maximal number of presolving rounds the propagator participates in (-1: no limit) | |
constexpr Param< int > | MINFILTER { "propagating/obbt/minfilter" } |
minimal number of filtered bounds to apply another filter round | |
constexpr Param< long long > | MINITLIMIT { "propagating/obbt/minitlimit" } |
minimum LP iteration limit | |
constexpr Param< double > | MINNONCONVEXITY { "propagating/obbt/minnonconvexity" } |
minimum absolute value of nonconvex eigenvalues for a bilinear term | |
constexpr Param< bool > | NORMALIZE { "propagating/obbt/normalize" } |
should coefficients in filtering be normalized w.r.t. the domains sizes? | |
constexpr Param< bool > | ONLYNONCONVEXVARS { "propagating/obbt/onlynonconvexvars" } |
only apply obbt on non-convex variables | |
constexpr Param< int > | ORDERINGALGO { "propagating/obbt/orderingalgo" } |
select the type of ordering algorithm which should be used (0: no special ordering, 1: greedy, 2: greedy reverse) | |
constexpr Param< int > | PRESOLPRIORITY { "propagating/obbt/presolpriority" } |
presolving priority of propagator <obbt> | |
constexpr Param< int > | PRESOLTIMING { "propagating/obbt/presoltiming" } |
timing mask of the presolving method of propagator <obbt> (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE, 32:FINAL) | |
constexpr Param< int > | PRIORITY { "propagating/obbt/priority" } |
priority of propagator <obbt> | |
constexpr Param< int > | PROPAGATEFREQ { "propagating/obbt/propagatefreq" } |
trigger a propagation round after that many bound tightenings (0: no propagation) | |
constexpr Param< int > | SEPAMAXITER { "propagating/obbt/sepamaxiter" } |
maximum number of iteration spend to separate an obbt LP solution | |
constexpr Param< int > | SEPAMINITER { "propagating/obbt/sepaminiter" } |
minimum number of iteration spend to separate an obbt LP solution | |
constexpr Param< bool > | SEPARATESOL { "propagating/obbt/separatesol" } |
should the obbt LP solution be separated? | |
constexpr Param< bool > | TIGHTCONTBOUNDSPROBING { "propagating/obbt/tightcontboundsprobing" } |
should continuous bounds be tightened during the probing mode? | |
constexpr Param< bool > | TIGHTINTBOUNDSPROBING { "propagating/obbt/tightintboundsprobing" } |
should integral bounds be tightened during the probing mode? | |
constexpr Param< int > | TIMINGMASK { "propagating/obbt/timingmask" } |
timing when propagator should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP, 15:ALWAYS)) | |
Parameters with prefix propagating/obbt.
|
constexpr |
try to filter bounds in so-called filter rounds by solving auxiliary LPs?
Definition at line 5098 of file parameters.hpp.
|
constexpr |
try to filter bounds with the LP solution after each solve?
Definition at line 5100 of file parameters.hpp.
|
constexpr |
minimal relative improve for strengthening bounds
Definition at line 5121 of file parameters.hpp.
|
constexpr |
maximum condition limit used in LP solver (-1.0: no limit)
Definition at line 5119 of file parameters.hpp.
|
constexpr |
solve auxiliary LPs in order to find valid inequalities for bilinear terms?
Definition at line 5129 of file parameters.hpp.
|
constexpr |
should obbt try to provide genvbounds if possible?
Definition at line 5094 of file parameters.hpp.
|
constexpr |
create linear constraints from inequalities for bilinear terms?
Definition at line 5131 of file parameters.hpp.
|
constexpr |
should propagator be delayed, if other propagators found reductions?
Definition at line 5084 of file parameters.hpp.
|
constexpr |
feasibility tolerance for reduced costs used in obbt; this value is used if SCIP's dual feastol is greater
Definition at line 5117 of file parameters.hpp.
|
constexpr |
frequency for calling propagator <obbt> (-1: never, 0: only in root node)
Definition at line 5082 of file parameters.hpp.
|
constexpr |
should we try to generate genvbounds during trivial and aggressive filtering?
Definition at line 5102 of file parameters.hpp.
|
constexpr |
try to create genvbounds during separation process?
Definition at line 5104 of file parameters.hpp.
|
constexpr |
multiple of root node LP iterations used as total LP iteration limit for obbt (<= 0: no limit )
Definition at line 5108 of file parameters.hpp.
|
constexpr |
multiple of OBBT LP limit used as total LP iteration limit for solving bilinear inequality LPs (< 0 for no limit)
Definition at line 5111 of file parameters.hpp.
|
constexpr |
maximal number of presolving rounds the propagator participates in (-1: no limit)
Definition at line 5090 of file parameters.hpp.
|
constexpr |
minimal number of filtered bounds to apply another filter round
Definition at line 5106 of file parameters.hpp.
|
constexpr |
minimum LP iteration limit
Definition at line 5115 of file parameters.hpp.
|
constexpr |
minimum absolute value of nonconvex eigenvalues for a bilinear term
Definition at line 5113 of file parameters.hpp.
|
constexpr |
should coefficients in filtering be normalized w.r.t. the domains sizes?
Definition at line 5096 of file parameters.hpp.
|
constexpr |
only apply obbt on non-convex variables
Definition at line 5123 of file parameters.hpp.
|
constexpr |
select the type of ordering algorithm which should be used (0: no special ordering, 1: greedy, 2: greedy reverse)
Definition at line 5134 of file parameters.hpp.
|
constexpr |
presolving priority of propagator <obbt>
Definition at line 5088 of file parameters.hpp.
|
constexpr |
timing mask of the presolving method of propagator <obbt> (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE, 32:FINAL)
Definition at line 5092 of file parameters.hpp.
|
constexpr |
priority of propagator <obbt>
Definition at line 5080 of file parameters.hpp.
|
constexpr |
trigger a propagation round after that many bound tightenings (0: no propagation)
Definition at line 5142 of file parameters.hpp.
|
constexpr |
maximum number of iteration spend to separate an obbt LP solution
Definition at line 5140 of file parameters.hpp.
|
constexpr |
minimum number of iteration spend to separate an obbt LP solution
Definition at line 5138 of file parameters.hpp.
|
constexpr |
should the obbt LP solution be separated?
Definition at line 5136 of file parameters.hpp.
|
constexpr |
should continuous bounds be tightened during the probing mode?
Definition at line 5127 of file parameters.hpp.
|
constexpr |
should integral bounds be tightened during the probing mode?
Definition at line 5125 of file parameters.hpp.
|
constexpr |
timing when propagator should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP, 15:ALWAYS))
Definition at line 5086 of file parameters.hpp.