scippp::params::HEURISTICS::CROSSOVER Namespace Reference

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?

Detailed Description

Parameters with prefix heuristics/crossover.

Variable Documentation

BESTSOLLIMIT

Param<int> scippp::params::HEURISTICS::CROSSOVER::BESTSOLLIMIT { "heuristics/crossover/bestsollimit" }

constexpr

limit on number of improving incumbent solutions in sub-CIP

Definition at line 2873 of file parameters.hpp.

COPYCUTS

Param<bool> scippp::params::HEURISTICS::CROSSOVER::COPYCUTS { "heuristics/crossover/copycuts" }

constexpr

if uselprows == FALSE, should all active cuts from cutpool be copied to constraints in subproblem?

Definition at line 2869 of file parameters.hpp.

DONTWAITATROOT

Param<bool> scippp::params::HEURISTICS::CROSSOVER::DONTWAITATROOT { "heuristics/crossover/dontwaitatroot" }

constexpr

should the nwaitingnodes parameter be ignored at the root node?

Definition at line 2865 of file parameters.hpp.

FREQ

Param<int> scippp::params::HEURISTICS::CROSSOVER::FREQ { "heuristics/crossover/freq" }

constexpr

frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)

Definition at line 2839 of file parameters.hpp.

FREQOFS

Param<int> scippp::params::HEURISTICS::CROSSOVER::FREQOFS { "heuristics/crossover/freqofs" }

constexpr

frequency offset for calling primal heuristic <crossover>

Definition at line 2841 of file parameters.hpp.

LPLIMFAC

Param<double> scippp::params::HEURISTICS::CROSSOVER::LPLIMFAC { "heuristics/crossover/lplimfac" }

constexpr

factor by which the limit on the number of LP depends on the node limit

Definition at line 2861 of file parameters.hpp.

MAXDEPTH

Param<int> scippp::params::HEURISTICS::CROSSOVER::MAXDEPTH { "heuristics/crossover/maxdepth" }

constexpr

maximal depth level to call primal heuristic <crossover> (-1: no limit)

Definition at line 2843 of file parameters.hpp.

MAXNODES

Param<long long> scippp::params::HEURISTICS::CROSSOVER::MAXNODES { "heuristics/crossover/maxnodes" }

constexpr

maximum number of nodes to regard in the subproblem

Definition at line 2847 of file parameters.hpp.

MINFIXINGRATE

Param<double> scippp::params::HEURISTICS::CROSSOVER::MINFIXINGRATE { "heuristics/crossover/minfixingrate" }

constexpr

minimum percentage of integer variables that have to be fixed

Definition at line 2857 of file parameters.hpp.

MINIMPROVE

Param<double> scippp::params::HEURISTICS::CROSSOVER::MINIMPROVE { "heuristics/crossover/minimprove" }

constexpr

factor by which Crossover should at least improve the incumbent

Definition at line 2859 of file parameters.hpp.

MINNODES

Param<long long> scippp::params::HEURISTICS::CROSSOVER::MINNODES { "heuristics/crossover/minnodes" }

constexpr

minimum number of nodes required to start the subproblem

Definition at line 2849 of file parameters.hpp.

NODESOFS

Param<long long> scippp::params::HEURISTICS::CROSSOVER::NODESOFS { "heuristics/crossover/nodesofs" }

constexpr

number of nodes added to the contingent of the total nodes

Definition at line 2845 of file parameters.hpp.

NODESQUOT

Param<double> scippp::params::HEURISTICS::CROSSOVER::NODESQUOT { "heuristics/crossover/nodesquot" }

constexpr

contingent of sub problem nodes in relation to the number of nodes of the original problem

Definition at line 2855 of file parameters.hpp.

NUSEDSOLS

Param<int> scippp::params::HEURISTICS::CROSSOVER::NUSEDSOLS { "heuristics/crossover/nusedsols" }

constexpr

number of solutions to be taken into account

Definition at line 2851 of file parameters.hpp.

NWAITINGNODES

Param<long long> scippp::params::HEURISTICS::CROSSOVER::NWAITINGNODES { "heuristics/crossover/nwaitingnodes" }

constexpr

number of nodes without incumbent change that heuristic should wait

Definition at line 2853 of file parameters.hpp.

PERMUTE

Param<bool> scippp::params::HEURISTICS::CROSSOVER::PERMUTE { "heuristics/crossover/permute" }

constexpr

should the subproblem be permuted to increase diversification?

Definition at line 2871 of file parameters.hpp.

PRIORITY

Param<int> scippp::params::HEURISTICS::CROSSOVER::PRIORITY { "heuristics/crossover/priority" }

constexpr

priority of heuristic <crossover>

Definition at line 2837 of file parameters.hpp.

RANDOMIZATION

Param<bool> scippp::params::HEURISTICS::CROSSOVER::RANDOMIZATION { "heuristics/crossover/randomization" }

constexpr

should the choice which sols to take be randomized?

Definition at line 2863 of file parameters.hpp.

USELPROWS

Param<bool> scippp::params::HEURISTICS::CROSSOVER::USELPROWS { "heuristics/crossover/uselprows" }

constexpr

should subproblem be created out of the rows in the LP rows?

Definition at line 2867 of file parameters.hpp.

USEUCT

Param<bool> scippp::params::HEURISTICS::CROSSOVER::USEUCT { "heuristics/crossover/useuct" }

constexpr

should uct node selection be used at the beginning of the search?

Definition at line 2875 of file parameters.hpp.