scippp::params::HEURISTICS::DINS Namespace Reference

Parameters with prefix heuristics/dins. More...

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

Detailed Description

Parameters with prefix heuristics/dins.

Variable Documentation

BESTSOLLIMIT

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

constexpr

limit on number of improving incumbent solutions in sub-CIP

Definition at line 2763 of file parameters.hpp.

COPYCUTS

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

constexpr

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

Definition at line 2759 of file parameters.hpp.

FREQ

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

constexpr

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

Definition at line 2731 of file parameters.hpp.

FREQOFS

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

constexpr

frequency offset for calling primal heuristic <dins>

Definition at line 2733 of file parameters.hpp.

LPLIMFAC

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

constexpr

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

Definition at line 2753 of file parameters.hpp.

MAXDEPTH

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

constexpr

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

Definition at line 2735 of file parameters.hpp.

MAXNODES

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

constexpr

maximum number of nodes to regard in the subproblem

Definition at line 2747 of file parameters.hpp.

MINFIXINGRATE

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

constexpr

minimum percentage of integer variables that have to be fixable

Definition at line 2755 of file parameters.hpp.

MINIMPROVE

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

constexpr

factor by which dins should at least improve the incumbent

Definition at line 2749 of file parameters.hpp.

MINNODES

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

constexpr

minimum number of nodes required to start the subproblem

Definition at line 2741 of file parameters.hpp.

NEIGHBORHOODSIZE

constexpr Param<int> scippp::params::HEURISTICS::DINS::NEIGHBORHOODSIZE { "heuristics/dins/neighborhoodsize" }

constexpr

radius (using Manhattan metric) of the incumbent's neighborhood to be searched

Definition at line 2745 of file parameters.hpp.

NODESOFS

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

constexpr

number of nodes added to the contingent of the total nodes

Definition at line 2737 of file parameters.hpp.

NODESQUOT

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

constexpr

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

Definition at line 2739 of file parameters.hpp.

NWAITINGNODES

constexpr Param<long long> scippp::params::HEURISTICS::DINS::NWAITINGNODES { "heuristics/dins/nwaitingnodes" }

constexpr

number of nodes without incumbent change that heuristic should wait

Definition at line 2751 of file parameters.hpp.

PRIORITY

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

constexpr

priority of heuristic <dins>

Definition at line 2729 of file parameters.hpp.

SOLNUM

constexpr Param<int> scippp::params::HEURISTICS::DINS::SOLNUM { "heuristics/dins/solnum" }

constexpr

number of pool-solutions to be checked for flag array update (for hard fixing of binary variables)

Definition at line 2743 of file parameters.hpp.

USELPROWS

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

constexpr

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

Definition at line 2757 of file parameters.hpp.

USEUCT

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

constexpr

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

Definition at line 2761 of file parameters.hpp.