Parameters with prefix heuristics/crossover. More...
Variables | |
constexpr Param< int > | BESTSOLLIMIT { "heuristics/crossover/bestsollimit" } |
limit on number of improving incumbent solutions in sub-CIP | |
constexpr Param< bool > | COPYCUTS { "heuristics/crossover/copycuts" } |
if uselprows == FALSE, should all active cuts from cutpool be copied to constraints in subproblem? | |
constexpr Param< bool > | DONTWAITATROOT { "heuristics/crossover/dontwaitatroot" } |
should the nwaitingnodes parameter be ignored at the root node? | |
constexpr Param< int > | FREQ { "heuristics/crossover/freq" } |
frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs) | |
constexpr Param< int > | FREQOFS { "heuristics/crossover/freqofs" } |
frequency offset for calling primal heuristic <crossover> | |
constexpr Param< double > | LPLIMFAC { "heuristics/crossover/lplimfac" } |
factor by which the limit on the number of LP depends on the node limit | |
constexpr Param< int > | MAXDEPTH { "heuristics/crossover/maxdepth" } |
maximal depth level to call primal heuristic <crossover> (-1: no limit) | |
constexpr Param< long long > | MAXNODES { "heuristics/crossover/maxnodes" } |
maximum number of nodes to regard in the subproblem | |
constexpr Param< double > | MINFIXINGRATE { "heuristics/crossover/minfixingrate" } |
minimum percentage of integer variables that have to be fixed | |
constexpr Param< double > | MINIMPROVE { "heuristics/crossover/minimprove" } |
factor by which Crossover should at least improve the incumbent | |
constexpr Param< long long > | MINNODES { "heuristics/crossover/minnodes" } |
minimum number of nodes required to start the subproblem | |
constexpr Param< long long > | NODESOFS { "heuristics/crossover/nodesofs" } |
number of nodes added to the contingent of the total nodes | |
constexpr Param< double > | NODESQUOT { "heuristics/crossover/nodesquot" } |
contingent of sub problem nodes in relation to the number of nodes of the original problem | |
constexpr Param< int > | NUSEDSOLS { "heuristics/crossover/nusedsols" } |
number of solutions to be taken into account | |
constexpr Param< long long > | NWAITINGNODES { "heuristics/crossover/nwaitingnodes" } |
number of nodes without incumbent change that heuristic should wait | |
constexpr Param< bool > | PERMUTE { "heuristics/crossover/permute" } |
should the subproblem be permuted to increase diversification? | |
constexpr Param< int > | PRIORITY { "heuristics/crossover/priority" } |
priority of heuristic <crossover> | |
constexpr Param< bool > | RANDOMIZATION { "heuristics/crossover/randomization" } |
should the choice which sols to take be randomized? | |
constexpr Param< bool > | USELPROWS { "heuristics/crossover/uselprows" } |
should subproblem be created out of the rows in the LP rows? | |
constexpr Param< bool > | USEUCT { "heuristics/crossover/useuct" } |
should uct node selection be used at the beginning of the search? | |
Parameters with prefix heuristics/crossover.
|
constexpr |
limit on number of improving incumbent solutions in sub-CIP
Definition at line 2722 of file parameters.hpp.
|
constexpr |
if uselprows == FALSE, should all active cuts from cutpool be copied to constraints in subproblem?
Definition at line 2718 of file parameters.hpp.
|
constexpr |
should the nwaitingnodes parameter be ignored at the root node?
Definition at line 2714 of file parameters.hpp.
|
constexpr |
frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
Definition at line 2688 of file parameters.hpp.
|
constexpr |
frequency offset for calling primal heuristic <crossover>
Definition at line 2690 of file parameters.hpp.
|
constexpr |
factor by which the limit on the number of LP depends on the node limit
Definition at line 2710 of file parameters.hpp.
|
constexpr |
maximal depth level to call primal heuristic <crossover> (-1: no limit)
Definition at line 2692 of file parameters.hpp.
|
constexpr |
maximum number of nodes to regard in the subproblem
Definition at line 2696 of file parameters.hpp.
|
constexpr |
minimum percentage of integer variables that have to be fixed
Definition at line 2706 of file parameters.hpp.
|
constexpr |
factor by which Crossover should at least improve the incumbent
Definition at line 2708 of file parameters.hpp.
|
constexpr |
minimum number of nodes required to start the subproblem
Definition at line 2698 of file parameters.hpp.
|
constexpr |
number of nodes added to the contingent of the total nodes
Definition at line 2694 of file parameters.hpp.
|
constexpr |
contingent of sub problem nodes in relation to the number of nodes of the original problem
Definition at line 2704 of file parameters.hpp.
|
constexpr |
number of solutions to be taken into account
Definition at line 2700 of file parameters.hpp.
|
constexpr |
number of nodes without incumbent change that heuristic should wait
Definition at line 2702 of file parameters.hpp.
|
constexpr |
should the subproblem be permuted to increase diversification?
Definition at line 2720 of file parameters.hpp.
|
constexpr |
priority of heuristic <crossover>
Definition at line 2686 of file parameters.hpp.
|
constexpr |
should the choice which sols to take be randomized?
Definition at line 2712 of file parameters.hpp.
|
constexpr |
should subproblem be created out of the rows in the LP rows?
Definition at line 2716 of file parameters.hpp.
|
constexpr |
should uct node selection be used at the beginning of the search?
Definition at line 2724 of file parameters.hpp.