Parameters with prefix heuristics/rens. More...

Variables
constexpr Param< bool >	ADDALLSOLS { "heuristics/rens/addallsols" }
	should all subproblem solutions be added to the original SCIP?

constexpr Param< int >	BESTSOLLIMIT { "heuristics/rens/bestsollimit" }
	limit on number of improving incumbent solutions in sub-CIP

constexpr Param< bool >	BINARYBOUNDS { "heuristics/rens/binarybounds" }
	should general integers get binary bounds [floor(.),ceil(.)] ?

constexpr Param< bool >	COPYCUTS { "heuristics/rens/copycuts" }
	if uselprows == FALSE, should all active cuts from cutpool be copied to constraints in subproblem?

constexpr Param< bool >	EXTRATIME { "heuristics/rens/extratime" }
	should the RENS sub-CIP get its own full time limit? This is only for testing and not recommended!

constexpr Param< int >	FREQ { "heuristics/rens/freq" }
	frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)

constexpr Param< int >	FREQOFS { "heuristics/rens/freqofs" }
	frequency offset for calling primal heuristic <rens>

constexpr Param< bool >	FULLSCALE { "heuristics/rens/fullscale" }
	should the RENS sub-CIP be solved with cuts, conflicts, strong branching,... This is only for testing and not recommended!

constexpr Param< double >	LPLIMFAC { "heuristics/rens/lplimfac" }
	factor by which the limit on the number of LP depends on the node limit

constexpr Param< int >	MAXDEPTH { "heuristics/rens/maxdepth" }
	maximal depth level to call primal heuristic <rens> (-1: no limit)

constexpr Param< long long >	MAXNODES { "heuristics/rens/maxnodes" }
	maximum number of nodes to regard in the subproblem

constexpr Param< double >	MINFIXINGRATE { "heuristics/rens/minfixingrate" }
	minimum percentage of integer variables that have to be fixable

constexpr Param< double >	MINIMPROVE { "heuristics/rens/minimprove" }
	factor by which RENS should at least improve the incumbent

constexpr Param< long long >	MINNODES { "heuristics/rens/minnodes" }
	minimum number of nodes required to start the subproblem

constexpr Param< long long >	NODESOFS { "heuristics/rens/nodesofs" }
	number of nodes added to the contingent of the total nodes

constexpr Param< double >	NODESQUOT { "heuristics/rens/nodesquot" }
	contingent of sub problem nodes in relation to the number of nodes of the original problem

constexpr Param< int >	PRIORITY { "heuristics/rens/priority" }
	priority of heuristic <rens>

constexpr Param< char >	STARTSOL { "heuristics/rens/startsol" }
	solution that is used for fixing values ('l'p relaxation, 'n'lp relaxation)

constexpr Param< bool >	USELPROWS { "heuristics/rens/uselprows" }
	should subproblem be created out of the rows in the LP rows?

constexpr Param< bool >	USEUCT { "heuristics/rens/useuct" }
	should uct node selection be used at the beginning of the search?

Detailed Description

Parameters with prefix heuristics/rens.

Variable Documentation

◆ ADDALLSOLS

constexpr Param<bool> scippp::params::HEURISTICS::RENS::ADDALLSOLS { "heuristics/rens/addallsols" }

constexpr

should all subproblem solutions be added to the original SCIP?

Definition at line 3719 of file parameters.hpp.

◆ BESTSOLLIMIT

constexpr Param<int> scippp::params::HEURISTICS::RENS::BESTSOLLIMIT { "heuristics/rens/bestsollimit" }

constexpr

limit on number of improving incumbent solutions in sub-CIP

Definition at line 3724 of file parameters.hpp.

◆ BINARYBOUNDS

constexpr Param<bool> scippp::params::HEURISTICS::RENS::BINARYBOUNDS { "heuristics/rens/binarybounds" }

constexpr

should general integers get binary bounds [floor(.),ceil(.)] ?

Definition at line 3711 of file parameters.hpp.

◆ COPYCUTS

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

constexpr

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

Definition at line 3715 of file parameters.hpp.

◆ EXTRATIME

constexpr Param<bool> scippp::params::HEURISTICS::RENS::EXTRATIME { "heuristics/rens/extratime" }

constexpr

should the RENS sub-CIP get its own full time limit? This is only for testing and not recommended!

Definition at line 3717 of file parameters.hpp.

◆ FREQ

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

constexpr

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

Definition at line 3689 of file parameters.hpp.

◆ FREQOFS

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

constexpr

frequency offset for calling primal heuristic <rens>

Definition at line 3691 of file parameters.hpp.

◆ FULLSCALE

constexpr Param<bool> scippp::params::HEURISTICS::RENS::FULLSCALE { "heuristics/rens/fullscale" }

constexpr

should the RENS sub-CIP be solved with cuts, conflicts, strong branching,... This is only for testing and not recommended!

Definition at line 3722 of file parameters.hpp.

◆ LPLIMFAC

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

constexpr

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

Definition at line 3707 of file parameters.hpp.

◆ MAXDEPTH

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

constexpr

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

Definition at line 3693 of file parameters.hpp.

◆ MAXNODES

constexpr Param<long long> scippp::params::HEURISTICS::RENS::MAXNODES { "heuristics/rens/maxnodes" }

constexpr

maximum number of nodes to regard in the subproblem

Definition at line 3697 of file parameters.hpp.

◆ MINFIXINGRATE

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

constexpr

minimum percentage of integer variables that have to be fixable

Definition at line 3695 of file parameters.hpp.

◆ MINIMPROVE

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

constexpr

factor by which RENS should at least improve the incumbent

Definition at line 3705 of file parameters.hpp.

◆ MINNODES

constexpr Param<long long> scippp::params::HEURISTICS::RENS::MINNODES { "heuristics/rens/minnodes" }

constexpr

minimum number of nodes required to start the subproblem

Definition at line 3701 of file parameters.hpp.

◆ NODESOFS

constexpr Param<long long> scippp::params::HEURISTICS::RENS::NODESOFS { "heuristics/rens/nodesofs" }

constexpr

number of nodes added to the contingent of the total nodes

Definition at line 3699 of file parameters.hpp.

◆ NODESQUOT

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

constexpr

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

Definition at line 3703 of file parameters.hpp.

◆ PRIORITY

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

constexpr

priority of heuristic <rens>

Definition at line 3687 of file parameters.hpp.

◆ STARTSOL

constexpr Param<char> scippp::params::HEURISTICS::RENS::STARTSOL { "heuristics/rens/startsol" }

constexpr

solution that is used for fixing values ('l'p relaxation, 'n'lp relaxation)

Definition at line 3709 of file parameters.hpp.

◆ USELPROWS

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

constexpr

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

Definition at line 3713 of file parameters.hpp.

◆ USEUCT

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

constexpr

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

Definition at line 3726 of file parameters.hpp.

SCIP++ refs/heads/main

Variables

Detailed Description

Variable Documentation

◆ ADDALLSOLS

◆ BESTSOLLIMIT

◆ BINARYBOUNDS

◆ COPYCUTS

◆ EXTRATIME

◆ FREQ

◆ FREQOFS

◆ FULLSCALE

◆ LPLIMFAC

◆ MAXDEPTH

◆ MAXNODES

◆ MINFIXINGRATE

◆ MINIMPROVE

◆ MINNODES

◆ NODESOFS

◆ NODESQUOT

◆ PRIORITY

◆ STARTSOL

◆ USELPROWS

◆ USEUCT