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

Parameters with prefix heuristics/locks. More...

Variables

constexpr Param< bool > COPYCUTS { "heuristics/locks/copycuts" }
 should all active cuts from cutpool be copied to constraints in subproblem?
 
constexpr Param< int > FREQ { "heuristics/locks/freq" }
 frequency for calling primal heuristic <locks> (-1: never, 0: only at depth freqofs)
 
constexpr Param< int > FREQOFS { "heuristics/locks/freqofs" }
 frequency offset for calling primal heuristic <locks>
 
constexpr Param< int > MAXDEPTH { "heuristics/locks/maxdepth" }
 maximal depth level to call primal heuristic <locks> (-1: no limit)
 
constexpr Param< long long > MAXNODES { "heuristics/locks/maxnodes" }
 maximum number of nodes to regard in the subproblem
 
constexpr Param< int > MAXPROPROUNDS { "heuristics/locks/maxproprounds" }
 maximum number of propagation rounds to be performed in each propagation call (-1: no limit, -2: parameter settings)
 
constexpr Param< double > MINFIXINGRATE { "heuristics/locks/minfixingrate" }
 minimum percentage of integer variables that have to be fixable
 
constexpr Param< double > MINFIXINGRATELP { "heuristics/locks/minfixingratelp" }
 minimum fixing rate over all variables (including continuous) to solve LP
 
constexpr Param< double > MINIMPROVE { "heuristics/locks/minimprove" }
 factor by which locks heuristic should at least improve the incumbent
 
constexpr Param< long long > MINNODES { "heuristics/locks/minnodes" }
 minimum number of nodes required to start the subproblem
 
constexpr Param< long long > NODESOFS { "heuristics/locks/nodesofs" }
 number of nodes added to the contingent of the total nodes
 
constexpr Param< double > NODESQUOT { "heuristics/locks/nodesquot" }
 contingent of sub problem nodes in relation to the number of nodes of the original problem
 
constexpr Param< int > PRIORITY { "heuristics/locks/priority" }
 priority of heuristic <locks>
 
constexpr Param< double > ROUNDUPPROBABILITY { "heuristics/locks/roundupprobability" }
 probability for rounding a variable up in case of ties
 
constexpr Param< bool > UPDATELOCKS { "heuristics/locks/updatelocks" }
 should the locks be updated based on LP rows?
 
constexpr Param< bool > USEFINALSUBMIP { "heuristics/locks/usefinalsubmip" }
 should a final sub-MIP be solved to costruct a feasible solution if the LP was not roundable?
 

Detailed Description

Parameters with prefix heuristics/locks.

Variable Documentation

◆ COPYCUTS

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

should all active cuts from cutpool be copied to constraints in subproblem?

Definition at line 3467 of file parameters.hpp.

◆ FREQ

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

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

Definition at line 3442 of file parameters.hpp.

◆ FREQOFS

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

frequency offset for calling primal heuristic <locks>

Definition at line 3444 of file parameters.hpp.

◆ MAXDEPTH

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

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

Definition at line 3446 of file parameters.hpp.

◆ MAXNODES

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

maximum number of nodes to regard in the subproblem

Definition at line 3457 of file parameters.hpp.

◆ MAXPROPROUNDS

Param<int> scippp::params::HEURISTICS::LOCKS::MAXPROPROUNDS { "heuristics/locks/maxproprounds" }
constexpr

maximum number of propagation rounds to be performed in each propagation call (-1: no limit, -2: parameter settings)

Definition at line 3449 of file parameters.hpp.

◆ MINFIXINGRATE

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

minimum percentage of integer variables that have to be fixable

Definition at line 3451 of file parameters.hpp.

◆ MINFIXINGRATELP

Param<double> scippp::params::HEURISTICS::LOCKS::MINFIXINGRATELP { "heuristics/locks/minfixingratelp" }
constexpr

minimum fixing rate over all variables (including continuous) to solve LP

Definition at line 3471 of file parameters.hpp.

◆ MINIMPROVE

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

factor by which locks heuristic should at least improve the incumbent

Definition at line 3465 of file parameters.hpp.

◆ MINNODES

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

minimum number of nodes required to start the subproblem

Definition at line 3461 of file parameters.hpp.

◆ NODESOFS

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

number of nodes added to the contingent of the total nodes

Definition at line 3459 of file parameters.hpp.

◆ NODESQUOT

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

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

Definition at line 3463 of file parameters.hpp.

◆ PRIORITY

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

priority of heuristic <locks>

Definition at line 3440 of file parameters.hpp.

◆ ROUNDUPPROBABILITY

Param<double> scippp::params::HEURISTICS::LOCKS::ROUNDUPPROBABILITY { "heuristics/locks/roundupprobability" }
constexpr

probability for rounding a variable up in case of ties

Definition at line 3453 of file parameters.hpp.

◆ UPDATELOCKS

Param<bool> scippp::params::HEURISTICS::LOCKS::UPDATELOCKS { "heuristics/locks/updatelocks" }
constexpr

should the locks be updated based on LP rows?

Definition at line 3469 of file parameters.hpp.

◆ USEFINALSUBMIP

Param<bool> scippp::params::HEURISTICS::LOCKS::USEFINALSUBMIP { "heuristics/locks/usefinalsubmip" }
constexpr

should a final sub-MIP be solved to costruct a feasible solution if the LP was not roundable?

Definition at line 3455 of file parameters.hpp.