Parameters with prefix heuristics/shiftandpropagate. More...
Variables | |
constexpr Param< bool > | BINLOCKSFIRST { "heuristics/shiftandpropagate/binlocksfirst" } |
should binary variables with no locks be preferred in the ordering? | |
constexpr Param< bool > | COLLECTSTATS { "heuristics/shiftandpropagate/collectstats" } |
should variable statistics be collected during probing? | |
constexpr Param< int > | CUTOFFBREAKER { "heuristics/shiftandpropagate/cutoffbreaker" } |
The number of cutoffs before heuristic stops. | |
constexpr Param< bool > | FIXBINLOCKS { "heuristics/shiftandpropagate/fixbinlocks" } |
should binary variables with no locks in one direction be fixed to that direction? | |
constexpr Param< int > | FREQ { "heuristics/shiftandpropagate/freq" } |
frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs) | |
constexpr Param< int > | FREQOFS { "heuristics/shiftandpropagate/freqofs" } |
frequency offset for calling primal heuristic <shiftandpropagate> | |
constexpr Param< bool > | IMPLISCONTINUOUS { "heuristics/shiftandpropagate/impliscontinuous" } |
should implicit integer variables be treated as continuous variables? | |
constexpr Param< double > | MAXCUTOFFQUOT { "heuristics/shiftandpropagate/maxcutoffquot" } |
maximum percentage of allowed cutoffs before stopping the heuristic | |
constexpr Param< int > | MAXDEPTH { "heuristics/shiftandpropagate/maxdepth" } |
maximal depth level to call primal heuristic <shiftandpropagate> (-1: no limit) | |
constexpr Param< double > | MINFIXINGRATELP { "heuristics/shiftandpropagate/minfixingratelp" } |
minimum fixing rate over all variables (including continuous) to solve LP | |
constexpr Param< bool > | NORMALIZE { "heuristics/shiftandpropagate/normalize" } |
should coefficients and left/right hand sides be normalized by max row coeff? | |
constexpr Param< bool > | NOZEROFIXING { "heuristics/shiftandpropagate/nozerofixing" } |
should variables with a zero shifting value be delayed instead of being fixed? | |
constexpr Param< int > | NPROPROUNDS { "heuristics/shiftandpropagate/nproprounds" } |
The number of propagation rounds used for each propagation. | |
constexpr Param< bool > | ONLYWITHOUTSOL { "heuristics/shiftandpropagate/onlywithoutsol" } |
Should heuristic only be executed if no primal solution was found, yet? | |
constexpr Param< bool > | PREFERBINARIES { "heuristics/shiftandpropagate/preferbinaries" } |
Should binary variables be shifted first? | |
constexpr Param< int > | PRIORITY { "heuristics/shiftandpropagate/priority" } |
priority of heuristic <shiftandpropagate> | |
constexpr Param< bool > | PROBING { "heuristics/shiftandpropagate/probing" } |
Should domains be reduced by probing? | |
constexpr Param< bool > | RELAX { "heuristics/shiftandpropagate/relax" } |
Should continuous variables be relaxed? | |
constexpr Param< bool > | SELECTBEST { "heuristics/shiftandpropagate/selectbest" } |
should the heuristic choose the best candidate in every round? (set to FALSE for static order)? | |
constexpr Param< char > | SORTKEY { "heuristics/shiftandpropagate/sortkey" } |
the key for variable sorting: (n)orms down, norms (u)p, (v)iolations down, viola(t)ions up, or (r)andom | |
constexpr Param< bool > | SORTVARS { "heuristics/shiftandpropagate/sortvars" } |
Should variables be sorted for the heuristic? | |
constexpr Param< bool > | STOPAFTERFEASIBLE { "heuristics/shiftandpropagate/stopafterfeasible" } |
Should the heuristic stop calculating optimal shift values when no more rows are violated? | |
constexpr Param< bool > | UPDATEWEIGHTS { "heuristics/shiftandpropagate/updateweights" } |
should row weight be increased every time the row is violated? | |
Parameters with prefix heuristics/shiftandpropagate.
|
constexpr |
should binary variables with no locks be preferred in the ordering?
Definition at line 3888 of file parameters.hpp.
|
constexpr |
should variable statistics be collected during probing?
Definition at line 3878 of file parameters.hpp.
|
constexpr |
The number of cutoffs before heuristic stops.
Definition at line 3872 of file parameters.hpp.
|
constexpr |
should binary variables with no locks in one direction be fixed to that direction?
Definition at line 3886 of file parameters.hpp.
|
constexpr |
frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
Definition at line 3858 of file parameters.hpp.
|
constexpr |
frequency offset for calling primal heuristic <shiftandpropagate>
Definition at line 3860 of file parameters.hpp.
|
constexpr |
should implicit integer variables be treated as continuous variables?
Definition at line 3894 of file parameters.hpp.
|
constexpr |
maximum percentage of allowed cutoffs before stopping the heuristic
Definition at line 3898 of file parameters.hpp.
|
constexpr |
maximal depth level to call primal heuristic <shiftandpropagate> (-1: no limit)
Definition at line 3862 of file parameters.hpp.
|
constexpr |
minimum fixing rate over all variables (including continuous) to solve LP
Definition at line 3900 of file parameters.hpp.
|
constexpr |
should coefficients and left/right hand sides be normalized by max row coeff?
Definition at line 3890 of file parameters.hpp.
|
constexpr |
should variables with a zero shifting value be delayed instead of being fixed?
Definition at line 3884 of file parameters.hpp.
|
constexpr |
The number of propagation rounds used for each propagation.
Definition at line 3864 of file parameters.hpp.
|
constexpr |
Should heuristic only be executed if no primal solution was found, yet?
Definition at line 3870 of file parameters.hpp.
|
constexpr |
Should binary variables be shifted first?
Definition at line 3882 of file parameters.hpp.
|
constexpr |
priority of heuristic <shiftandpropagate>
Definition at line 3856 of file parameters.hpp.
|
constexpr |
Should domains be reduced by probing?
Definition at line 3868 of file parameters.hpp.
|
constexpr |
Should continuous variables be relaxed?
Definition at line 3866 of file parameters.hpp.
|
constexpr |
should the heuristic choose the best candidate in every round? (set to FALSE for static order)?
Definition at line 3896 of file parameters.hpp.
|
constexpr |
the key for variable sorting: (n)orms down, norms (u)p, (v)iolations down, viola(t)ions up, or (r)andom
Definition at line 3874 of file parameters.hpp.
|
constexpr |
Should variables be sorted for the heuristic?
Definition at line 3876 of file parameters.hpp.
|
constexpr |
Should the heuristic stop calculating optimal shift values when no more rows are violated?
Definition at line 3880 of file parameters.hpp.
|
constexpr |
should row weight be increased every time the row is violated?
Definition at line 3892 of file parameters.hpp.