Parameters with prefix constraints/cumulative. More...
Variables | |
constexpr Param< bool > | COEFTIGHTENING { "constraints/cumulative/coeftightening" } |
should coefficient tightening be applied? | |
constexpr Param< bool > | CUTSASCONSS { "constraints/cumulative/cutsasconss" } |
should the cumulative constraint create cuts as knapsack constraints? | |
constexpr Param< bool > | DELAYPROP { "constraints/cumulative/delayprop" } |
should propagation method be delayed, if other propagators found reductions? | |
constexpr Param< bool > | DELAYSEPA { "constraints/cumulative/delaysepa" } |
should separation method be delayed, if other separators found cuts? | |
constexpr Param< bool > | DETECTDISJUNCTIVE { "constraints/cumulative/detectdisjunctive" } |
search for conflict set via maximal cliques to detect disjunctive constraints | |
constexpr Param< bool > | DETECTVARBOUNDS { "constraints/cumulative/detectvarbounds" } |
search for conflict set via maximal cliques to detect variable bound constraints | |
constexpr Param< bool > | DISJUNCTIVE { "constraints/cumulative/disjunctive" } |
extract disjunctive constraints? | |
constexpr Param< bool > | DUALPRESOLVE { "constraints/cumulative/dualpresolve" } |
should dual presolving be applied? | |
constexpr Param< int > | EAGERFREQ { "constraints/cumulative/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< bool > | EFCHECK { "constraints/cumulative/efcheck" } |
should edge-finding be used to detect an overload? | |
constexpr Param< bool > | EFINFER { "constraints/cumulative/efinfer" } |
should edge-finding be used to infer bounds? | |
constexpr Param< bool > | FILLBRANCHCANDS { "constraints/cumulative/fillbranchcands" } |
should branching candidates be added to storage? | |
constexpr Param< bool > | LOCALCUTS { "constraints/cumulative/localcuts" } |
should cuts be added only locally? | |
constexpr Param< long long > | MAXNODES { "constraints/cumulative/maxnodes" } |
number of branch-and-bound nodes to solve an independent cumulative constraint (-1: no limit)? | |
constexpr Param< int > | MAXPREROUNDS { "constraints/cumulative/maxprerounds" } |
maximal number of presolving rounds the constraint handler participates in (-1: no limit) | |
constexpr Param< bool > | NORMALIZE { "constraints/cumulative/normalize" } |
should demands and capacity be normalized? | |
constexpr Param< bool > | PRESOLPAIRWISE { "constraints/cumulative/presolpairwise" } |
should pairwise constraint comparison be performed in presolving? | |
constexpr Param< int > | PRESOLTIMING { "constraints/cumulative/presoltiming" } |
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE, 32:FINAL) | |
constexpr Param< int > | PROPFREQ { "constraints/cumulative/propfreq" } |
frequency for propagating domains (-1: never, 0: only in root node) | |
constexpr Param< int > | PROPTIMING { "constraints/cumulative/proptiming" } |
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP, 15:ALWAYS) | |
constexpr Param< int > | SEPAFREQ { "constraints/cumulative/sepafreq" } |
frequency for separating cuts (-1: never, 0: only in root node) | |
constexpr Param< bool > | SEPAOLD { "constraints/cumulative/sepaold" } |
shall old sepa algo be applied? | |
constexpr Param< bool > | TTEFCHECK { "constraints/cumulative/ttefcheck" } |
should time-table edge-finding be used to detect an overload? | |
constexpr Param< bool > | TTEFINFER { "constraints/cumulative/ttefinfer" } |
should time-table edge-finding be used to infer bounds? | |
constexpr Param< bool > | TTINFER { "constraints/cumulative/ttinfer" } |
should time-table (core-times) propagator be used to infer bounds? | |
constexpr Param< bool > | USEADJUSTEDJOBS { "constraints/cumulative/useadjustedjobs" } |
should edge-finding be executed? | |
constexpr Param< bool > | USEBDWIDENING { "constraints/cumulative/usebdwidening" } |
should bound widening be used during the conflict analysis? | |
constexpr Param< bool > | USEBINVARS { "constraints/cumulative/usebinvars" } |
should the binary representation be used? | |
constexpr Param< bool > | USECOVERCUTS { "constraints/cumulative/usecovercuts" } |
should covering cuts be added every node? | |
Parameters with prefix constraints/cumulative.
|
constexpr |
should coefficient tightening be applied?
Definition at line 1049 of file parameters.hpp.
|
constexpr |
should the cumulative constraint create cuts as knapsack constraints?
Definition at line 1041 of file parameters.hpp.
|
constexpr |
should propagation method be delayed, if other propagators found reductions?
Definition at line 1019 of file parameters.hpp.
|
constexpr |
should separation method be delayed, if other separators found cuts?
Definition at line 1017 of file parameters.hpp.
|
constexpr |
search for conflict set via maximal cliques to detect disjunctive constraints
Definition at line 1059 of file parameters.hpp.
|
constexpr |
search for conflict set via maximal cliques to detect variable bound constraints
Definition at line 1061 of file parameters.hpp.
|
constexpr |
extract disjunctive constraints?
Definition at line 1055 of file parameters.hpp.
|
constexpr |
should dual presolving be applied?
Definition at line 1047 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 1013 of file parameters.hpp.
|
constexpr |
should edge-finding be used to detect an overload?
Definition at line 1025 of file parameters.hpp.
|
constexpr |
should edge-finding be used to infer bounds?
Definition at line 1027 of file parameters.hpp.
|
constexpr |
should branching candidates be added to storage?
Definition at line 1045 of file parameters.hpp.
|
constexpr |
should cuts be added only locally?
Definition at line 1037 of file parameters.hpp.
|
constexpr |
number of branch-and-bound nodes to solve an independent cumulative constraint (-1: no limit)?
Definition at line 1057 of file parameters.hpp.
|
constexpr |
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
Definition at line 1015 of file parameters.hpp.
|
constexpr |
should demands and capacity be normalized?
Definition at line 1051 of file parameters.hpp.
|
constexpr |
should pairwise constraint comparison be performed in presolving?
Definition at line 1053 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 1021 of file parameters.hpp.
|
constexpr |
frequency for propagating domains (-1: never, 0: only in root node)
Definition at line 1008 of file parameters.hpp.
|
constexpr |
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP, 15:ALWAYS)
Definition at line 1010 of file parameters.hpp.
|
constexpr |
frequency for separating cuts (-1: never, 0: only in root node)
Definition at line 1006 of file parameters.hpp.
|
constexpr |
shall old sepa algo be applied?
Definition at line 1043 of file parameters.hpp.
|
constexpr |
should time-table edge-finding be used to detect an overload?
Definition at line 1031 of file parameters.hpp.
|
constexpr |
should time-table edge-finding be used to infer bounds?
Definition at line 1033 of file parameters.hpp.
|
constexpr |
should time-table (core-times) propagator be used to infer bounds?
Definition at line 1023 of file parameters.hpp.
|
constexpr |
should edge-finding be executed?
Definition at line 1029 of file parameters.hpp.
|
constexpr |
should bound widening be used during the conflict analysis?
Definition at line 1063 of file parameters.hpp.
|
constexpr |
should the binary representation be used?
Definition at line 1035 of file parameters.hpp.
|
constexpr |
should covering cuts be added every node?
Definition at line 1039 of file parameters.hpp.