scippp::params::HEURISTICS::TRUSTREGION Namespace Reference

Parameters with prefix heuristics/trustregion. More...

Variables
constexpr Param< int >	BESTSOLLIMIT { "heuristics/trustregion/bestsollimit" }
	limit on number of improving incumbent solutions in sub-CIP
constexpr Param< bool >	COPYCUTS { "heuristics/trustregion/copycuts" }
	if uselprows == FALSE, should all active cuts from cutpool be copied to constraints in subproblem?
constexpr Param< int >	FREQ { "heuristics/trustregion/freq" }
	frequency for calling primal heuristic <trustregion> (-1: never, 0: only at depth freqofs)
constexpr Param< int >	FREQOFS { "heuristics/trustregion/freqofs" }
	frequency offset for calling primal heuristic <trustregion>
constexpr Param< double >	LPLIMFAC { "heuristics/trustregion/lplimfac" }
	factor by which the limit on the number of LP depends on the node limit
constexpr Param< int >	MAXDEPTH { "heuristics/trustregion/maxdepth" }
	maximal depth level to call primal heuristic <trustregion> (-1: no limit)
constexpr Param< int >	MAXNODES { "heuristics/trustregion/maxnodes" }
	maximum number of nodes to regard in the subproblem
constexpr Param< int >	MINBINVARS { "heuristics/trustregion/minbinvars" }
	the number of binary variables necessary to run the heuristic
constexpr Param< int >	MINNODES { "heuristics/trustregion/minnodes" }
	minimum number of nodes required to start the subproblem
constexpr Param< int >	NODESOFS { "heuristics/trustregion/nodesofs" }
	number of nodes added to the contingent of the total nodes
constexpr Param< double >	NODESQUOT { "heuristics/trustregion/nodesquot" }
	contingent of sub problem nodes in relation to the number of nodes of the original problem
constexpr Param< int >	NWAITINGNODES { "heuristics/trustregion/nwaitingnodes" }
	number of nodes without incumbent change that heuristic should wait
constexpr Param< double >	OBJMINIMPROVE { "heuristics/trustregion/objminimprove" }
	the minimum absolute improvement in the objective function value
constexpr Param< int >	PRIORITY { "heuristics/trustregion/priority" }
	priority of heuristic <trustregion>
constexpr Param< bool >	USELPROWS { "heuristics/trustregion/uselprows" }
	should subproblem be created out of the rows in the LP rows?
constexpr Param< double >	VIOLPENALTY { "heuristics/trustregion/violpenalty" }
	the penalty for each change in the binary variables from the candidate solution

Detailed Description

Parameters with prefix heuristics/trustregion.

Variable Documentation

BESTSOLLIMIT

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

constexpr

limit on number of improving incumbent solutions in sub-CIP

Definition at line 4021 of file parameters.hpp.

COPYCUTS

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

constexpr

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

Definition at line 4019 of file parameters.hpp.

FREQ

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

constexpr

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

Definition at line 3997 of file parameters.hpp.

FREQOFS

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

constexpr

frequency offset for calling primal heuristic <trustregion>

Definition at line 3999 of file parameters.hpp.

LPLIMFAC

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

constexpr

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

Definition at line 4009 of file parameters.hpp.

MAXDEPTH

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

constexpr

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

Definition at line 4001 of file parameters.hpp.

MAXNODES

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

constexpr

maximum number of nodes to regard in the subproblem

Definition at line 4013 of file parameters.hpp.

MINBINVARS

constexpr Param<int> scippp::params::HEURISTICS::TRUSTREGION::MINBINVARS { "heuristics/trustregion/minbinvars" }

constexpr

the number of binary variables necessary to run the heuristic

Definition at line 4005 of file parameters.hpp.

MINNODES

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

constexpr

minimum number of nodes required to start the subproblem

Definition at line 4011 of file parameters.hpp.

NODESOFS

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

constexpr

number of nodes added to the contingent of the total nodes

Definition at line 4003 of file parameters.hpp.

NODESQUOT

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

constexpr

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

Definition at line 4007 of file parameters.hpp.

NWAITINGNODES

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

constexpr

number of nodes without incumbent change that heuristic should wait

Definition at line 4015 of file parameters.hpp.

OBJMINIMPROVE

constexpr Param<double> scippp::params::HEURISTICS::TRUSTREGION::OBJMINIMPROVE { "heuristics/trustregion/objminimprove" }

constexpr

the minimum absolute improvement in the objective function value

Definition at line 4025 of file parameters.hpp.

PRIORITY

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

constexpr

priority of heuristic <trustregion>

Definition at line 3995 of file parameters.hpp.

USELPROWS

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

constexpr

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

Definition at line 4017 of file parameters.hpp.

VIOLPENALTY

constexpr Param<double> scippp::params::HEURISTICS::TRUSTREGION::VIOLPENALTY { "heuristics/trustregion/violpenalty" }

constexpr

the penalty for each change in the binary variables from the candidate solution

Definition at line 4023 of file parameters.hpp.