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

Parameters with prefix heuristics/lpface. More...

Variables

constexpr Param< bool > COPYCUTS { "heuristics/lpface/copycuts" }
 if uselprows == FALSE, should all active cuts from cutpool be copied to constraints in subproblem?
 
constexpr Param< bool > DUALBASISEQUATIONS { "heuristics/lpface/dualbasisequations" }
 should dually nonbasic rows be turned into equations?
 
constexpr Param< int > FREQ { "heuristics/lpface/freq" }
 frequency for calling primal heuristic <lpface> (-1: never, 0: only at depth freqofs)
 
constexpr Param< int > FREQOFS { "heuristics/lpface/freqofs" }
 frequency offset for calling primal heuristic <lpface>
 
constexpr Param< bool > KEEPSUBSCIP { "heuristics/lpface/keepsubscip" }
 should the heuristic continue solving the same sub-SCIP?
 
constexpr Param< double > LPLIMFAC { "heuristics/lpface/lplimfac" }
 factor by which the limit on the number of LP depends on the node limit
 
constexpr Param< int > MAXDEPTH { "heuristics/lpface/maxdepth" }
 maximal depth level to call primal heuristic <lpface> (-1: no limit)
 
constexpr Param< long long > MAXNODES { "heuristics/lpface/maxnodes" }
 maximum number of nodes to regard in the subproblem
 
constexpr Param< double > MINFIXINGRATE { "heuristics/lpface/minfixingrate" }
 required percentage of fixed integer variables in sub-MIP to run
 
constexpr Param< long long > MINNODES { "heuristics/lpface/minnodes" }
 minimum number of nodes required to start the subproblem
 
constexpr Param< int > MINPATHLEN { "heuristics/lpface/minpathlen" }
 the minimum active search tree path length along which lower bound hasn't changed before heuristic becomes active
 
constexpr Param< long long > NODESOFS { "heuristics/lpface/nodesofs" }
 number of nodes added to the contingent of the total nodes
 
constexpr Param< double > NODESQUOT { "heuristics/lpface/nodesquot" }
 contingent of sub problem nodes in relation to the number of nodes of the original problem
 
constexpr Param< int > PRIORITY { "heuristics/lpface/priority" }
 priority of heuristic <lpface>
 
constexpr Param< char > SUBSCIPOBJECTIVE { "heuristics/lpface/subscipobjective" }
 objective function in the sub-SCIP: (z)ero, (r)oot-LP-difference, (i)nference, LP (f)ractionality, (o)riginal
 
constexpr Param< bool > USELPROWS { "heuristics/lpface/uselprows" }
 should subproblem be created out of the rows in the LP rows?
 

Detailed Description

Parameters with prefix heuristics/lpface.

Variable Documentation

◆ COPYCUTS

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

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

Definition at line 3502 of file parameters.hpp.

◆ DUALBASISEQUATIONS

Param<bool> scippp::params::HEURISTICS::LPFACE::DUALBASISEQUATIONS { "heuristics/lpface/dualbasisequations" }
constexpr

should dually nonbasic rows be turned into equations?

Definition at line 3498 of file parameters.hpp.

◆ FREQ

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

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

Definition at line 3478 of file parameters.hpp.

◆ FREQOFS

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

frequency offset for calling primal heuristic <lpface>

Definition at line 3480 of file parameters.hpp.

◆ KEEPSUBSCIP

Param<bool> scippp::params::HEURISTICS::LPFACE::KEEPSUBSCIP { "heuristics/lpface/keepsubscip" }
constexpr

should the heuristic continue solving the same sub-SCIP?

Definition at line 3500 of file parameters.hpp.

◆ LPLIMFAC

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

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

Definition at line 3494 of file parameters.hpp.

◆ MAXDEPTH

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

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

Definition at line 3482 of file parameters.hpp.

◆ MAXNODES

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

maximum number of nodes to regard in the subproblem

Definition at line 3486 of file parameters.hpp.

◆ MINFIXINGRATE

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

required percentage of fixed integer variables in sub-MIP to run

Definition at line 3492 of file parameters.hpp.

◆ MINNODES

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

minimum number of nodes required to start the subproblem

Definition at line 3488 of file parameters.hpp.

◆ MINPATHLEN

Param<int> scippp::params::HEURISTICS::LPFACE::MINPATHLEN { "heuristics/lpface/minpathlen" }
constexpr

the minimum active search tree path length along which lower bound hasn't changed before heuristic becomes active

Definition at line 3507 of file parameters.hpp.

◆ NODESOFS

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

number of nodes added to the contingent of the total nodes

Definition at line 3484 of file parameters.hpp.

◆ NODESQUOT

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

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

Definition at line 3490 of file parameters.hpp.

◆ PRIORITY

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

priority of heuristic <lpface>

Definition at line 3476 of file parameters.hpp.

◆ SUBSCIPOBJECTIVE

Param<char> scippp::params::HEURISTICS::LPFACE::SUBSCIPOBJECTIVE { "heuristics/lpface/subscipobjective" }
constexpr

objective function in the sub-SCIP: (z)ero, (r)oot-LP-difference, (i)nference, LP (f)ractionality, (o)riginal

Definition at line 3504 of file parameters.hpp.

◆ USELPROWS

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

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

Definition at line 3496 of file parameters.hpp.