scippp::params::HEURISTICS::COMPLETESOL Namespace Reference

Parameters with prefix heuristics/completesol. More...

Variables
constexpr Param< bool >	ADDALLSOLS { "heuristics/completesol/addallsols" }
	should all subproblem solutions be added to the original SCIP?
constexpr Param< bool >	BEFOREPRESOL { "heuristics/completesol/beforepresol" }
	should the heuristic run before presolving?
constexpr Param< double >	BOUNDWIDENING { "heuristics/completesol/boundwidening" }
	bound widening factor applied to continuous variables (0: fix variables to given solution values, 1: relax to global bounds)
constexpr Param< int >	FREQ { "heuristics/completesol/freq" }
	frequency for calling primal heuristic <completesol> (-1: never, 0: only at depth freqofs)
constexpr Param< int >	FREQOFS { "heuristics/completesol/freqofs" }
	frequency offset for calling primal heuristic <completesol>
constexpr Param< bool >	IGNORECONT { "heuristics/completesol/ignorecont" }
	should number of continuous variables be ignored?
constexpr Param< double >	LPLIMFAC { "heuristics/completesol/lplimfac" }
	factor by which the limit on the number of LP depends on the node limit
constexpr Param< int >	MAXCONTVARS { "heuristics/completesol/maxcontvars" }
	maximal number of continuous variables after presolving
constexpr Param< int >	MAXDEPTH { "heuristics/completesol/maxdepth" }
	maximal depth level to call primal heuristic <completesol> (-1: no limit)
constexpr Param< long long >	MAXLPITER { "heuristics/completesol/maxlpiter" }
	maximal number of LP iterations (-1: no limit)
constexpr Param< long long >	MAXNODES { "heuristics/completesol/maxnodes" }
	maximum number of nodes to regard in the subproblem
constexpr Param< int >	MAXPROPROUNDS { "heuristics/completesol/maxproprounds" }
	maximal number of iterations in propagation (-1: no limit)
constexpr Param< double >	MAXUNKNOWNRATE { "heuristics/completesol/maxunknownrate" }
	maximal rate of unknown solution values
constexpr Param< double >	MINIMPROVE { "heuristics/completesol/minimprove" }
	factor by which the incumbent should be improved at least
constexpr Param< long long >	MINNODES { "heuristics/completesol/minnodes" }
	minimum number of nodes required to start the subproblem
constexpr Param< long long >	NODESOFS { "heuristics/completesol/nodesofs" }
	number of nodes added to the contingent of the total nodes
constexpr Param< double >	NODESQUOT { "heuristics/completesol/nodesquot" }
	contingent of sub problem nodes in relation to the number of nodes of the original problem
constexpr Param< double >	OBJWEIGHT { "heuristics/completesol/objweight" }
	weight of the original objective function (1: only original objective)
constexpr Param< int >	PRIORITY { "heuristics/completesol/priority" }
	priority of heuristic <completesol>
constexpr Param< int >	SOLUTIONS { "heuristics/completesol/solutions" }
	heuristic stops, if the given number of improving solutions were found (-1: no limit)

Detailed Description

Parameters with prefix heuristics/completesol.

Variable Documentation

ADDALLSOLS

Param<bool> scippp::params::HEURISTICS::COMPLETESOL::ADDALLSOLS { "heuristics/completesol/addallsols" }

constexpr

should all subproblem solutions be added to the original SCIP?

Definition at line 2761 of file parameters.hpp.

BEFOREPRESOL

Param<bool> scippp::params::HEURISTICS::COMPLETESOL::BEFOREPRESOL { "heuristics/completesol/beforepresol" }

constexpr

should the heuristic run before presolving?

Definition at line 2782 of file parameters.hpp.

BOUNDWIDENING

Param<double> scippp::params::HEURISTICS::COMPLETESOL::BOUNDWIDENING { "heuristics/completesol/boundwidening" }

constexpr

bound widening factor applied to continuous variables (0: fix variables to given solution values, 1: relax to global bounds)

Definition at line 2772 of file parameters.hpp.

FREQ

Param<int> scippp::params::HEURISTICS::COMPLETESOL::FREQ { "heuristics/completesol/freq" }

constexpr

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

Definition at line 2749 of file parameters.hpp.

FREQOFS

Param<int> scippp::params::HEURISTICS::COMPLETESOL::FREQOFS { "heuristics/completesol/freqofs" }

constexpr

frequency offset for calling primal heuristic <completesol>

Definition at line 2751 of file parameters.hpp.

IGNORECONT

Param<bool> scippp::params::HEURISTICS::COMPLETESOL::IGNORECONT { "heuristics/completesol/ignorecont" }

constexpr

should number of continuous variables be ignored?

Definition at line 2776 of file parameters.hpp.

LPLIMFAC

Param<double> scippp::params::HEURISTICS::COMPLETESOL::LPLIMFAC { "heuristics/completesol/lplimfac" }

constexpr

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

Definition at line 2767 of file parameters.hpp.

MAXCONTVARS

Param<int> scippp::params::HEURISTICS::COMPLETESOL::MAXCONTVARS { "heuristics/completesol/maxcontvars" }

constexpr

maximal number of continuous variables after presolving

Definition at line 2786 of file parameters.hpp.

MAXDEPTH

Param<int> scippp::params::HEURISTICS::COMPLETESOL::MAXDEPTH { "heuristics/completesol/maxdepth" }

constexpr

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

Definition at line 2753 of file parameters.hpp.

MAXLPITER

Param<long long> scippp::params::HEURISTICS::COMPLETESOL::MAXLPITER { "heuristics/completesol/maxlpiter" }

constexpr

maximal number of LP iterations (-1: no limit)

Definition at line 2784 of file parameters.hpp.

MAXNODES

Param<long long> scippp::params::HEURISTICS::COMPLETESOL::MAXNODES { "heuristics/completesol/maxnodes" }

constexpr

maximum number of nodes to regard in the subproblem

Definition at line 2755 of file parameters.hpp.

MAXPROPROUNDS

Param<int> scippp::params::HEURISTICS::COMPLETESOL::MAXPROPROUNDS { "heuristics/completesol/maxproprounds" }

constexpr

maximal number of iterations in propagation (-1: no limit)

Definition at line 2780 of file parameters.hpp.

MAXUNKNOWNRATE

Param<double> scippp::params::HEURISTICS::COMPLETESOL::MAXUNKNOWNRATE { "heuristics/completesol/maxunknownrate" }

constexpr

maximal rate of unknown solution values

Definition at line 2759 of file parameters.hpp.

MINIMPROVE

Param<double> scippp::params::HEURISTICS::COMPLETESOL::MINIMPROVE { "heuristics/completesol/minimprove" }

constexpr

factor by which the incumbent should be improved at least

Definition at line 2774 of file parameters.hpp.

MINNODES

Param<long long> scippp::params::HEURISTICS::COMPLETESOL::MINNODES { "heuristics/completesol/minnodes" }

constexpr

minimum number of nodes required to start the subproblem

Definition at line 2757 of file parameters.hpp.

NODESOFS

Param<long long> scippp::params::HEURISTICS::COMPLETESOL::NODESOFS { "heuristics/completesol/nodesofs" }

constexpr

number of nodes added to the contingent of the total nodes

Definition at line 2763 of file parameters.hpp.

NODESQUOT

Param<double> scippp::params::HEURISTICS::COMPLETESOL::NODESQUOT { "heuristics/completesol/nodesquot" }

constexpr

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

Definition at line 2765 of file parameters.hpp.

OBJWEIGHT

Param<double> scippp::params::HEURISTICS::COMPLETESOL::OBJWEIGHT { "heuristics/completesol/objweight" }

constexpr

weight of the original objective function (1: only original objective)

Definition at line 2769 of file parameters.hpp.

PRIORITY

Param<int> scippp::params::HEURISTICS::COMPLETESOL::PRIORITY { "heuristics/completesol/priority" }

constexpr

priority of heuristic <completesol>

Definition at line 2747 of file parameters.hpp.

SOLUTIONS

Param<int> scippp::params::HEURISTICS::COMPLETESOL::SOLUTIONS { "heuristics/completesol/solutions" }

constexpr

heuristic stops, if the given number of improving solutions were found (-1: no limit)

Definition at line 2778 of file parameters.hpp.