scippp::params::HEURISTICS::RINS Namespace Reference

Parameters with prefix heuristics/rins. More...

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

Detailed Description

Parameters with prefix heuristics/rins.

Variable Documentation

COPYCUTS

constexpr Param<bool> scippp::params::HEURISTICS::RINS::COPYCUTS { "heuristics/rins/copycuts" }

constexpr

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

Definition at line 3806 of file parameters.hpp.

FREQ

constexpr Param<int> scippp::params::HEURISTICS::RINS::FREQ { "heuristics/rins/freq" }

constexpr

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

Definition at line 3782 of file parameters.hpp.

FREQOFS

constexpr Param<int> scippp::params::HEURISTICS::RINS::FREQOFS { "heuristics/rins/freqofs" }

constexpr

frequency offset for calling primal heuristic <rins>

Definition at line 3784 of file parameters.hpp.

LPLIMFAC

constexpr Param<double> scippp::params::HEURISTICS::RINS::LPLIMFAC { "heuristics/rins/lplimfac" }

constexpr

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

Definition at line 3802 of file parameters.hpp.

MAXDEPTH

constexpr Param<int> scippp::params::HEURISTICS::RINS::MAXDEPTH { "heuristics/rins/maxdepth" }

constexpr

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

Definition at line 3786 of file parameters.hpp.

MAXNODES

constexpr Param<int> scippp::params::HEURISTICS::RINS::MAXNODES { "heuristics/rins/maxnodes" }

constexpr

maximum number of nodes to regard in the subproblem

Definition at line 3790 of file parameters.hpp.

MINFIXINGRATE

constexpr Param<double> scippp::params::HEURISTICS::RINS::MINFIXINGRATE { "heuristics/rins/minfixingrate" }

constexpr

minimum percentage of integer variables that have to be fixed

Definition at line 3800 of file parameters.hpp.

MINIMPROVE

constexpr Param<double> scippp::params::HEURISTICS::RINS::MINIMPROVE { "heuristics/rins/minimprove" }

constexpr

factor by which rins should at least improve the incumbent

Definition at line 3798 of file parameters.hpp.

MINNODES

constexpr Param<int> scippp::params::HEURISTICS::RINS::MINNODES { "heuristics/rins/minnodes" }

constexpr

minimum number of nodes required to start the subproblem

Definition at line 3792 of file parameters.hpp.

NODESOFS

constexpr Param<int> scippp::params::HEURISTICS::RINS::NODESOFS { "heuristics/rins/nodesofs" }

constexpr

number of nodes added to the contingent of the total nodes

Definition at line 3788 of file parameters.hpp.

NODESQUOT

constexpr Param<double> scippp::params::HEURISTICS::RINS::NODESQUOT { "heuristics/rins/nodesquot" }

constexpr

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

Definition at line 3794 of file parameters.hpp.

NWAITINGNODES

constexpr Param<int> scippp::params::HEURISTICS::RINS::NWAITINGNODES { "heuristics/rins/nwaitingnodes" }

constexpr

number of nodes without incumbent change that heuristic should wait

Definition at line 3796 of file parameters.hpp.

PRIORITY

constexpr Param<int> scippp::params::HEURISTICS::RINS::PRIORITY { "heuristics/rins/priority" }

constexpr

priority of heuristic <rins>

Definition at line 3780 of file parameters.hpp.

USELPROWS

constexpr Param<bool> scippp::params::HEURISTICS::RINS::USELPROWS { "heuristics/rins/uselprows" }

constexpr

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

Definition at line 3804 of file parameters.hpp.

USEUCT

constexpr Param<bool> scippp::params::HEURISTICS::RINS::USEUCT { "heuristics/rins/useuct" }

constexpr

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

Definition at line 3808 of file parameters.hpp.