Parameters with prefix heuristics/gins. More...
Variables | |
constexpr Param< int > | BESTSOLLIMIT { "heuristics/gins/bestsollimit" } |
limit on number of improving incumbent solutions in sub-CIP | |
constexpr Param< bool > | CONSECUTIVEBLOCKS { "heuristics/gins/consecutiveblocks" } |
should blocks be treated consecutively (sorted by ascending label?) | |
constexpr Param< bool > | COPYCUTS { "heuristics/gins/copycuts" } |
if uselprows == FALSE, should all active cuts from cutpool be copied to constraints in subproblem? | |
constexpr Param< bool > | FIXCONTVARS { "heuristics/gins/fixcontvars" } |
should continuous variables outside the neighborhoods be fixed? | |
constexpr Param< int > | FREQ { "heuristics/gins/freq" } |
frequency for calling primal heuristic <gins> (-1: never, 0: only at depth freqofs) | |
constexpr Param< int > | FREQOFS { "heuristics/gins/freqofs" } |
frequency offset for calling primal heuristic <gins> | |
constexpr Param< int > | MAXDEPTH { "heuristics/gins/maxdepth" } |
maximal depth level to call primal heuristic <gins> (-1: no limit) | |
constexpr Param< int > | MAXDISTANCE { "heuristics/gins/maxdistance" } |
maximum distance to selected variable to enter the subproblem, or -1 to select the distance that best approximates the minimum fixing rate from below | |
constexpr Param< int > | MAXNODES { "heuristics/gins/maxnodes" } |
maximum number of nodes to regard in the subproblem | |
constexpr Param< double > | MINFIXINGRATE { "heuristics/gins/minfixingrate" } |
percentage of integer variables that have to be fixed | |
constexpr Param< double > | MINIMPROVE { "heuristics/gins/minimprove" } |
factor by which gins should at least improve the incumbent | |
constexpr Param< int > | MINNODES { "heuristics/gins/minnodes" } |
minimum number of nodes required to start the subproblem | |
constexpr Param< int > | NODESOFS { "heuristics/gins/nodesofs" } |
number of nodes added to the contingent of the total nodes | |
constexpr Param< double > | NODESQUOT { "heuristics/gins/nodesquot" } |
contingent of sub problem nodes in relation to the number of nodes of the original problem | |
constexpr Param< int > | NWAITINGNODES { "heuristics/gins/nwaitingnodes" } |
number of nodes without incumbent change that heuristic should wait | |
constexpr Param< double > | OVERLAP { "heuristics/gins/overlap" } |
overlap of blocks between runs - 0.0: no overlap, 1.0: shift by only 1 block | |
constexpr Param< char > | POTENTIAL { "heuristics/gins/potential" } |
the reference point to compute the neighborhood potential: (r)oot, (l)ocal lp, or (p)seudo solution | |
constexpr Param< int > | PRIORITY { "heuristics/gins/priority" } |
priority of heuristic <gins> | |
constexpr Param< bool > | RELAXDENSECONSS { "heuristics/gins/relaxdenseconss" } |
should dense constraints (at least as dense as 1 - minfixingrate) be ignored by connectivity graph? | |
constexpr Param< double > | ROLLHORIZONLIMFAC { "heuristics/gins/rollhorizonlimfac" } |
limiting percentage for variables already used in sub-SCIPs to terminate rolling horizon approach | |
constexpr Param< bool > | USEDECOMP { "heuristics/gins/usedecomp" } |
should user decompositions be considered, if available? | |
constexpr Param< bool > | USEDECOMPROLLHORIZON { "heuristics/gins/usedecomprollhorizon" } |
should user decompositions be considered for initial selection in rolling horizon, if available? | |
constexpr Param< bool > | USELPROWS { "heuristics/gins/uselprows" } |
should subproblem be created out of the rows in the LP rows? | |
constexpr Param< bool > | USEROLLINGHORIZON { "heuristics/gins/userollinghorizon" } |
should the heuristic solve a sequence of sub-MIP's around the first selected variable | |
constexpr Param< bool > | USESELFALLBACK { "heuristics/gins/useselfallback" } |
should random initial variable selection be used if decomposition was not successful? | |
Parameters with prefix heuristics/gins.
|
constexpr |
limit on number of improving incumbent solutions in sub-CIP
Definition at line 3045 of file parameters.hpp.
|
constexpr |
should blocks be treated consecutively (sorted by ascending label?)
Definition at line 3066 of file parameters.hpp.
|
constexpr |
if uselprows == FALSE, should all active cuts from cutpool be copied to constraints in subproblem?
Definition at line 3041 of file parameters.hpp.
|
constexpr |
should continuous variables outside the neighborhoods be fixed?
Definition at line 3043 of file parameters.hpp.
|
constexpr |
frequency for calling primal heuristic <gins> (-1: never, 0: only at depth freqofs)
Definition at line 3019 of file parameters.hpp.
|
constexpr |
frequency offset for calling primal heuristic <gins>
Definition at line 3021 of file parameters.hpp.
|
constexpr |
maximal depth level to call primal heuristic <gins> (-1: no limit)
Definition at line 3023 of file parameters.hpp.
|
constexpr |
maximum distance to selected variable to enter the subproblem, or -1 to select the distance that best approximates the minimum fixing rate from below
Definition at line 3048 of file parameters.hpp.
|
constexpr |
maximum number of nodes to regard in the subproblem
Definition at line 3027 of file parameters.hpp.
|
constexpr |
percentage of integer variables that have to be fixed
Definition at line 3035 of file parameters.hpp.
|
constexpr |
factor by which gins should at least improve the incumbent
Definition at line 3037 of file parameters.hpp.
|
constexpr |
minimum number of nodes required to start the subproblem
Definition at line 3029 of file parameters.hpp.
|
constexpr |
number of nodes added to the contingent of the total nodes
Definition at line 3025 of file parameters.hpp.
|
constexpr |
contingent of sub problem nodes in relation to the number of nodes of the original problem
Definition at line 3033 of file parameters.hpp.
|
constexpr |
number of nodes without incumbent change that heuristic should wait
Definition at line 3031 of file parameters.hpp.
|
constexpr |
overlap of blocks between runs - 0.0: no overlap, 1.0: shift by only 1 block
Definition at line 3058 of file parameters.hpp.
|
constexpr |
the reference point to compute the neighborhood potential: (r)oot, (l)ocal lp, or (p)seudo solution
Definition at line 3050 of file parameters.hpp.
|
constexpr |
priority of heuristic <gins>
Definition at line 3017 of file parameters.hpp.
|
constexpr |
should dense constraints (at least as dense as 1 - minfixingrate) be ignored by connectivity graph?
Definition at line 3054 of file parameters.hpp.
|
constexpr |
limiting percentage for variables already used in sub-SCIPs to terminate rolling horizon approach
Definition at line 3056 of file parameters.hpp.
|
constexpr |
should user decompositions be considered, if available?
Definition at line 3060 of file parameters.hpp.
|
constexpr |
should user decompositions be considered for initial selection in rolling horizon, if available?
Definition at line 3062 of file parameters.hpp.
|
constexpr |
should subproblem be created out of the rows in the LP rows?
Definition at line 3039 of file parameters.hpp.
|
constexpr |
should the heuristic solve a sequence of sub-MIP's around the first selected variable
Definition at line 3052 of file parameters.hpp.
|
constexpr |
should random initial variable selection be used if decomposition was not successful?
Definition at line 3064 of file parameters.hpp.