scippp::params::HEURISTICS::LOCALBRANCHING Namespace Reference

Parameters with prefix heuristics/localbranching. More...

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

Detailed Description

Parameters with prefix heuristics/localbranching.

Variable Documentation

BESTSOLLIMIT

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

constexpr

limit on number of improving incumbent solutions in sub-CIP

Definition at line 3232 of file parameters.hpp.

COPYCUTS

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

constexpr

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

Definition at line 3230 of file parameters.hpp.

FREQ

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

constexpr

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

Definition at line 3206 of file parameters.hpp.

FREQOFS

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

constexpr

frequency offset for calling primal heuristic <localbranching>

Definition at line 3208 of file parameters.hpp.

LPLIMFAC

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

constexpr

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

Definition at line 3218 of file parameters.hpp.

MAXDEPTH

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

constexpr

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

Definition at line 3210 of file parameters.hpp.

MAXNODES

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

constexpr

maximum number of nodes to regard in the subproblem

Definition at line 3222 of file parameters.hpp.

MINIMPROVE

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

constexpr

factor by which localbranching should at least improve the incumbent

Definition at line 3226 of file parameters.hpp.

MINNODES

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

constexpr

minimum number of nodes required to start the subproblem

Definition at line 3220 of file parameters.hpp.

NEIGHBORHOODSIZE

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

constexpr

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

Definition at line 3214 of file parameters.hpp.

NODESOFS

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

constexpr

number of nodes added to the contingent of the total nodes

Definition at line 3212 of file parameters.hpp.

NODESQUOT

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

constexpr

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

Definition at line 3216 of file parameters.hpp.

NWAITINGNODES

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

constexpr

number of nodes without incumbent change that heuristic should wait

Definition at line 3224 of file parameters.hpp.

PRIORITY

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

constexpr

priority of heuristic <localbranching>

Definition at line 3204 of file parameters.hpp.

USELPROWS

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

constexpr

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

Definition at line 3228 of file parameters.hpp.