scippp::params::HEURISTICS::PROXIMITY Namespace Reference

Parameters with prefix heuristics/proximity. More...

Variables
constexpr Param< double >	BINVARQUOT { "heuristics/proximity/binvarquot" }
	threshold for percentage of binary variables required to start
constexpr Param< int >	FREQ { "heuristics/proximity/freq" }
	frequency for calling primal heuristic <proximity> (-1: never, 0: only at depth freqofs)
constexpr Param< int >	FREQOFS { "heuristics/proximity/freqofs" }
	frequency offset for calling primal heuristic <proximity>
constexpr Param< double >	LPITERSQUOT { "heuristics/proximity/lpitersquot" }
	quotient of sub-MIP LP iterations with respect to LP iterations so far
constexpr Param< int >	MAXDEPTH { "heuristics/proximity/maxdepth" }
	maximal depth level to call primal heuristic <proximity> (-1: no limit)
constexpr Param< long long >	MAXLPITERS { "heuristics/proximity/maxlpiters" }
	maximum number of LP iterations to be performed in the subproblem
constexpr Param< long long >	MAXNODES { "heuristics/proximity/maxnodes" }
	maximum number of nodes to regard in the subproblem
constexpr Param< double >	MINGAP { "heuristics/proximity/mingap" }
	minimum primal-dual gap for which the heuristic is executed
constexpr Param< double >	MINIMPROVE { "heuristics/proximity/minimprove" }
	factor by which proximity should at least improve the incumbent
constexpr Param< long long >	MINLPITERS { "heuristics/proximity/minlpiters" }
	minimum number of LP iterations performed in subproblem
constexpr Param< long long >	MINNODES { "heuristics/proximity/minnodes" }
	minimum number of nodes required to start the subproblem
constexpr Param< long long >	NODESOFS { "heuristics/proximity/nodesofs" }
	number of nodes added to the contingent of the total nodes
constexpr Param< double >	NODESQUOT { "heuristics/proximity/nodesquot" }
	sub-MIP node limit w.r.t number of original nodes
constexpr Param< int >	PRIORITY { "heuristics/proximity/priority" }
	priority of heuristic <proximity>
constexpr Param< bool >	RESTART { "heuristics/proximity/restart" }
	should the heuristic immediately run again on its newly found solution?
constexpr Param< bool >	USEFINALLP { "heuristics/proximity/usefinallp" }
	should the heuristic solve a final LP in case of continuous objective variables?
constexpr Param< bool >	USELPROWS { "heuristics/proximity/uselprows" }
	should subproblem be constructed based on LP row information?
constexpr Param< bool >	USEUCT { "heuristics/proximity/useuct" }
	should uct node selection be used at the beginning of the search?
constexpr Param< long long >	WAITINGNODES { "heuristics/proximity/waitingnodes" }
	waiting nodes since last incumbent before heuristic is executed

Detailed Description

Parameters with prefix heuristics/proximity.

Variable Documentation

BINVARQUOT

constexpr Param<double> scippp::params::HEURISTICS::PROXIMITY::BINVARQUOT { "heuristics/proximity/binvarquot" }

constexpr

threshold for percentage of binary variables required to start

Definition at line 3619 of file parameters.hpp.

FREQ

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

constexpr

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

Definition at line 3591 of file parameters.hpp.

FREQOFS

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

constexpr

frequency offset for calling primal heuristic <proximity>

Definition at line 3593 of file parameters.hpp.

LPITERSQUOT

constexpr Param<double> scippp::params::HEURISTICS::PROXIMITY::LPITERSQUOT { "heuristics/proximity/lpitersquot" }

constexpr

quotient of sub-MIP LP iterations with respect to LP iterations so far

Definition at line 3621 of file parameters.hpp.

MAXDEPTH

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

constexpr

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

Definition at line 3595 of file parameters.hpp.

MAXLPITERS

constexpr Param<long long> scippp::params::HEURISTICS::PROXIMITY::MAXLPITERS { "heuristics/proximity/maxlpiters" }

constexpr

maximum number of LP iterations to be performed in the subproblem

Definition at line 3609 of file parameters.hpp.

MAXNODES

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

constexpr

maximum number of nodes to regard in the subproblem

Definition at line 3603 of file parameters.hpp.

MINGAP

constexpr Param<double> scippp::params::HEURISTICS::PROXIMITY::MINGAP { "heuristics/proximity/mingap" }

constexpr

minimum primal-dual gap for which the heuristic is executed

Definition at line 3623 of file parameters.hpp.

MINIMPROVE

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

constexpr

factor by which proximity should at least improve the incumbent

Definition at line 3615 of file parameters.hpp.

MINLPITERS

constexpr Param<long long> scippp::params::HEURISTICS::PROXIMITY::MINLPITERS { "heuristics/proximity/minlpiters" }

constexpr

minimum number of LP iterations performed in subproblem

Definition at line 3611 of file parameters.hpp.

MINNODES

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

constexpr

minimum number of nodes required to start the subproblem

Definition at line 3607 of file parameters.hpp.

NODESOFS

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

constexpr

number of nodes added to the contingent of the total nodes

Definition at line 3605 of file parameters.hpp.

NODESQUOT

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

constexpr

sub-MIP node limit w.r.t number of original nodes

Definition at line 3617 of file parameters.hpp.

PRIORITY

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

constexpr

priority of heuristic <proximity>

Definition at line 3589 of file parameters.hpp.

RESTART

constexpr Param<bool> scippp::params::HEURISTICS::PROXIMITY::RESTART { "heuristics/proximity/restart" }

constexpr

should the heuristic immediately run again on its newly found solution?

Definition at line 3599 of file parameters.hpp.

USEFINALLP

constexpr Param<bool> scippp::params::HEURISTICS::PROXIMITY::USEFINALLP { "heuristics/proximity/usefinallp" }

constexpr

should the heuristic solve a final LP in case of continuous objective variables?

Definition at line 3601 of file parameters.hpp.

USELPROWS

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

constexpr

should subproblem be constructed based on LP row information?

Definition at line 3597 of file parameters.hpp.

USEUCT

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

constexpr

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

Definition at line 3625 of file parameters.hpp.

WAITINGNODES

constexpr Param<long long> scippp::params::HEURISTICS::PROXIMITY::WAITINGNODES { "heuristics/proximity/waitingnodes" }

constexpr

waiting nodes since last incumbent before heuristic is executed

Definition at line 3613 of file parameters.hpp.