|
SCIP++ refs/heads/main
|
|
| |
|
SCIP++ refs/heads/main
|
|
|
| |
Parameters with prefix constraints/setppc. More...
Variables | |
| constexpr Param< bool > | ADDVARIABLESASCLIQUES { "constraints/setppc/addvariablesascliques" } |
| should we try to generate extra cliques out of all binary variables to maybe fasten redundant constraint detection | |
| constexpr Param< bool > | CLIQUELIFTING { "constraints/setppc/cliquelifting" } |
| should we try to lift variables into other clique constraints, fix variables, aggregate them, and also shrink the amount of variables in clique constraints | |
| constexpr Param< bool > | CLIQUESHRINKING { "constraints/setppc/cliqueshrinking" } |
| should we try to shrink the number of variables in a clique constraints, by replacing more than one variable by only one | |
| constexpr Param< bool > | DELAYPROP { "constraints/setppc/delayprop" } |
| should propagation method be delayed, if other propagators found reductions? | |
| constexpr Param< bool > | DELAYSEPA { "constraints/setppc/delaysepa" } |
| should separation method be delayed, if other separators found cuts? | |
| constexpr Param< bool > | DUALPRESOLVING { "constraints/setppc/dualpresolving" } |
| should dual presolving steps be performed? | |
| constexpr Param< int > | EAGERFREQ { "constraints/setppc/eagerfreq" } |
| frequency for using all instead of only the useful constraints in separation, propagation and enforcement (-1: never, 0: only in first evaluation) | |
| constexpr Param< int > | MAXPREROUNDS { "constraints/setppc/maxprerounds" } |
| maximal number of presolving rounds the constraint handler participates in (-1: no limit) | |
| constexpr Param< int > | NPSEUDOBRANCHES { "constraints/setppc/npseudobranches" } |
| number of children created in pseudo branching (0: disable pseudo branching) | |
| constexpr Param< bool > | PRESOLPAIRWISE { "constraints/setppc/presolpairwise" } |
| should pairwise constraint comparison be performed in presolving? | |
| constexpr Param< int > | PRESOLTIMING { "constraints/setppc/presoltiming" } |
| timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE, 32:FINAL) | |
| constexpr Param< bool > | PRESOLUSEHASHING { "constraints/setppc/presolusehashing" } |
| should hash table be used for detecting redundant constraints in advance | |
| constexpr Param< int > | PROPFREQ { "constraints/setppc/propfreq" } |
| frequency for propagating domains (-1: never, 0: only in root node) | |
| constexpr Param< int > | PROPTIMING { "constraints/setppc/proptiming" } |
| timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP, 15:ALWAYS) | |
| constexpr Param< int > | SEPAFREQ { "constraints/setppc/sepafreq" } |
| frequency for separating cuts (-1: never, 0: only in root node) | |
Parameters with prefix constraints/setppc.
|
constexpr |
should we try to generate extra cliques out of all binary variables to maybe fasten redundant constraint detection
Definition at line 1732 of file parameters.hpp.
|
constexpr |
should we try to lift variables into other clique constraints, fix variables, aggregate them, and also shrink the amount of variables in clique constraints
Definition at line 1729 of file parameters.hpp.
|
constexpr |
should we try to shrink the number of variables in a clique constraints, by replacing more than one variable by only one
Definition at line 1735 of file parameters.hpp.
|
constexpr |
should propagation method be delayed, if other propagators found reductions?
Definition at line 1716 of file parameters.hpp.
|
constexpr |
should separation method be delayed, if other separators found cuts?
Definition at line 1714 of file parameters.hpp.
|
constexpr |
should dual presolving steps be performed?
Definition at line 1726 of file parameters.hpp.
|
constexpr |
frequency for using all instead of only the useful constraints in separation, propagation and enforcement (-1: never, 0: only in first evaluation)
Definition at line 1710 of file parameters.hpp.
|
constexpr |
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
Definition at line 1712 of file parameters.hpp.
|
constexpr |
number of children created in pseudo branching (0: disable pseudo branching)
Definition at line 1720 of file parameters.hpp.
|
constexpr |
should pairwise constraint comparison be performed in presolving?
Definition at line 1722 of file parameters.hpp.
|
constexpr |
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE, 32:FINAL)
Definition at line 1718 of file parameters.hpp.
|
constexpr |
should hash table be used for detecting redundant constraints in advance
Definition at line 1724 of file parameters.hpp.
|
constexpr |
frequency for propagating domains (-1: never, 0: only in root node)
Definition at line 1705 of file parameters.hpp.
|
constexpr |
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP, 15:ALWAYS)
Definition at line 1707 of file parameters.hpp.
|
constexpr |
frequency for separating cuts (-1: never, 0: only in root node)
Definition at line 1703 of file parameters.hpp.
1.12.0