SCIP++ refs/heads/main
 
Loading...
Searching...
No Matches
Variables
scippp::params::HEURISTICS::GINS Namespace Reference

Parameters with prefix heuristics/gins. More...

Variables

constexpr Param< int > BESTSOLLIMIT { "heuristics/gins/bestsollimit" }
 limit on number of improving incumbent solutions in sub-CIP
 
constexpr Param< bool > CONSECUTIVEBLOCKS { "heuristics/gins/consecutiveblocks" }
 should blocks be treated consecutively (sorted by ascending label?)
 
constexpr Param< bool > COPYCUTS { "heuristics/gins/copycuts" }
 if uselprows == FALSE, should all active cuts from cutpool be copied to constraints in subproblem?
 
constexpr Param< bool > FIXCONTVARS { "heuristics/gins/fixcontvars" }
 should continuous variables outside the neighborhoods be fixed?
 
constexpr Param< int > FREQ { "heuristics/gins/freq" }
 frequency for calling primal heuristic <gins> (-1: never, 0: only at depth freqofs)
 
constexpr Param< int > FREQOFS { "heuristics/gins/freqofs" }
 frequency offset for calling primal heuristic <gins>
 
constexpr Param< int > MAXDEPTH { "heuristics/gins/maxdepth" }
 maximal depth level to call primal heuristic <gins> (-1: no limit)
 
constexpr Param< int > MAXDISTANCE { "heuristics/gins/maxdistance" }
 maximum distance to selected variable to enter the subproblem, or -1 to select the distance that best approximates the minimum fixing rate from below
 
constexpr Param< int > MAXNODES { "heuristics/gins/maxnodes" }
 maximum number of nodes to regard in the subproblem
 
constexpr Param< double > MINFIXINGRATE { "heuristics/gins/minfixingrate" }
 percentage of integer variables that have to be fixed
 
constexpr Param< double > MINIMPROVE { "heuristics/gins/minimprove" }
 factor by which gins should at least improve the incumbent
 
constexpr Param< int > MINNODES { "heuristics/gins/minnodes" }
 minimum number of nodes required to start the subproblem
 
constexpr Param< int > NODESOFS { "heuristics/gins/nodesofs" }
 number of nodes added to the contingent of the total nodes
 
constexpr Param< double > NODESQUOT { "heuristics/gins/nodesquot" }
 contingent of sub problem nodes in relation to the number of nodes of the original problem
 
constexpr Param< int > NWAITINGNODES { "heuristics/gins/nwaitingnodes" }
 number of nodes without incumbent change that heuristic should wait
 
constexpr Param< double > OVERLAP { "heuristics/gins/overlap" }
 overlap of blocks between runs - 0.0: no overlap, 1.0: shift by only 1 block
 
constexpr Param< char > POTENTIAL { "heuristics/gins/potential" }
 the reference point to compute the neighborhood potential: (r)oot, (l)ocal lp, or (p)seudo solution
 
constexpr Param< int > PRIORITY { "heuristics/gins/priority" }
 priority of heuristic <gins>
 
constexpr Param< bool > RELAXDENSECONSS { "heuristics/gins/relaxdenseconss" }
 should dense constraints (at least as dense as 1 - minfixingrate) be ignored by connectivity graph?
 
constexpr Param< double > ROLLHORIZONLIMFAC { "heuristics/gins/rollhorizonlimfac" }
 limiting percentage for variables already used in sub-SCIPs to terminate rolling horizon approach
 
constexpr Param< bool > USEDECOMP { "heuristics/gins/usedecomp" }
 should user decompositions be considered, if available?
 
constexpr Param< bool > USEDECOMPROLLHORIZON { "heuristics/gins/usedecomprollhorizon" }
 should user decompositions be considered for initial selection in rolling horizon, if available?
 
constexpr Param< bool > USELPROWS { "heuristics/gins/uselprows" }
 should subproblem be created out of the rows in the LP rows?
 
constexpr Param< bool > USEROLLINGHORIZON { "heuristics/gins/userollinghorizon" }
 should the heuristic solve a sequence of sub-MIP's around the first selected variable
 
constexpr Param< bool > USESELFALLBACK { "heuristics/gins/useselfallback" }
 should random initial variable selection be used if decomposition was not successful?
 

Detailed Description

Parameters with prefix heuristics/gins.

Variable Documentation

◆ BESTSOLLIMIT

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

limit on number of improving incumbent solutions in sub-CIP

Definition at line 3200 of file parameters.hpp.

◆ CONSECUTIVEBLOCKS

Param<bool> scippp::params::HEURISTICS::GINS::CONSECUTIVEBLOCKS { "heuristics/gins/consecutiveblocks" }
constexpr

should blocks be treated consecutively (sorted by ascending label?)

Definition at line 3221 of file parameters.hpp.

◆ COPYCUTS

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

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

Definition at line 3196 of file parameters.hpp.

◆ FIXCONTVARS

Param<bool> scippp::params::HEURISTICS::GINS::FIXCONTVARS { "heuristics/gins/fixcontvars" }
constexpr

should continuous variables outside the neighborhoods be fixed?

Definition at line 3198 of file parameters.hpp.

◆ FREQ

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

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

Definition at line 3174 of file parameters.hpp.

◆ FREQOFS

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

frequency offset for calling primal heuristic <gins>

Definition at line 3176 of file parameters.hpp.

◆ MAXDEPTH

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

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

Definition at line 3178 of file parameters.hpp.

◆ MAXDISTANCE

Param<int> scippp::params::HEURISTICS::GINS::MAXDISTANCE { "heuristics/gins/maxdistance" }
constexpr

maximum distance to selected variable to enter the subproblem, or -1 to select the distance that best approximates the minimum fixing rate from below

Definition at line 3203 of file parameters.hpp.

◆ MAXNODES

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

maximum number of nodes to regard in the subproblem

Definition at line 3182 of file parameters.hpp.

◆ MINFIXINGRATE

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

percentage of integer variables that have to be fixed

Definition at line 3190 of file parameters.hpp.

◆ MINIMPROVE

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

factor by which gins should at least improve the incumbent

Definition at line 3192 of file parameters.hpp.

◆ MINNODES

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

minimum number of nodes required to start the subproblem

Definition at line 3184 of file parameters.hpp.

◆ NODESOFS

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

number of nodes added to the contingent of the total nodes

Definition at line 3180 of file parameters.hpp.

◆ NODESQUOT

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

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

Definition at line 3188 of file parameters.hpp.

◆ NWAITINGNODES

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

number of nodes without incumbent change that heuristic should wait

Definition at line 3186 of file parameters.hpp.

◆ OVERLAP

Param<double> scippp::params::HEURISTICS::GINS::OVERLAP { "heuristics/gins/overlap" }
constexpr

overlap of blocks between runs - 0.0: no overlap, 1.0: shift by only 1 block

Definition at line 3213 of file parameters.hpp.

◆ POTENTIAL

Param<char> scippp::params::HEURISTICS::GINS::POTENTIAL { "heuristics/gins/potential" }
constexpr

the reference point to compute the neighborhood potential: (r)oot, (l)ocal lp, or (p)seudo solution

Definition at line 3205 of file parameters.hpp.

◆ PRIORITY

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

priority of heuristic <gins>

Definition at line 3172 of file parameters.hpp.

◆ RELAXDENSECONSS

Param<bool> scippp::params::HEURISTICS::GINS::RELAXDENSECONSS { "heuristics/gins/relaxdenseconss" }
constexpr

should dense constraints (at least as dense as 1 - minfixingrate) be ignored by connectivity graph?

Definition at line 3209 of file parameters.hpp.

◆ ROLLHORIZONLIMFAC

Param<double> scippp::params::HEURISTICS::GINS::ROLLHORIZONLIMFAC { "heuristics/gins/rollhorizonlimfac" }
constexpr

limiting percentage for variables already used in sub-SCIPs to terminate rolling horizon approach

Definition at line 3211 of file parameters.hpp.

◆ USEDECOMP

Param<bool> scippp::params::HEURISTICS::GINS::USEDECOMP { "heuristics/gins/usedecomp" }
constexpr

should user decompositions be considered, if available?

Definition at line 3215 of file parameters.hpp.

◆ USEDECOMPROLLHORIZON

Param<bool> scippp::params::HEURISTICS::GINS::USEDECOMPROLLHORIZON { "heuristics/gins/usedecomprollhorizon" }
constexpr

should user decompositions be considered for initial selection in rolling horizon, if available?

Definition at line 3217 of file parameters.hpp.

◆ USELPROWS

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

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

Definition at line 3194 of file parameters.hpp.

◆ USEROLLINGHORIZON

Param<bool> scippp::params::HEURISTICS::GINS::USEROLLINGHORIZON { "heuristics/gins/userollinghorizon" }
constexpr

should the heuristic solve a sequence of sub-MIP's around the first selected variable

Definition at line 3207 of file parameters.hpp.

◆ USESELFALLBACK

Param<bool> scippp::params::HEURISTICS::GINS::USESELFALLBACK { "heuristics/gins/useselfallback" }
constexpr

should random initial variable selection be used if decomposition was not successful?

Definition at line 3219 of file parameters.hpp.