scippp::params::HEURISTICS::MUTATION Namespace Reference

Parameters with prefix heuristics/mutation. More...

Variables
constexpr Param< int >	BESTSOLLIMIT { "heuristics/mutation/bestsollimit" }
	limit on number of improving incumbent solutions in sub-CIP
constexpr Param< bool >	COPYCUTS { "heuristics/mutation/copycuts" }
	if uselprows == FALSE, should all active cuts from cutpool be copied to constraints in subproblem?
constexpr Param< int >	FREQ { "heuristics/mutation/freq" }
	frequency for calling primal heuristic <mutation> (-1: never, 0: only at depth freqofs)
constexpr Param< int >	FREQOFS { "heuristics/mutation/freqofs" }
	frequency offset for calling primal heuristic <mutation>
constexpr Param< int >	MAXDEPTH { "heuristics/mutation/maxdepth" }
	maximal depth level to call primal heuristic <mutation> (-1: no limit)
constexpr Param< int >	MAXNODES { "heuristics/mutation/maxnodes" }
	maximum number of nodes to regard in the subproblem
constexpr Param< double >	MINFIXINGRATE { "heuristics/mutation/minfixingrate" }
	percentage of integer variables that have to be fixed
constexpr Param< double >	MINIMPROVE { "heuristics/mutation/minimprove" }
	factor by which mutation should at least improve the incumbent
constexpr Param< int >	MINNODES { "heuristics/mutation/minnodes" }
	minimum number of nodes required to start the subproblem
constexpr Param< int >	NODESOFS { "heuristics/mutation/nodesofs" }
	number of nodes added to the contingent of the total nodes
constexpr Param< double >	NODESQUOT { "heuristics/mutation/nodesquot" }
	contingent of sub problem nodes in relation to the number of nodes of the original problem
constexpr Param< int >	NWAITINGNODES { "heuristics/mutation/nwaitingnodes" }
	number of nodes without incumbent change that heuristic should wait
constexpr Param< int >	PRIORITY { "heuristics/mutation/priority" }
	priority of heuristic <mutation>
constexpr Param< bool >	USELPROWS { "heuristics/mutation/uselprows" }
	should subproblem be created out of the rows in the LP rows?
constexpr Param< bool >	USEUCT { "heuristics/mutation/useuct" }
	should uct node selection be used at the beginning of the search?

Detailed Description

Parameters with prefix heuristics/mutation.

Variable Documentation

BESTSOLLIMIT

Param<int> scippp::params::HEURISTICS::MUTATION::BESTSOLLIMIT { "heuristics/mutation/bestsollimit" }

constexpr

limit on number of improving incumbent solutions in sub-CIP

Definition at line 3596 of file parameters.hpp.

COPYCUTS

Param<bool> scippp::params::HEURISTICS::MUTATION::COPYCUTS { "heuristics/mutation/copycuts" }

constexpr

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

Definition at line 3594 of file parameters.hpp.

FREQ

Param<int> scippp::params::HEURISTICS::MUTATION::FREQ { "heuristics/mutation/freq" }

constexpr

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

Definition at line 3572 of file parameters.hpp.

FREQOFS

Param<int> scippp::params::HEURISTICS::MUTATION::FREQOFS { "heuristics/mutation/freqofs" }

constexpr

frequency offset for calling primal heuristic <mutation>

Definition at line 3574 of file parameters.hpp.

MAXDEPTH

Param<int> scippp::params::HEURISTICS::MUTATION::MAXDEPTH { "heuristics/mutation/maxdepth" }

constexpr

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

Definition at line 3576 of file parameters.hpp.

MAXNODES

Param<int> scippp::params::HEURISTICS::MUTATION::MAXNODES { "heuristics/mutation/maxnodes" }

constexpr

maximum number of nodes to regard in the subproblem

Definition at line 3580 of file parameters.hpp.

MINFIXINGRATE

Param<double> scippp::params::HEURISTICS::MUTATION::MINFIXINGRATE { "heuristics/mutation/minfixingrate" }

constexpr

percentage of integer variables that have to be fixed

Definition at line 3588 of file parameters.hpp.

MINIMPROVE

Param<double> scippp::params::HEURISTICS::MUTATION::MINIMPROVE { "heuristics/mutation/minimprove" }

constexpr

factor by which mutation should at least improve the incumbent

Definition at line 3590 of file parameters.hpp.

MINNODES

Param<int> scippp::params::HEURISTICS::MUTATION::MINNODES { "heuristics/mutation/minnodes" }

constexpr

minimum number of nodes required to start the subproblem

Definition at line 3582 of file parameters.hpp.

NODESOFS

Param<int> scippp::params::HEURISTICS::MUTATION::NODESOFS { "heuristics/mutation/nodesofs" }

constexpr

number of nodes added to the contingent of the total nodes

Definition at line 3578 of file parameters.hpp.

NODESQUOT

Param<double> scippp::params::HEURISTICS::MUTATION::NODESQUOT { "heuristics/mutation/nodesquot" }

constexpr

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

Definition at line 3586 of file parameters.hpp.

NWAITINGNODES

Param<int> scippp::params::HEURISTICS::MUTATION::NWAITINGNODES { "heuristics/mutation/nwaitingnodes" }

constexpr

number of nodes without incumbent change that heuristic should wait

Definition at line 3584 of file parameters.hpp.

PRIORITY

Param<int> scippp::params::HEURISTICS::MUTATION::PRIORITY { "heuristics/mutation/priority" }

constexpr

priority of heuristic <mutation>

Definition at line 3570 of file parameters.hpp.

USELPROWS

Param<bool> scippp::params::HEURISTICS::MUTATION::USELPROWS { "heuristics/mutation/uselprows" }

constexpr

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

Definition at line 3592 of file parameters.hpp.

USEUCT

Param<bool> scippp::params::HEURISTICS::MUTATION::USEUCT { "heuristics/mutation/useuct" }

constexpr

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

Definition at line 3598 of file parameters.hpp.