3#include "scippp/param.hpp"
22namespace BENDERS::DEFAULT {
76namespace BENDERS::DEFAULT::BENDERSCUT::FEAS {
83namespace BENDERS::DEFAULT::BENDERSCUT::FEASALT {
90namespace BENDERS::DEFAULT::BENDERSCUT::INTEGER {
101namespace BENDERS::DEFAULT::BENDERSCUT::NOGOOD {
110namespace BENDERS::DEFAULT::BENDERSCUT::OPTIMALITY {
156namespace BRANCHING::ALLFULLSTRONG {
166namespace BRANCHING::CLOUD {
190namespace BRANCHING::DISTRIBUTION {
207namespace BRANCHING::FULLSTRONG {
227namespace BRANCHING::INFERENCE {
253namespace BRANCHING::LEASTINF {
263namespace BRANCHING::LOOKAHEAD {
346namespace BRANCHING::MOSTINF {
356namespace BRANCHING::MULTAGGR {
374namespace BRANCHING::NODEREOPT {
384namespace BRANCHING::PSCOST {
411namespace BRANCHING::RANDOM {
423namespace BRANCHING::RELPSCOST {
502namespace BRANCHING::TREEMODEL {
528namespace BRANCHING::VANILLAFULLSTRONG {
549namespace COMPRESSION {
554namespace COMPRESSION::LARGESTREPR {
565namespace COMPRESSION::WEAKCOMPR {
574namespace CONCURRENT {
589namespace CONCURRENT::SCIP {
594namespace CONCURRENT::SCIP_COUNTER {
599namespace CONCURRENT::SCIP_CPSOLVER {
604namespace CONCURRENT::SCIP_DEFAULT {
609namespace CONCURRENT::SCIP_EASYCIP {
614namespace CONCURRENT::SCIP_FEAS {
619namespace CONCURRENT::SCIP_HARDLP {
624namespace CONCURRENT::SCIP_OPTI {
629namespace CONCURRENT::SYNC {
744namespace CONFLICT::BOUNDDISJUNCTION {
751namespace CONFLICT::GRAPH {
756namespace CONFLICT::INDICATORCONFLICT {
761namespace CONFLICT::LINEAR {
766namespace CONFLICT::LOGICOR {
771namespace CONFLICT::SETPPC {
776namespace CONSTRAINTS {
785namespace CONSTRAINTS::AND {
819namespace CONSTRAINTS::BENDERS {
841namespace CONSTRAINTS::BENDERSLP {
873namespace CONSTRAINTS::BOUNDDISJUNCTION {
893namespace CONSTRAINTS::CARDINALITY {
920namespace CONSTRAINTS::COMPONENTS {
954namespace CONSTRAINTS::CONJUNCTION {
974namespace CONSTRAINTS::COUNTSOLS {
1004namespace CONSTRAINTS::CUMULATIVE {
1066namespace CONSTRAINTS::DISJUNCTION {
1088namespace CONSTRAINTS::INDICATOR {
1171namespace CONSTRAINTS::INTEGRAL {
1191namespace CONSTRAINTS::KNAPSACK {
1251namespace CONSTRAINTS::LINEAR {
1339namespace CONSTRAINTS::LINEAR::UPGRADE {
1354namespace CONSTRAINTS::LINKING {
1376namespace CONSTRAINTS::LOGICOR {
1408namespace CONSTRAINTS::NONLINEAR {
1488namespace CONSTRAINTS::NONLINEAR::BRANCHING {
1520namespace CONSTRAINTS::NONLINEAR::UPGRADE {
1527namespace CONSTRAINTS::OR {
1547namespace CONSTRAINTS::ORBISACK {
1577namespace CONSTRAINTS::ORBITOPE {
1603namespace CONSTRAINTS::PSEUDOBOOLEAN {
1633namespace CONSTRAINTS::SETPPC {
1670namespace CONSTRAINTS::SOS1 {
1763namespace CONSTRAINTS::SOS2 {
1783namespace CONSTRAINTS::SUPERINDICATOR {
1812namespace CONSTRAINTS::SYMRESACK {
1838namespace CONSTRAINTS::VARBOUND {
1864namespace CONSTRAINTS::XOR {
1896namespace CUTSELECTION::HYBRID {
1913namespace DECOMPOSITION {
1941namespace DISPLAY::AVGDUALBOUND {
1946namespace DISPLAY::COMPLETED {
1951namespace DISPLAY::CONCDUALBOUND {
1956namespace DISPLAY::CONCGAP {
1961namespace DISPLAY::CONCMEMUSED {
1966namespace DISPLAY::CONCPRIMALBOUND {
1971namespace DISPLAY::CONCSOLFOUND {
1976namespace DISPLAY::CONFLICTS {
1981namespace DISPLAY::CONSS {
1986namespace DISPLAY::CURCOLS {
1991namespace DISPLAY::CURCONSS {
1996namespace DISPLAY::CURDUALBOUND {
2001namespace DISPLAY::CURROWS {
2006namespace DISPLAY::CUTOFFBOUND {
2011namespace DISPLAY::CUTS {
2016namespace DISPLAY::DEPTH {
2021namespace DISPLAY::DUALBOUND {
2026namespace DISPLAY::ESTIMATE {
2031namespace DISPLAY::FEASST {
2036namespace DISPLAY::GAP {
2041namespace DISPLAY::LPAVGITERATIONS {
2046namespace DISPLAY::LPCOND {
2051namespace DISPLAY::LPITERATIONS {
2056namespace DISPLAY::LPOBJ {
2061namespace DISPLAY::MAXDEPTH {
2066namespace DISPLAY::MEMTOTAL {
2071namespace DISPLAY::MEMUSED {
2076namespace DISPLAY::NEXTERNBRANCHCANDS {
2081namespace DISPLAY::NFRAC {
2086namespace DISPLAY::NINFEASLEAVES {
2091namespace DISPLAY::NNODES {
2096namespace DISPLAY::NNODESBELOWINC {
2101namespace DISPLAY::NOBJLEAVES {
2106namespace DISPLAY::NODESLEFT {
2111namespace DISPLAY::NRANK1NODES {
2116namespace DISPLAY::NSOLS {
2121namespace DISPLAY::PLUNGEDEPTH {
2126namespace DISPLAY::POOLSIZE {
2131namespace DISPLAY::PRIMALBOUND {
2136namespace DISPLAY::PRIMALGAP {
2141namespace DISPLAY::PSEUDOOBJ {
2146namespace DISPLAY::SEPAROUNDS {
2151namespace DISPLAY::SOLFOUND {
2156namespace DISPLAY::SOLS {
2161namespace DISPLAY::STRONGBRANCHS {
2166namespace DISPLAY::TIME {
2171namespace DISPLAY::VARS {
2176namespace ESTIMATION {
2197namespace ESTIMATION::RESTARTS {
2216namespace ESTIMATION::SSG {
2223namespace ESTIMATION::TREEPROFILE {
2230namespace EXPR::LOG {
2235namespace EXPR::POW {
2240namespace HEURISTICS {
2245namespace HEURISTICS::ACTCONSDIVING {
2283namespace HEURISTICS::ADAPTIVEDIVING {
2311namespace HEURISTICS::ALNS {
2401namespace HEURISTICS::ALNS::CROSSOVER {
2414namespace HEURISTICS::ALNS::DINS {
2427namespace HEURISTICS::ALNS::LOCALBRANCHING {
2438namespace HEURISTICS::ALNS::MUTATION {
2449namespace HEURISTICS::ALNS::PROXIMITY {
2460namespace HEURISTICS::ALNS::RENS {
2471namespace HEURISTICS::ALNS::RINS {
2482namespace HEURISTICS::ALNS::TRUSTREGION {
2495namespace HEURISTICS::ALNS::ZEROOBJECTIVE {
2506namespace HEURISTICS::BOUND {
2523namespace HEURISTICS::CLIQUE {
2556namespace HEURISTICS::COEFDIVING {
2594namespace HEURISTICS::COMPLETESOL {
2638namespace HEURISTICS::CONFLICTDIVING {
2684namespace HEURISTICS::CROSSOVER {
2727namespace HEURISTICS::DINS {
2766namespace HEURISTICS::DISTRIBUTIONDIVING {
2807namespace HEURISTICS::DPS {
2828namespace HEURISTICS::DUALVAL {
2867namespace HEURISTICS::FARKASDIVING {
2917namespace HEURISTICS::FEASPUMP {
2962namespace HEURISTICS::FIXANDINFER {
2977namespace HEURISTICS::FRACDIVING {
3015namespace HEURISTICS::GINS {
3069namespace HEURISTICS::GUIDEDDIVING {
3107namespace HEURISTICS::INDICATOR {
3122namespace HEURISTICS::INTDIVING {
3153namespace HEURISTICS::INTSHIFTING {
3164namespace HEURISTICS::LINESEARCHDIVING {
3202namespace HEURISTICS::LOCALBRANCHING {
3235namespace HEURISTICS::LOCKS {
3271namespace HEURISTICS::LPFACE {
3307namespace HEURISTICS::MPEC {
3336namespace HEURISTICS::MULTISTART {
3365namespace HEURISTICS::MUTATION {
3398namespace HEURISTICS::NLPDIVING {
3450namespace HEURISTICS::OBJPSCOSTDIVING {
3475namespace HEURISTICS::OCTANE {
3502namespace HEURISTICS::OFINS {
3533namespace HEURISTICS::ONEOPT {
3554namespace HEURISTICS::PADM {
3587namespace HEURISTICS::PROXIMITY {
3628namespace HEURISTICS::PSCOSTDIVING {
3666namespace HEURISTICS::RANDROUNDING {
3685namespace HEURISTICS::RENS {
3729namespace HEURISTICS::REOPTSOLS {
3744namespace HEURISTICS::REPAIR {
3778namespace HEURISTICS::RINS {
3811namespace HEURISTICS::ROOTSOLDIVING {
3838namespace HEURISTICS::ROUNDING {
3854namespace HEURISTICS::SHIFTANDPROPAGATE {
3903namespace HEURISTICS::SHIFTING {
3914namespace HEURISTICS::SIMPLEROUNDING {
3927namespace HEURISTICS::SUBNLP {
3971namespace HEURISTICS::TRIVIAL {
3982namespace HEURISTICS::TRIVIALNEGATION {
3993namespace HEURISTICS::TRUSTREGION {
4028namespace HEURISTICS::TRYSOL {
4039namespace HEURISTICS::TWOOPT {
4058namespace HEURISTICS::UNDERCOVER {
4125namespace HEURISTICS::VBOUNDS {
4164namespace HEURISTICS::VECLENDIVING {
4202namespace HEURISTICS::ZEROOBJ {
4231namespace HEURISTICS::ZIROUNDING {
4442namespace NLHDLR::BILINEAR {
4457namespace NLHDLR::CONCAVE {
4472namespace NLHDLR::CONVEX {
4489namespace NLHDLR::DEFAULT {
4494namespace NLHDLR::PERSPECTIVE {
4515namespace NLHDLR::QUADRATIC {
4545namespace NLHDLR::QUOTIENT {
4550namespace NLHDLR::SOC {
4566namespace NODESELECTION {
4572namespace NODESELECTION::BFS {
4585namespace NODESELECTION::BREADTHFIRST {
4592namespace NODESELECTION::DFS {
4599namespace NODESELECTION::ESTIMATE {
4618namespace NODESELECTION::HYBRIDESTIM {
4635namespace NODESELECTION::RESTARTDFS {
4646namespace NODESELECTION::UCT {
4698namespace PRESOLVING {
4724namespace PRESOLVING::BOUNDSHIFT {
4739namespace PRESOLVING::CONVERTINTTOBIN {
4755namespace PRESOLVING::DOMCOL {
4772namespace PRESOLVING::DUALAGG {
4781namespace PRESOLVING::DUALCOMP {
4792namespace PRESOLVING::DUALINFER {
4817namespace PRESOLVING::DUALSPARSIFY {
4846namespace PRESOLVING::GATEEXTRACTION {
4863namespace PRESOLVING::IMPLICS {
4872namespace PRESOLVING::INTTOBINARY {
4881namespace PRESOLVING::QPKKTREF {
4897namespace PRESOLVING::REDVUB {
4906namespace PRESOLVING::SPARSIFY {
4937namespace PRESOLVING::STUFFING {
4946namespace PRESOLVING::TRIVIAL {
4955namespace PRESOLVING::TWOROWBND {
4991namespace PROPAGATING {
5001namespace PROPAGATING::DUALFIX {
5018namespace PROPAGATING::GENVBOUNDS {
5043namespace PROPAGATING::NLOBBT {
5078namespace PROPAGATING::OBBT {
5145namespace PROPAGATING::PROBING {
5177namespace PROPAGATING::PSEUDOOBJ {
5212namespace PROPAGATING::REDCOST {
5235namespace PROPAGATING::ROOTREDCOST {
5256namespace PROPAGATING::SYMMETRY {
5333namespace PROPAGATING::VBOUNDS {
5370namespace RANDOMIZATION {
5394namespace READING::BNDREADER {
5399namespace READING::CIPREADER {
5404namespace READING::CNFREADER {
5409namespace READING::GMSREADER {
5422namespace READING::LPREADER {
5429namespace READING::MPSREADER {
5436namespace READING::OPBREADER {
5443namespace READING::PBMREADER {
5452namespace READING::PPMREADER {
5463namespace READING::STOREADER {
5468namespace REOPTIMIZATION {
5517namespace REOPTIMIZATION::GLOBALCONS {
5522namespace SEPARATING {
5575namespace SEPARATING::AGGREGATION {
5637namespace SEPARATING::CGMIP {
5728namespace SEPARATING::CLIQUE {
5757namespace SEPARATING::CLOSECUTS {
5787namespace SEPARATING::CMIR {
5802namespace SEPARATING::CONVEXPROJ {
5821namespace SEPARATING::DISJUNCTIVE {
5856namespace SEPARATING::ECCUTS {
5895namespace SEPARATING::FLOWCOVER {
5910namespace SEPARATING::GAUGE {
5927namespace SEPARATING::GOMORY {
5972namespace SEPARATING::GOMORYMI {
5987namespace SEPARATING::IMPLIEDBOUNDS {
6004namespace SEPARATING::INTERMINOR {
6029namespace SEPARATING::INTOBJ {
6044namespace SEPARATING::KNAPSACKCOVER {
6059namespace SEPARATING::MCF {
6104namespace SEPARATING::MINOR {
6131namespace SEPARATING::MIXING {
6156namespace SEPARATING::ODDCYCLE {
6224namespace SEPARATING::RAPIDLEARNING {
6290namespace SEPARATING::RLT {
6346namespace SEPARATING::STRONGCG {
6361namespace SEPARATING::ZEROHALF {
6415namespace SOLVINGPHASES {
6446namespace TABLE::BENDERS {
6451namespace TABLE::BRANCHRULES {
6456namespace TABLE::COMPRESSION {
6461namespace TABLE::CONCURRENTSOLVER {
6466namespace TABLE::CONFLICT {
6471namespace TABLE::CONSTIMING {
6476namespace TABLE::CONSTRAINT {
6481namespace TABLE::CONS_NONLINEAR {
6486namespace TABLE::CUTSEL {
6491namespace TABLE::ESTIM {
6496namespace TABLE::EXPRHDLR {
6501namespace TABLE::HEURISTICS {
6506namespace TABLE::LP {
6511namespace TABLE::NEIGHBORHOOD {
6516namespace TABLE::NLHDLR {
6521namespace TABLE::NLHDLR_BILINEAR {
6526namespace TABLE::NLHDLR_QUADRATIC {
6531namespace TABLE::NLP {
6536namespace TABLE::NLPI {
6541namespace TABLE::ORBITALFIXING {
6546namespace TABLE::ORIGPROB {
6551namespace TABLE::PRESOLVEDPROB {
6556namespace TABLE::PRESOLVER {
6561namespace TABLE::PRICER {
6566namespace TABLE::PROPAGATOR {
6571namespace TABLE::RELAXATOR {
6576namespace TABLE::ROOT {
6581namespace TABLE::SEPARATOR {
6586namespace TABLE::SOLUTION {
6591namespace TABLE::STATUS {
6596namespace TABLE::TIMING {
6601namespace TABLE::TREE {
constexpr Param< int > PRIORITY
priority of Benders' cut <feasalt>
constexpr Param< bool > ENABLED
is this Benders' decomposition cut method used to generate cuts?
constexpr Param< int > PRIORITY
priority of Benders' cut <feas>
constexpr Param< bool > ENABLED
is this Benders' decomposition cut method used to generate cuts?
constexpr Param< bool > ENABLED
is this Benders' decomposition cut method used to generate cuts?
constexpr Param< double > CUTSCONSTANT
the constant term of the integer Benders' cuts.
constexpr Param< bool > ADDCUTS
should cuts be generated and added to the cutpool instead of global constraints directly added to the...
constexpr Param< int > PRIORITY
priority of Benders' cut <integer>
constexpr Param< int > PRIORITY
priority of Benders' cut <nogood>
constexpr Param< bool > ENABLED
is this Benders' decomposition cut method used to generate cuts?
constexpr Param< bool > ADDCUTS
should cuts be generated and added to the cutpool instead of global constraints directly added to the...
constexpr Param< bool > ENABLED
is this Benders' decomposition cut method used to generate cuts?
constexpr Param< int > PRIORITY
priority of Benders' cut <optimality>
constexpr Param< bool > ADDCUTS
should cuts be generated and added to the cutpool instead of global constraints directly added to the...
constexpr Param< bool > MIR
should the mixed integer rounding procedure be applied to cuts
constexpr Param< bool > CUTCHECK
should Benders' cuts be generated while checking solutions?
constexpr Param< int > PRIORITY
priority of Benders' decomposition <default>
constexpr Param< bool > CUTPSEUDO
should Benders' cuts be generated for pseudo solutions?
constexpr Param< double > MAXSLACKVARCOEF
the maximal objective coefficient of the slack variables in the subproblem
constexpr Param< char > CUTSTRENGTHENINTPOINT
where should the strengthening interior point be sourced from ('l'p relaxation, 'f'irst solution,...
constexpr Param< bool > CUTLP
should Benders' cuts be generated for LP solutions?
constexpr Param< bool > LNSCHECK
should Benders' decomposition be used in LNS heurisics?
constexpr Param< bool > AUXVARSIMPLINT
if the subproblem objective is integer, then define the auxiliary variables as implied integers?
constexpr Param< int > NUMTHREADS
the number of threads to use when solving the subproblems
constexpr Param< double > COREPOINTPERTURB
the constant use to perturb the cut strengthening core point
constexpr Param< int > LNSMAXCALLS
the maximum number of Benders' decomposition calls in LNS heuristics (-1: no limit)
constexpr Param< bool > CHECKCONSCONVEXITY
should the constraints of the subproblems be checked for convexity?
constexpr Param< bool > EXECFEASPHASE
should a feasibility phase be executed during the root node, i.e.
constexpr Param< bool > TRANSFERCUTS
should Benders' cuts from LNS heuristics be transferred to the main SCIP instance?
constexpr Param< double > CUTSTRENGTHENMULT
the convex combination multiplier for the cut strengthening
constexpr Param< bool > CUTRELAX
should Benders' cuts be generated for relaxation solutions?
constexpr Param< bool > CUTSTRENGTHENENABLED
should the core point cut strengthening be employed (only applied to fractional solutions or continuo...
constexpr Param< int > LNSMAXCALLSROOT
the maximum number of root node Benders' decomposition calls in LNS heuristics (-1: no limit)
constexpr Param< int > NOIMPROVELIMIT
the maximum number of cut strengthening without improvement
constexpr Param< bool > CUTSASCONSS
should the transferred cuts be added as constraints?
constexpr Param< bool > UPDATEAUXVARBOUND
should the auxiliary variable bound be updated by solving the subproblem?
constexpr Param< int > LNSMAXDEPTH
maximum depth at which the LNS check is performed (-1: no limit)
constexpr Param< double > SLACKVARCOEF
the initial objective coefficient of the slack variables in the subproblem
constexpr Param< double > SUBPROBFRAC
fraction of subproblems that are solved in each iteration
constexpr Param< bool > COPYBENDERS
should Benders' decomposition be copied for use in sub-SCIPs?
constexpr Param< bool > CUTLPSOL
should Benders' cuts be generated from the solution to the LP relaxation?
constexpr Param< double > SOLUTIONTOL
the tolerance used for checking optimality in Benders' decomposition.
constexpr Param< int > MAXDEPTH
maximal depth level, up to which branching rule <allfullstrong> should be used (-1 for no limit)
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< int > PRIORITY
priority of branching rule <allfullstrong>
constexpr Param< double > MINSUCCESSRATE
minimum success rate for the cloud
constexpr Param< bool > USECLOUD
should a cloud of points be used?
constexpr Param< double > MINSUCCESSUNION
minimum success rate for the union
constexpr Param< int > PRIORITY
priority of branching rule <cloud>
constexpr Param< bool > ONLYF2
should only F2 be used?
constexpr Param< bool > USEUNION
should the union of candidates be used?
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< int > MAXPOINTS
maximum number of points for the cloud (-1 means no limit)
constexpr Param< int > MAXDEPTHUNION
maximum depth for the union
constexpr Param< int > MAXDEPTH
maximal depth level, up to which branching rule <cloud> should be used (-1 for no limit)
constexpr Param< int > PRIORITY
priority of branching rule <distribution>
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< char > SCOREPARAM
the score;largest 'd'ifference, 'l'owest cumulative probability,'h'ighest c.p., 'v'otes lowest c....
constexpr Param< int > MAXDEPTH
maximal depth level, up to which branching rule <distribution> should be used (-1 for no limit)
constexpr Param< bool > WEIGHTEDSCORE
should the branching score weigh up- and down-scores of a variable
constexpr Param< bool > ONLYACTIVEROWS
should only rows which are active at the current node be considered?
constexpr Param< bool > PROBINGBOUNDS
should valid bounds be identified in a probing-like fashion during strong branching (only with propag...
constexpr Param< int > MAXPROPROUNDS
maximum number of propagation rounds to be performed during strong branching before solving the LP (-...
constexpr Param< int > MAXDEPTH
maximal depth level, up to which branching rule <fullstrong> should be used (-1 for no limit)
constexpr Param< int > PRIORITY
priority of branching rule <fullstrong>
constexpr Param< bool > FORCESTRONGBRANCH
should strong branching be applied even if there is just a single candidate?
constexpr Param< long long > REEVALAGE
number of intermediate LPs solved to trigger reevaluation of strong branching value for a variable th...
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< double > CUTOFFWEIGHT
weight in score calculations for cutoff score
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< double > RELIABLESCORE
weight in score calculations for conflict score
constexpr Param< double > INFERENCEWEIGHT
weight in score calculations for inference score
constexpr Param< bool > FRACTIONALS
should branching on LP solution be restricted to the fractional variables?
constexpr Param< int > MAXDEPTH
maximal depth level, up to which branching rule <inference> should be used (-1 for no limit)
constexpr Param< int > CONFLICTPRIO
priority value for using conflict weights in lex. order
constexpr Param< int > PRIORITY
priority of branching rule <inference>
constexpr Param< int > CUTOFFPRIO
priority value for using cutoff weights in lex. order
constexpr Param< double > CONFLICTWEIGHT
weight in score calculations for conflict score
constexpr Param< bool > USEWEIGHTEDSUM
should a weighted sum of inference, conflict and cutoff weights be used?
constexpr Param< int > MAXDEPTH
maximal depth level, up to which branching rule <leastinf> should be used (-1 for no limit)
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< int > PRIORITY
priority of branching rule <leastinf>
constexpr Param< int > MAXDEPTH
maximal depth level, up to which branching rule <lookahead> should be used (-1 for no limit)
constexpr Param< bool > LEVEL2ZEROSCORE
should uninitialized scores in level 2 be set to 0?
constexpr Param< int > ADDBINCONSROW
should binary constraints be added as rows to the base LP? (0: no, 1: separate, 2: as initial rows)
constexpr Param< bool > LEVEL2AVGSCORE
should the average score be used for uninitialized scores in level 2?
constexpr Param< bool > REUSEBASIS
if abbreviated: Should the information gathered to obtain the best candidates be reused?
constexpr Param< bool > APPLYCHILDBOUNDS
should bounds known for child nodes be applied?
constexpr Param< bool > ABBREVIATED
toggles the abbreviated LAB.
constexpr Param< double > MINWEIGHT
if scoringfunction is 's', this value is used to weight the min of the gains of two child problems in...
constexpr Param< int > MAXNDEEPERCANDS
if abbreviated: The max number of candidates to consider per deeper node.
constexpr Param< long long > REEVALAGE
max number of LPs solved after which a previous prob branching results are recalculated
constexpr Param< int > MAXPROPROUNDS
maximum number of propagation rounds to perform at each temporary node (-1: unlimited,...
constexpr Param< bool > FILTERBYMAXGAIN
should lookahead branching only be applied if the max gain in level 1 is not uniquely that of the bes...
constexpr Param< bool > PROPAGATE
should domain propagation be executed before each temporary node is solved?
constexpr Param< bool > ADDNONVIOCONS
should binary constraints, that are not violated by the base LP, be collected and added?
constexpr Param< bool > STOREUNVIOLATEDSOL
if only non violating constraints are added, should the branching decision be stored till the next ca...
constexpr Param< bool > USEIMPLIEDBINCONS
should binary constraints be collected and applied?
constexpr Param< bool > MERGEDOMAINREDUCTIONS
should domain reductions of feasible siblings should be merged?
constexpr Param< bool > ADDCLIQUE
add binary constraints with two variables found at the root node also as a clique
constexpr Param< char > SCORINGFUNCTION
scoring function to be used at the base level
constexpr Param< int > MAXNVIOLATEDCONS
how many constraints that are violated by the base lp solution should be gathered until the rule is s...
constexpr Param< bool > USEDOMAINREDUCTION
should domain reductions be collected and applied?
constexpr Param< bool > UPDATEBRANCHINGRESULTS
should branching results (and scores) be updated w.r.t. proven dual bounds?
constexpr Param< bool > PREFERSIMPLEBOUNDS
should domain reductions only be applied if there are simple bound changes?
constexpr Param< char > DEEPERSCORINGFUNCTION
scoring function to be used at deeper levels
constexpr Param< bool > USELEVEL2DATA
should branching data generated at depth level 2 be stored for re-using it?
constexpr Param< int > MAXNCANDS
if abbreviated: The max number of candidates to consider at the node.
constexpr Param< bool > ENFORCEMAXDOMREDS
should the maximum number of domain reductions maxnviolateddomreds be enforced?
constexpr Param< int > MAXNVIOLATEDDOMREDS
how many domain reductions that are violated by the base lp solution should be gathered until the rul...
constexpr Param< bool > ONLYVIOLDOMREDS
should only domain reductions that violate the LP solution be applied?
constexpr Param< int > PRIORITY
priority of branching rule <lookahead>
constexpr Param< int > RECURSIONDEPTH
the max depth of LAB.
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< long long > REEVALAGEFSB
max number of LPs solved after which a previous FSB scoring results are recalculated
constexpr Param< double > WORSEFACTOR
if the FSB score is of a candidate is worse than the best by this factor, skip this candidate (-1: di...
constexpr Param< bool > ABBREVPSEUDO
if abbreviated: Use pseudo costs to estimate the score of a candidate.
constexpr Param< int > MAXNVIOLATEDBINCONS
how many binary constraints that are violated by the base lp solution should be gathered until the ru...
constexpr Param< char > SCORINGSCORINGFUNCTION
scoring function to be used during FSB scoring
constexpr Param< int > MAXDEPTH
maximal depth level, up to which branching rule <mostinf> should be used (-1 for no limit)
constexpr Param< int > PRIORITY
priority of branching rule <mostinf>
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< long long > REEVALAGE
number of intermediate LPs solved to trigger reevaluation of strong branching value for a variable th...
constexpr Param< int > MAXPROPROUNDS
maximum number of propagation rounds to be performed during multaggr branching before solving the LP ...
constexpr Param< int > PRIORITY
priority of branching rule <multaggr>
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< bool > PROBINGBOUNDS
should valid bounds be identified in a probing-like fashion during multaggr branching (only with prop...
constexpr Param< int > MAXDEPTH
maximal depth level, up to which branching rule <multaggr> should be used (-1 for no limit)
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< int > PRIORITY
priority of branching rule <nodereopt>
constexpr Param< int > MAXDEPTH
maximal depth level, up to which branching rule <nodereopt> should be used (-1 for no limit)
constexpr Param< double > MINSCOREWEIGHT
weight for minimum of scores of a branching candidate when building weighted sum of min/max/sum of sc...
constexpr Param< double > NARYMINWIDTH
minimal domain width in children when doing n-ary branching, relative to global bounds
constexpr Param< int > NARYMAXDEPTH
maximal depth where to do n-ary branching, -1 to turn off
constexpr Param< char > STRATEGY
strategy for utilizing pseudo-costs of external branching candidates (multiply as in pseudo costs 'u'...
constexpr Param< double > NARYWIDTHFACTOR
factor of domain width in n-ary branching when creating nodes with increasing distance from branching...
constexpr Param< int > NCHILDREN
number of children to create in n-ary branching
constexpr Param< int > MAXDEPTH
maximal depth level, up to which branching rule <pscost> should be used (-1 for no limit)
constexpr Param< int > PRIORITY
priority of branching rule <pscost>
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< double > SUMSCOREWEIGHT
weight for sum of scores of a branching candidate when building weighted sum of min/max/sum of scores
constexpr Param< double > MAXSCOREWEIGHT
weight for maximum of scores of a branching candidate when building weighted sum of min/max/sum of sc...
constexpr Param< int > SEED
initial random seed value
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< int > MAXDEPTH
maximal depth level, up to which branching rule <random> should be used (-1 for no limit)
constexpr Param< int > PRIORITY
priority of branching rule <random>
constexpr Param< int > MAXPROPROUNDS
maximum number of propagation rounds to be performed during strong branching before solving the LP (-...
constexpr Param< bool > FILTERCANDSSYM
Use symmetry to filter branching candidates?
constexpr Param< int > MAXBDCHGS
maximal number of bound tightenings before the node is reevaluated (-1: unlimited)
constexpr Param< double > SBITERQUOT
maximal fraction of strong branching LP iterations compared to node relaxation LP iterations
constexpr Param< double > LOWERRORTOL
low relative error tolerance for reliability
constexpr Param< int > MAXLOOKAHEAD
maximal number of further variables evaluated without better score
constexpr Param< double > MAXRELIABLE
maximal value for minimum pseudo cost size to regard pseudo cost value as reliable
constexpr Param< bool > TRANSSYMPSCOST
Transfer pscost information to symmetric variables?
constexpr Param< int > CONFIDENCELEVEL
the confidence level for statistical methods, between 0 (Min) and 4 (Max).
constexpr Param< bool > USERELERRORRELIABILITY
should reliability be based on relative errors?
constexpr Param< bool > USESMALLWEIGHTSITLIM
should smaller weights be used for pseudo cost updates after hitting the LP iteration limit?
constexpr Param< int > INITITER
iteration limit for strong branching initializations of pseudo cost entries (0: auto)
constexpr Param< bool > PROBINGBOUNDS
should valid bounds be identified in a probing-like fashion during strong branching (only with propag...
constexpr Param< bool > RANDINITORDER
should candidates be initialized in randomized order?
constexpr Param< int > PRIORITY
priority of branching rule <relpscost>
constexpr Param< double > PSCOSTWEIGHT
weight in score calculations for pseudo cost score
constexpr Param< bool > STORESEMIINITCOSTS
should strong branching result be considered for pseudo costs if the other direction was infeasible?
constexpr Param< double > MINRELIABLE
minimal value for minimum pseudo cost size to regard pseudo cost value as reliable
constexpr Param< int > INITCAND
maximal number of candidates initialized with strong branching per node
constexpr Param< bool > USEDYNAMICCONFIDENCE
should the confidence level be adjusted dynamically?
constexpr Param< bool > USESBLOCALINFO
should the scoring function use only local cutoff and inference information obtained for strong branc...
constexpr Param< double > HIGHERRORTOL
high relative error tolerance for reliability
constexpr Param< int > STARTRANDSEED
start seed for random number generation
constexpr Param< double > CONFLICTWEIGHT
weight in score calculations for conflict score
constexpr Param< int > DEGENERACYAWARE
should degeneracy be taken into account to update weights and skip strong branching?...
constexpr Param< double > NLSCOREWEIGHT
weight in score calculations for nlcount score
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< bool > USEHYPTESTFORRELIABILITY
should the strong branching decision be based on a hypothesis test?
constexpr Param< double > INFERENCEWEIGHT
weight in score calculations for inference score
constexpr Param< int > SBITEROFS
additional number of allowed strong branching LP iterations
constexpr Param< int > MAXDEPTH
maximal depth level, up to which branching rule <relpscost> should be used (-1 for no limit)
constexpr Param< bool > DYNAMICWEIGHTS
should the weights of the branching rule be adjusted dynamically during solving based on objective an...
constexpr Param< double > CONFLICTLENGTHWEIGHT
weight in score calculations for conflict length score
constexpr Param< bool > SKIPBADINITCANDS
should branching rule skip candidates that have a low probability to be better than the best strong-b...
constexpr Param< double > CUTOFFWEIGHT
weight in score calculations for cutoff score
constexpr Param< int > MAXFPITER
maximum number of fixed-point iterations when computing the ratio
constexpr Param< char > FALLBACKINF
which method should be used as a fallback if the tree size estimates are infinite?...
constexpr Param< char > FILTERLOW
should dominated candidates be filtered before using the low scoring function? ('a'uto,...
constexpr Param< bool > ENABLE
should candidate branching variables be scored using the Treemodel branching rules?
constexpr Param< char > FALLBACKNOPRIM
which method should be used as a fallback if there is no primal bound available? ('d'efault,...
constexpr Param< int > MAXSVTSHEIGHT
maximum height to compute the SVTS score exactly before approximating
constexpr Param< char > FILTERHIGH
should dominated candidates be filtered before using the high scoring function? ('a'uto,...
constexpr Param< int > HEIGHT
estimated tree height at which we switch from using the low rule to the high rule
constexpr Param< char > LOWRULE
scoring function to use at nodes predicted to be low in the tree ('d'efault, 's'vts,...
constexpr Param< char > HIGHRULE
scoring function to use at nodes predicted to be high in the tree ('d'efault, 's'vts,...
constexpr Param< double > SMALLPSCOST
threshold at which pseudocosts are considered small, making hybrid scores more likely to be the decid...
constexpr Param< bool > IDEMPOTENT
should strong branching side-effects be prevented (e.g., domain changes, stat updates etc....
constexpr Param< bool > INTEGRALCANDS
should integral variables in the current LP solution be considered as branching candidates?
constexpr Param< bool > DONOTBRANCH
should candidates only be scored, but no branching be performed?
constexpr Param< int > PRIORITY
priority of branching rule <vanillafullstrong>
constexpr Param< int > MAXDEPTH
maximal depth level, up to which branching rule <vanillafullstrong> should be used (-1 for no limit)
constexpr Param< bool > COLLECTSCORES
should strong branching scores be collected?
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< bool > SCOREALL
should strong branching scores be computed for all candidates, or can we early stop when a variable h...
constexpr Param< double > MIDPULLRELDOMTRIG
multiply midpull by relative domain width if the latter is below this value
constexpr Param< bool > CHECKSOL
should LP solutions during strong branching with propagation be checked for feasibility?
constexpr Param< bool > ROUNDSBSOL
should LP solutions during strong branching with propagation be rounded? (only when checksbsol=TRUE)
constexpr Param< bool > PREFERBINARY
should branching on binary variables be preferred?
constexpr Param< char > LPGAINNORMALIZE
strategy for normalization of LP gain when updating pseudocosts of continuous variables (divide by mo...
constexpr Param< bool > SUMADJUSTSCORE
score adjustment near zero by adding epsilon (TRUE) or using maximum (FALSE)
constexpr Param< char > SCOREFUNC
branching score function ('s'um, 'p'roduct, 'q'uotient)
constexpr Param< double > CLAMP
minimal relative distance of branching point to bounds when branching on a continuous variable
constexpr Param< bool > DIVINGPSCOST
should pseudo costs be updated also in diving and probing mode?
constexpr Param< double > MIDPULL
fraction by which to move branching point of a continuous variable towards the middle of the domain; ...
constexpr Param< bool > DELAYPSCOSTUPDATE
should updating pseudo costs for continuous variables be delayed to the time after separation?
constexpr Param< bool > FORCEALLCHILDREN
should all strong branching children be regarded even if one is detected to be infeasible?...
constexpr Param< double > SCOREFAC
branching score factor to weigh downward and upward gain prediction in sum score function
constexpr Param< char > FIRSTSBCHILD
child node to be regarded first during strong branching (only with propagation): 'u'p child,...
constexpr Param< int > MINCOMMONVARS
minimal number of common variables.
constexpr Param< int > PRIORITY
priority of compression <largestrepr>
constexpr Param< int > ITERATIONS
number of runs in the constrained part.
constexpr Param< int > MINNLEAVES
minimal number of leave nodes for calling tree compression <largestrepr>
constexpr Param< int > PRIORITY
priority of compression <weakcompr>
constexpr Param< bool > CONVERTCONSS
convert constraints into nodes
constexpr Param< int > MINNLEAVES
minimal number of leave nodes for calling tree compression <weakcompr>
constexpr Param< bool > ENABLE
should automatic tree compression after the presolving be enabled?
constexpr Param< double > PREFPRIO
the preferred number concurrent solvers of type <scip-counter> with respect to the number of threads
constexpr Param< double > PREFPRIO
the preferred number concurrent solvers of type <scip-cpsolver> with respect to the number of threads
constexpr Param< double > PREFPRIO
the preferred number concurrent solvers of type <scip-default> with respect to the number of threads
constexpr Param< double > PREFPRIO
the preferred number concurrent solvers of type <scip-easycip> with respect to the number of threads
constexpr Param< double > PREFPRIO
the preferred number concurrent solvers of type <scip-feas> with respect to the number of threads
constexpr Param< double > PREFPRIO
the preferred number concurrent solvers of type <scip-hardlp> with respect to the number of threads
constexpr Param< double > PREFPRIO
the preferred number concurrent solvers of type <scip-opti> with respect to the number of threads
constexpr Param< double > PREFPRIO
the preferred number concurrent solvers of type <scip> with respect to the number of threads
constexpr Param< double > MINSYNCDELAY
minimum delay before synchronization data is read
constexpr Param< int > NBESTSOLS
how many of the N best solutions should be considered for synchronization?
constexpr Param< double > FREQMAX
maximal frequency of synchronization with other threads
constexpr Param< int > MAXNSOLS
maximum number of solutions that will be shared in a single synchronization
constexpr Param< double > FREQINIT
initial frequency of synchronization with other threads
constexpr Param< double > FREQFACTOR
factor by which the frequency of synchronization is changed
constexpr Param< double > TARGETPROGRESS
when adapting the synchronization frequency this value is the targeted relative difference by which t...
constexpr Param< int > MAXNSYNCDELAY
maximum number of synchronizations before reading is enforced regardless of delay
constexpr Param< bool > PRESOLVEBEFORE
should the problem be presolved before it is copied to the concurrent solvers?
constexpr Param< bool > CHANGECHILDSEL
use different child selection rules in each concurrent solver?
constexpr Param< bool > COMMVARBNDS
should the concurrent solvers communicate global variable bound changes?
constexpr Param< std::string > PARAMSETPREFIX
path prefix for parameter setting files of concurrent solvers
constexpr Param< bool > CHANGESEEDS
set different random seeds in each concurrent solver?
constexpr Param< int > INITSEED
maximum number of solutions that will be shared in a one synchronization
constexpr Param< double > CONTINUOUSFRAC
maximal percantage of continuous variables within a conflict
constexpr Param< int > PRIORITY
priority of conflict handler <bounddisjunction>
constexpr Param< double > DEPTHSCOREFAC
score factor for depth level in bound relaxation heuristic
constexpr Param< int > PRIORITY
priority of conflict handler <indicatorconflict>
constexpr Param< int > PRIORITY
priority of conflict handler <linear>
constexpr Param< int > PRIORITY
priority of conflict handler <logicor>
constexpr Param< int > PRIORITY
priority of conflict handler <setppc>
constexpr Param< bool > USESB
should infeasible/bound exceeding strong branching conflict analysis be used?
constexpr Param< bool > SEPARATE
should the conflict constraints be separated?
constexpr Param< double > WEIGHTREPROPDEPTH
weight of the repropagation depth of a conflict used in score calculation
constexpr Param< bool > REMOVABLE
should the conflict's relaxations be subject to LP aging and cleanup?
constexpr Param< bool > SETTLELOCAL
should conflict constraints be attached only to the local subtree where they can be useful?
constexpr Param< bool > USEPROP
should propagation conflict analysis be used?
constexpr Param< double > DOWNLOCKSCOREFAC
score factor for down locks in bound relaxation heuristic
constexpr Param< int > MINMAXVARS
minimal absolute maximum of variables involved in a conflict constraint
constexpr Param< int > MAXVARSDETECTIMPLIEDBOUNDS
maximal number of variables to try to detect global bound implications and shorten the whole conflict...
constexpr Param< bool > ALLOWLOCAL
should conflict constraints be generated that are only valid locally?
constexpr Param< double > MAXVARSFAC
maximal fraction of variables involved in a conflict constraint
constexpr Param< bool > SEPAALTPROOFS
apply cut generating functions to construct alternative proofs
constexpr Param< bool > CLEANBOUNDEXCEEDINGS
should conflicts based on an old cutoff bound be removed from the conflict pool after improving the p...
constexpr Param< char > USEBOUNDLP
should bound exceeding LP conflict analysis be used? ('o'ff, 'c'onflict graph, 'd'ual ray,...
constexpr Param< int > MAXCONSS
maximal number of conflict constraints accepted at an infeasible node (-1: use all generated conflict...
constexpr Param< double > CONFLICTWEIGHT
the weight the VSIDS score is weight by updating the VSIDS for a variable if it is part of a conflict
constexpr Param< int > RECONVLEVELS
number of depth levels up to which UIP reconvergence constraints are generated (-1: generate reconver...
constexpr Param< double > WEIGHTVALIDDEPTH
weight of the valid depth of a conflict used in score calculation
constexpr Param< bool > REPROPAGATE
should earlier nodes be repropagated in order to replace branching decisions by deductions?
constexpr Param< bool > IGNORERELAXEDBD
should relaxed bounds be ignored?
constexpr Param< bool > USELOCALROWS
use local rows to construct infeasibility proofs
constexpr Param< int > MAXLPLOOPS
maximal number of LP resolving loops during conflict analysis (-1: no limit)
constexpr Param< int > RESTARTNUM
number of successful conflict analysis calls that trigger a restart (0: disable conflict restarts)
constexpr Param< double > PROOFSCOREFAC
score factor for impact on acticity in bound relaxation heuristic
constexpr Param< char > USEINFLP
should infeasible LP conflict analysis be used? ('o'ff, 'c'onflict graph, 'd'ual ray,...
constexpr Param< double > RESTARTFAC
factor to increase restartnum with after each restart
constexpr Param< bool > PREFERBINARY
should binary conflicts be preferred?
constexpr Param< double > SCOREFAC
factor to decrease importance of variables' earlier conflict scores
constexpr Param< int > LPITERATIONS
maximal number of LP iterations in each LP resolving loop (-1: no limit)
constexpr Param< double > WEIGHTSIZE
weight of the size of a conflict used in score calculation
constexpr Param< double > CONFLICTGRAPHWEIGHT
the weight the VSIDS score is weight by updating the VSIDS for a variable if it is part of a conflict...
constexpr Param< bool > DYNAMIC
should the conflict constraints be subject to aging?
constexpr Param< bool > PREFINFPROOF
prefer infeasibility proof to boundexceeding proof
constexpr Param< bool > KEEPREPROP
should constraints be kept for repropagation even if they are too long?
constexpr Param< bool > ENABLE
should conflict analysis be enabled?
constexpr Param< bool > FULLSHORTENCONFLICT
try to shorten the whole conflict set or terminate early (depending on the 'maxvarsdetectimpliedbound...
constexpr Param< bool > USEPSEUDO
should pseudo solution conflict analysis be used?
constexpr Param< double > UPLOCKSCOREFAC
score factor for up locks in bound relaxation heuristic
constexpr Param< int > MAXSTORESIZE
maximal size of conflict store (-1: auto, 0: disable storage)
constexpr Param< double > MINIMPROVE
minimal improvement of primal bound to remove conflicts based on a previous incumbent
constexpr Param< int > INTERCONSS
maximal number of intermediate conflict constraints generated in conflict graph (-1: use every interm...
constexpr Param< int > FUIPLEVELS
number of depth levels up to which first UIP's are used in conflict analysis (-1: use All-FirstUIP ru...
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< bool > PRESOLPAIRWISE
should pairwise constraint comparison be performed in presolving?
constexpr Param< bool > LINEARIZE
should the AND-constraint get linearized and removed (in presolving)?
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< bool > UPGRADERESULTANT
should all binary resultant variables be upgraded to implicit binary variables?
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< bool > PRESOLUSEHASHING
should hash table be used for detecting redundant constraints in advance
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< bool > ENFORCECUTS
should cuts be separated during LP enforcing?
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< bool > DUALPRESOLVING
should dual presolving be performed?
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< bool > AGGRLINEARIZATION
should an aggregated linearization be used?
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< bool > ACTIVE
is the Benders' decomposition constraint handler active?
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< int > MAXDEPTH
depth at which Benders' decomposition cuts are generated from the LP solution (-1: always,...
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< bool > ACTIVE
is the Benders' decomposition LP cut constraint handler active?
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< int > STALLLIMIT
the number of nodes processed without a dual bound improvement before enforcing the LP relaxation,...
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< int > ITERLIMIT
after the root node, only iterlimit fractional LP solutions are used at each node to generate Benders...
constexpr Param< int > DEPTHFREQ
the depth frequency for generating LP cuts after the max depth is reached (0: never,...
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< bool > BRANCHBALANCED
whether to use balanced instead of unbalanced branching
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< double > BALANCEDCUTOFF
determines that balanced branching is only used if the branching cut off value w.r....
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< int > BALANCEDDEPTH
maximum depth for using balanced branching (-1: no limit)
constexpr Param< int > MINSIZE
minimum absolute size (in terms of variables) to solve a component individually during branch-and-bou...
constexpr Param< int > MAXDEPTH
maximum depth of a node to run components detection (-1: disable component detection during solving)
constexpr Param< double > FEASTOLFACTOR
factor to increase the feasibility tolerance of the main SCIP in all sub-SCIPs, default value 1....
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< double > MINRELSIZE
minimum relative size (in terms of variables) to solve a component individually during branch-and-bou...
constexpr Param< long long > NODELIMIT
maximum number of nodes to be solved in subproblems during presolving
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< double > INTFACTOR
the weight of an integer variable compared to binary variables
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< int > MAXINTVARS
maximum number of integer (or binary) variables to solve a subproblem during presolving (-1: unlimite...
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< bool > DISCARDSOLS
is it allowed to discard solutions?
constexpr Param< bool > ACTIVE
is the constraint handler active?
constexpr Param< long long > SOLLIMIT
counting stops, if the given number of solutions were found (-1: no limit)
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< bool > COLLECT
should the solutions be collected?
constexpr Param< bool > SPARSETEST
should the sparse solution test be turned on?
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< bool > USEBDWIDENING
should bound widening be used during the conflict analysis?
constexpr Param< bool > USECOVERCUTS
should covering cuts be added every node?
constexpr Param< bool > TTEFINFER
should time-table edge-finding be used to infer bounds?
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< long long > MAXNODES
number of branch-and-bound nodes to solve an independent cumulative constraint (-1: no limit)?
constexpr Param< bool > SEPAOLD
shall old sepa algo be applied?
constexpr Param< bool > TTINFER
should time-table (core-times) propagator be used to infer bounds?
constexpr Param< bool > DETECTVARBOUNDS
search for conflict set via maximal cliques to detect variable bound constraints
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< bool > EFCHECK
should edge-finding be used to detect an overload?
constexpr Param< bool > USEADJUSTEDJOBS
should edge-finding be executed?
constexpr Param< bool > DISJUNCTIVE
extract disjunctive constraints?
constexpr Param< bool > USEBINVARS
should the binary representation be used?
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< bool > EFINFER
should edge-finding be used to infer bounds?
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< bool > LOCALCUTS
should cuts be added only locally?
constexpr Param< bool > CUTSASCONSS
should the cumulative constraint create cuts as knapsack constraints?
constexpr Param< bool > COEFTIGHTENING
should coefficient tightening be applied?
constexpr Param< bool > PRESOLPAIRWISE
should pairwise constraint comparison be performed in presolving?
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< bool > DUALPRESOLVE
should dual presolving be applied?
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< bool > FILLBRANCHCANDS
should branching candidates be added to storage?
constexpr Param< bool > TTEFCHECK
should time-table edge-finding be used to detect an overload?
constexpr Param< bool > NORMALIZE
should demands and capacity be normalized?
constexpr Param< bool > DETECTDISJUNCTIVE
search for conflict set via maximal cliques to detect disjunctive constraints
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< bool > ALWAYSBRANCH
alawys perform branching if one of the constraints is violated, otherwise only if all integers are fi...
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< int > MAXSEPACUTSROOT
maximal number of cuts separated per separation round in the root node
constexpr Param< bool > REMOVEINDICATORS
Remove indicator constraint if corresponding variable bound constraint has been added?
constexpr Param< bool > SEPACOUPLINGLOCAL
Allow to use local bounds in order to separate coupling inequalities?
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< int > MAXSEPANONVIOLATED
maximal number of separated non violated IISs, before separation is stopped
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< bool > ADDCOUPLING
Add coupling constraints or rows if big-M is small enough?
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< bool > SEPAPERSPECTIVE
Separate cuts based on perspective formulation?
constexpr Param< bool > FORCERESTART
Force restart if absolute gap is 1 or enough binary variables have been fixed?
constexpr Param< bool > USEOTHERCONSS
Collect other constraints to alternative LP?
constexpr Param< bool > DUALREDUCTIONS
Should dual reduction steps be performed?
constexpr Param< bool > CONFLICTSUPGRADE
Try to upgrade bounddisjunction conflicts by replacing slack variables?
constexpr Param< double > RESTARTFRAC
fraction of binary variables that need to be fixed before restart occurs (in forcerestart)
constexpr Param< bool > TRYSOLFROMCOVER
Try to construct a feasible solution from a cover?
constexpr Param< double > SEPACOUPLINGVALUE
maximum coefficient for binary variable in separated coupling constraint
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< bool > TRYSOLUTIONS
Try to make solutions feasible by setting indicator variables?
constexpr Param< bool > NOLINCONSCONT
Decompose problem (do not generate linear constraint if all variables are continuous)?
constexpr Param< bool > BRANCHINDICATORS
Branch on indicator constraints in enforcing?
constexpr Param< bool > UPDATEBOUNDS
Update bounds of original variables for separation?
constexpr Param< bool > SEPAPERSPLOCAL
Allow to use local bounds in order to separate perspective cuts?
constexpr Param< double > MAXCOUPLINGVALUE
maximum coefficient for binary variable in coupling constraint
constexpr Param< bool > USEOBJECTIVECUT
Use objective cut with current best solution to alternative LP?
constexpr Param< double > MAXCONDITIONALTLP
maximum estimated condition of the solution basis matrix of the alternative LP to be trustworthy (0....
constexpr Param< bool > ADDCOUPLINGCONS
Add initial variable upper bound constraints, if 'addcoupling' is true?
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< bool > ADDOPPOSITE
Add opposite inequality in nodes in which the binary variable has been fixed to 0?
constexpr Param< bool > SCALESLACKVAR
Scale slack variable coefficient at construction time?
constexpr Param< bool > ENFORCECUTS
In enforcing try to generate cuts (only if sepaalternativelp is true)?
constexpr Param< int > MAXSEPACUTS
maximal number of cuts separated per separation round
constexpr Param< bool > UPGRADELINEAR
Try to upgrade linear constraints to indicator constraints?
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< bool > GENLOGICOR
Generate logicor constraints instead of cuts?
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< bool > SEPACOUPLINGCUTS
Should the coupling inequalities be separated dynamically?
constexpr Param< bool > SEPAALTERNATIVELP
Separate using the alternative LP?
constexpr Param< bool > GENERATEBILINEAR
Do not generate indicator constraint, but a bilinear constraint instead?
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< int > MAXROUNDSROOT
maximal number of separation rounds per node in the root node (-1: unlimited)
constexpr Param< bool > PRESOLPAIRWISE
should pairwise constraint comparison be performed in presolving?
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< int > MAXSEPACUTSROOT
maximal number of cuts separated per separation round in the root node
constexpr Param< bool > USEGUBS
should GUB information be used for separation?
constexpr Param< double > CLQPARTUPDATEFAC
factor on the growth of global cliques to decide when to update a previous (negated) clique partition...
constexpr Param< bool > DISAGGREGATION
should disaggregation of knapsack constraints be allowed in preprocessing?
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< double > MAXCARDBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< int > MAXSEPACUTS
maximal number of cuts separated per separation round
constexpr Param< bool > UPDATECLIQUEPARTITIONS
should clique partition information be updated when old partition seems outdated?
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< bool > SIMPLIFYINEQUALITIES
should presolving try to simplify knapsacks
constexpr Param< double > CLIQUEEXTRACTFACTOR
lower clique size limit for greedy clique extraction algorithm (relative to largest clique)
constexpr Param< int > MAXROUNDS
maximal number of separation rounds per node (-1: unlimited)
constexpr Param< int > SEPACARDFREQ
multiplier on separation frequency, how often knapsack cuts are separated (-1: never,...
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< bool > DUALPRESOLVING
should dual presolving steps be performed?
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< bool > DETECTLOWERBOUND
should presolving try to detect constraints parallel to the objective function defining a lower bound...
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< bool > PRESOLUSEHASHING
should hash table be used for detecting redundant constraints in advance
constexpr Param< bool > DETECTCUTOFFBOUND
should presolving try to detect constraints parallel to the objective function defining an upper boun...
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< bool > NEGATEDCLIQUE
should negated clique information be used in solving process
constexpr Param< bool > XOR
enable linear upgrading for constraint handler <xor>
constexpr Param< bool > LOGICOR
enable linear upgrading for constraint handler <logicor>
constexpr Param< bool > VARBOUND
enable linear upgrading for constraint handler <varbound>
constexpr Param< bool > INDICATOR
enable linear upgrading for constraint handler <indicator>
constexpr Param< bool > SETPPC
enable linear upgrading for constraint handler <setppc>
constexpr Param< bool > KNAPSACK
enable linear upgrading for constraint handler <knapsack>
constexpr Param< bool > CHECKRELMAXABS
should the violation for a constraint with side 0.0 be checked relative to 1.0 (FALSE) or to the maxi...
constexpr Param< int > RANGEDROWMAXDEPTH
maximum depth to apply ranged row propagation
constexpr Param< double > MINGAINPERNMINCOMPARISONS
minimal gain per minimal pairwise presolve comparisons to repeat pairwise comparison round
constexpr Param< int > MAXROUNDS
maximal number of separation rounds per node (-1: unlimited)
constexpr Param< bool > SIMPLIFYINEQUALITIES
should presolving try to simplify inequalities
constexpr Param< int > MAXSEPACUTS
maximal number of cuts separated per separation round
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< bool > SEPARATEALL
should all constraints be subject to cardinality cut generation instead of only the ones with non-zer...
constexpr Param< bool > DETECTLOWERBOUND
should presolving try to detect constraints parallel to the objective function defining a lower bound...
constexpr Param< double > MAXAGGRNORMSCALE
maximal allowed relative gain in maximum norm for constraint aggregation (0.0: disable constraint agg...
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< double > MAXMULTAGGRQUOT
maximum coefficient dynamism (ie. maxabsval / minabsval) for primal multiaggregation
constexpr Param< bool > MULTAGGRREMOVE
should multi-aggregations only be performed if the constraint can be removed afterwards?
constexpr Param< int > MAXROUNDSROOT
maximal number of separation rounds per node in the root node (-1: unlimited)
constexpr Param< bool > DUALPRESOLVING
should dual presolving steps be performed?
constexpr Param< double > MAXDUALMULTAGGRQUOT
maximum coefficient dynamism (ie. maxabsval / minabsval) for dual multiaggregation
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< bool > SINGLETONSTUFFING
should stuffing of singleton continuous variables be performed?
constexpr Param< int > TIGHTENBOUNDSFREQ
multiplier on propagation frequency, how often the bounds are tightened (-1: never,...
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< int > MAXSEPACUTSROOT
maximal number of cuts separated per separation round in the root node
constexpr Param< bool > SINGLEVARSTUFFING
should single variable stuffing be performed, which tries to fulfill constraints using the cheapest v...
constexpr Param< bool > PRESOLPAIRWISE
should pairwise constraint comparison be performed in presolving?
constexpr Param< double > MAXEASYACTIVITYDELTA
maximum activity delta to run easy propagation on linear constraint (faster, but numerically less sta...
constexpr Param< bool > DETECTCUTOFFBOUND
should presolving try to detect constraints parallel to the objective function defining an upper boun...
constexpr Param< bool > DETECTPARTIALOBJECTIVE
should presolving try to detect subsets of constraints parallel to the objective function?
constexpr Param< bool > PRESOLUSEHASHING
should hash table be used for detecting redundant constraints in advance
constexpr Param< bool > RANGEDROWARTCONS
should presolving and propagation extract sub-constraints from ranged rows and equations?
constexpr Param< int > RANGEDROWFREQ
frequency for applying ranged row propagation
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< bool > AGGREGATEVARIABLES
should presolving search for aggregations in equations
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< bool > SORTVARS
apply binaries sorting in decr. order of coeff abs value?
constexpr Param< int > NMINCOMPARISONS
number for minimal pairwise presolve comparisons
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< bool > EXTRACTCLIQUES
should Cliques be extracted?
constexpr Param< double > MAXCARDBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< bool > RANGEDROWPROPAGATION
should presolving and propagation try to improve bounds, detect infeasibility, and extract sub-constr...
constexpr Param< bool > LINEARIZE
this constraint will not propagate or separate, linear and setppc are used?
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< bool > PRESOLPAIRWISE
should pairwise constraint comparison be performed in presolving?
constexpr Param< bool > STRENGTHEN
should pairwise constraint comparison try to strengthen constraints by removing superflous non-zeros?
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< bool > PRESOLUSEHASHING
should hash table be used for detecting redundant constraints in advance
constexpr Param< bool > NEGATEDCLIQUE
should negated clique information be used in presolving
constexpr Param< bool > DUALPRESOLVING
should dual presolving steps be performed?
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< bool > IMPLICATIONS
should implications/cliques be used in presolving
constexpr Param< char > SCOREAGG
how to aggregate several branching scores given for the same expression: 'a'verage,...
constexpr Param< bool > EXTERNAL
whether to use external branching candidates and branching rules for branching
constexpr Param< double > VARTYPEWEIGHT
weight by how much to consider variable type (continuous: 0, binary: 1, integer: 0....
constexpr Param< double > DUALWEIGHT
weight by how much to consider the dual values of rows that contain a variable for its branching scor...
constexpr Param< double > HIGHSCOREFACTOR
consider a variable branching score high if its branching score >= this factor * maximal branching sc...
constexpr Param< char > VIOLSPLIT
method used to split violation in expression onto variables: 'u'niform, 'm'idness of solution,...
constexpr Param< double > PSCOSTWEIGHT
weight by how much to consider the pseudo cost of a variable for its branching score
constexpr Param< double > PSCOSTRELIABLE
minimum pseudo-cost update count required to consider pseudo-costs reliable
constexpr Param< double > HIGHVIOLFACTOR
consider a constraint highly violated if its violation is >= this factor * maximal violation among al...
constexpr Param< double > VIOLWEIGHT
weight by how much to consider the violation assigned to a variable for its branching score
constexpr Param< int > AUX
from which depth on in the tree to allow branching on auxiliary variables (variables added for extend...
constexpr Param< double > DOMAINWEIGHT
weight by how much to consider the domain width in branching score
constexpr Param< bool > SETPPC
enable nonlinear upgrading for constraint handler <setppc>
constexpr Param< bool > LINEAR
enable nonlinear upgrading for constraint handler <linear>
constexpr Param< int > MAXPROPROUNDS
limit on number of propagation rounds for a set of constraints within one round of SCIP propagation
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< bool > STRONGCUTEFFICACY
consider efficacy requirement when deciding whether a cut is "strong"
constexpr Param< double > ENFOAUXVIOLFACTOR
an expression will be enforced if the "auxiliary" violation is at least this factor times the "origin...
constexpr Param< double > VARBOUNDRELAXAMOUNT
by how much to relax variable bounds during bound tightening if strategy 'a', 'b',...
constexpr Param< bool > ASSUMECONVEX
whether to assume that any constraint is convex
constexpr Param< bool > REFORMBINPRODSAND
whether to use the AND constraint handler for reformulating binary products
constexpr Param< double > STRONGCUTMAXCOEF
"strong" cuts will be scaled to have their maximal coef in [1/strongcutmaxcoef,strongcutmaxcoef]
constexpr Param< bool > PROPINENFORCE
whether to (re)run propagation in enforcement
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< double > CONSSIDERELAXAMOUNT
by how much to relax constraint sides during bound tightening
constexpr Param< double > WEAKCUTTHRESHOLD
threshold for when to regard a cut from an estimator as weak (lower values allow more weak cuts)
constexpr Param< char > CHECKVARLOCKS
whether variables contained in a single constraint should be forced to be at their lower or upper bou...
constexpr Param< double > WEAKCUTMINVIOLFACTOR
retry enfo of constraint with weak cuts if violation is least this factor of maximal violated constra...
constexpr Param< int > REFORMBINPRODSFAC
minimum number of terms to reformulate bilinear binary products by factorizing variables (<= 1: disab...
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< double > VPMAXPERTURB
maximal relative perturbation of reference point when computing facet of envelope of vertex-polyhedra...
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< int > BILINMAXNAUXEXPRS
maximal number of auxiliary expressions per bilinear term
constexpr Param< bool > PROPAUXVARS
whether to check bounds of all auxiliary variable to seed reverse propagation
constexpr Param< char > LINEARIZEHEURSOL
whether tight linearizations of nonlinear constraints should be added to cutpool when some heuristics...
constexpr Param< double > VPADJFACETTHRESH
adjust computed facet of envelope of vertex-polyhedral function up to a violation of this value times...
constexpr Param< bool > FORBIDMULTAGGRNLVAR
whether to forbid multiaggregation of nonlinear variables
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< char > ROWNOTREMOVABLE
whether to make rows to be non-removable in the node where they are added (can prevent some cycling):...
constexpr Param< bool > REFORMBINPRODS
whether to reformulate products of binary variables during presolving
constexpr Param< bool > VPDUALSIMPLEX
whether to use dual simplex instead of primal simplex for LP that computes facet of vertex-polyhedral...
constexpr Param< bool > FORCESTRONGCUT
whether to force "strong" cuts in enforcement
constexpr Param< char > VARBOUNDRELAX
strategy on how to relax variable bounds during bound tightening: relax (n)ot, relax by (a)bsolute va...
constexpr Param< bool > TIGHTENLPFEASTOL
whether to tighten LP feasibility tolerance during enforcement, if it seems useful
constexpr Param< char > VIOLSCALE
method how to scale violations to make them comparable (not used for feasibility check): (n)one,...
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< bool > FORCECONSCOPY
Whether orbisack constraints should be forced to be copied to sub SCIPs.
constexpr Param< bool > ORBISEPARATION
Separate orbisack inequalities?
constexpr Param< double > COEFFBOUND
Maximum size of coefficients for orbisack inequalities.
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< bool > CHECKPPORBISACK
Upgrade orbisack constraints to packing/partioning orbisacks?
constexpr Param< bool > COVERSEPARATION
Separate cover inequalities for orbisacks?
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< bool > SEPAFULLORBITOPE
Whether we separate inequalities for full orbitopes?
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< bool > CHECKPPORBITOPE
Strengthen orbitope constraints to packing/partioning orbitopes?
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< bool > FORCECONSCOPY
Whether orbitope constraints should be forced to be copied to sub SCIPs.
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< bool > NLCREMOVABLE
should the nonlinear constraints be removable?
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< bool > DECOMPOSENORMAL
decompose all normal pseudo boolean constraint into a "linear" constraint and "and" constraints
constexpr Param< bool > NLCSEPARATE
should the nonlinear constraints be separated during LP processing?
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< bool > NLCPROPAGATE
should the nonlinear constraints be propagated during node processing?
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< bool > DECOMPOSEINDICATOR
decompose all indicator pseudo boolean constraint into a "linear" constraint and "and" constraints
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< int > NPSEUDOBRANCHES
number of children created in pseudo branching (0: disable pseudo branching)
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< bool > PRESOLPAIRWISE
should pairwise constraint comparison be performed in presolving?
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< bool > DUALPRESOLVING
should dual presolving steps be performed?
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< bool > PRESOLUSEHASHING
should hash table be used for detecting redundant constraints in advance
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< bool > CLIQUESHRINKING
should we try to shrink the number of variables in a clique constraints, by replacing more than one v...
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< bool > CLIQUELIFTING
should we try to lift variables into other clique constraints, fix variables, aggregate them,...
constexpr Param< bool > ADDVARIABLESASCLIQUES
should we try to generate extra cliques out of all binary variables to maybe fasten redundant constra...
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< int > MAXADDCOMPS
maximal number of complementarity constraints added per branching node (-1: no limit)
constexpr Param< int > MAXBOUNDCUTSROOT
maximal number of bound cuts separated per iteration in the root node
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< int > MAXIMPLCUTS
maximal number of implied bound cuts separated per branching node
constexpr Param< int > MAXIMPLCUTSROOT
maximal number of implied bound cuts separated per iteration in the root node
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< int > IMPLCUTSFREQ
frequency for separating implied bound cuts; zero means to separate only in the root node
constexpr Param< int > ADDCOMPSDEPTH
only add complementarity constraints to branching nodes for predefined depth (-1: no limit)
constexpr Param< bool > STRTHENBOUNDCUTS
if TRUE then bound cuts are strengthened in case bound variables are available
constexpr Param< int > DEPTHIMPLANALYSIS
number of recursive calls of implication graph analysis (-1: no limit)
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< double > ADDBDSFEAS
minimal feasibility value for bound inequalities in order to be added to the branching node
constexpr Param< int > NSTRONGROUNDS
maximal number of strong branching rounds to perform for each node (-1: auto); only available for nei...
constexpr Param< int > BOUNDCUTSFREQ
frequency for separating bound cuts; zero means to separate only in the root node
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< bool > ADDCOMPS
if TRUE then add complementarity constraints to the branching nodes (can be used in combination with ...
constexpr Param< bool > SOSCONSPROP
whether to use SOS1 constraint propagation
constexpr Param< int > NSTRONGITER
maximal number LP iterations to perform for each strong branching round (-2: auto,...
constexpr Param< bool > IMPLPROP
whether to use implication graph propagation
constexpr Param< bool > ADDEXTENDEDBDS
should added complementarity constraints be extended to SOS1 constraints to get tighter bound inequal...
constexpr Param< bool > PERFIMPLANALYSIS
if TRUE then perform implication graph analysis (might add additional SOS1 constraints)
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< int > MAXSOSADJACENCY
do not create an adjacency matrix if number of SOS1 variables is larger than predefined value (-1: no...
constexpr Param< bool > BRANCHWEIGHT
Branch on SOS cons. with highest nonzero-variable weight for branching (needs branchnonzeros = false)...
constexpr Param< bool > AUTOSOS1BRANCH
if TRUE then automatically switch to SOS1 branching if the SOS1 constraints do not overlap
constexpr Param< double > ADDCOMPSFEAS
minimal feasibility value for complementarity constraints in order to be added to the branching node
constexpr Param< int > MAXTIGHTENBDS
maximal number of bound tightening rounds per presolving round (-1: no limit)
constexpr Param< bool > BRANCHNONZEROS
Branch on SOS constraint with most number of nonzeros?
constexpr Param< bool > BRANCHSOS
Use SOS1 branching in enforcing (otherwise leave decision to branching rules)? This value can only be...
constexpr Param< bool > BOUNDCUTSFROMGRAPH
if TRUE separate bound inequalities from the conflict graph
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< bool > BOUNDCUTSFROMSOS1
if TRUE separate bound inequalities from initial SOS1 constraints
constexpr Param< bool > AUTOCUTSFROMSOS1
if TRUE then automatically switch to separating initial SOS1 constraints if the SOS1 constraints do n...
constexpr Param< char > BRANCHINGRULE
which branching rule should be applied ? ('n': neighborhood, 'b': bipartite, 's': SOS1/clique) (note:...
constexpr Param< int > MAXBOUNDCUTS
maximal number of bound cuts separated per branching node
constexpr Param< int > MAXEXTENSIONS
maximal number of extensions that will be computed for each SOS1 constraint (-1: no limit)
constexpr Param< bool > FIXNONZERO
if neighborhood branching is used, then fix the branching variable (if positive in sign) to the value...
constexpr Param< int > BOUNDCUTSDEPTH
node depth of separating bound cuts (-1: no limit)
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< int > IMPLCUTSDEPTH
node depth of separating implied bound cuts (-1: no limit)
constexpr Param< bool > CONFLICTPROP
whether to use conflict graph propagation
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< double > MAXUPGDCOEFLINEAR
maximum big-M coefficient of binary variable in upgrade to a linear constraint (relative to smallest ...
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< bool > CHECKSLACKTYPE
should type of slack constraint be checked when creating superindicator constraint?
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< int > UPGDPRIOLINEAR
priority for upgrading to an indicator constraint (-1: never)
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< int > UPGDPRIOINDICATOR
priority for upgrading to an indicator constraint (-1: never)
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< bool > CHECKMONOTONICITY
Check whether permutation is monotone when upgrading to packing/partioning symresacks?
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< bool > PPSYMRESACK
Upgrade symresack constraints to packing/partioning symresacks?
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< bool > FORCECONSCOPY
Whether symresack constraints should be forced to be copied to sub SCIPs.
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< bool > USEBDWIDENING
should bound widening be used in conflict analysis?
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< double > MAXLPCOEF
maximum coefficient in varbound constraint to be added as a row into LP
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< bool > PRESOLPAIRWISE
should pairwise constraint comparison be performed in presolving?
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< bool > DELAYSEPA
should separation method be delayed, if other separators found cuts?
constexpr Param< bool > PRESOLPAIRWISE
should pairwise constraint comparison be performed in presolving?
constexpr Param< int > PROPFREQ
frequency for propagating domains (-1: never, 0: only in root node)
constexpr Param< int > EAGERFREQ
frequency for using all instead of only the useful constraints in separation, propagation and enforce...
constexpr Param< int > SEPAFREQ
frequency for separating cuts (-1: never, 0: only in root node)
constexpr Param< int > GAUSSPROPFREQ
frequency for applying the Gauss propagator
constexpr Param< bool > SEPARATEPARITY
should parity inequalities be separated?
constexpr Param< bool > PRESOLUSEHASHING
should hash table be used for detecting redundant constraints in advance?
constexpr Param< bool > ADDFLOWEXTENDED
should the extended flow formulation be added (nonsymmetric formulation otherwise)?
constexpr Param< int > PROPTIMING
timing when constraint propagation should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< int > PRESOLTIMING
timing mask of the constraint handler's presolving method (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< bool > DELAYPROP
should propagation method be delayed, if other propagators found reductions?
constexpr Param< bool > ADDEXTENDEDFORM
should the extended formulation be added in presolving?
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the constraint handler participates in (-1: no limit)
constexpr Param< int > AGELIMIT
maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constr...
constexpr Param< int > OBSOLETEAGE
age of a constraint after which it is marked obsolete (0: dynamic, -1 do not mark constraints obsolet...
constexpr Param< bool > DISABLEENFOPS
should enforcement of pseudo solution be disabled?
constexpr Param< double > DIRCUTOFFDISTWEIGHT
weight of directed cutoff distance in cut score calculation
constexpr Param< double > EFFICACYWEIGHT
weight of efficacy in cut score calculation
constexpr Param< double > OBJPARALWEIGHT
weight of objective parallelism in cut score calculation
constexpr Param< double > INTSUPPORTWEIGHT
weight of integral support in cut score calculation
constexpr Param< double > MINORTHO
minimal orthogonality for a cut to enter the LP
constexpr Param< double > MINORTHOROOT
minimal orthogonality for a cut to enter the LP in the root node
constexpr Param< int > PRIORITY
priority of cut selection rule <hybrid>
constexpr Param< bool > APPLYBENDERS
if a decomposition exists, should Benders' decomposition be applied?
constexpr Param< bool > BENDERSLABELS
should the variables be labelled for the application of Benders' decomposition?
constexpr Param< bool > DISABLEMEASURES
disable expensive measures
constexpr Param< int > MAXGRAPHEDGE
maximum number of edges in block graph computation (-1: no limit, 0: disable block graph computation)
constexpr Param< int > ACTIVE
display activation status of display column <avgdualbound> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <completed> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <concdualbound> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <concgap> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <concmemused> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <concprimalbound> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <concsolfound> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <conflicts> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <conss> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <curcols> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <curconss> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <curdualbound> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <currows> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <cutoffbound> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <cuts> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <depth> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <dualbound> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <estimate> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <feasST> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <gap> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <lpavgiterations> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <lpcond> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <lpiterations> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <lpobj> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <maxdepth> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <memtotal> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <memused> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <nexternbranchcands> (0: off, 1: auto,...
constexpr Param< int > ACTIVE
display activation status of display column <nfrac> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <ninfeasleaves> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <nnodesbelowinc> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <nnodes> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <nobjleaves> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <nodesleft> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <nrank1nodes> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <nsols> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <plungedepth> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <poolsize> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <primalbound> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <primalgap> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <pseudoobj> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <separounds> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <solfound> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <sols> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <strongbranchs> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <time> (0: off, 1: auto, 2:on)
constexpr Param< int > ACTIVE
display activation status of display column <vars> (0: off, 1: auto, 2:on)
constexpr Param< int > VERBLEVEL
verbosity level of output
constexpr Param< bool > RELEVANTSTATS
should the relevant statistics be displayed at the end of solving?
constexpr Param< int > WIDTH
maximal number of characters in a node information line
constexpr Param< bool > LPINFO
should the LP solver display status messages?
constexpr Param< int > FREQ
frequency for displaying node information lines
constexpr Param< int > HEADERFREQ
frequency for displaying header lines (every n'th node information line)
constexpr Param< bool > ALLVIOLS
display all violations for a given start solution / the best solution after the solving process?
constexpr Param< bool > RESTARTACTPRICERS
whether to apply a restart when active pricers are used
constexpr Param< long long > MINNODES
minimum number of nodes before restart
constexpr Param< int > RESTARTLIMIT
restart limit
constexpr Param< char > RESTARTPOLICY
restart policy: (a)lways, (c)ompletion, (e)stimation, (n)ever
constexpr Param< int > HITCOUNTERLIM
limit on the number of successive samples to really trigger a restart
constexpr Param< double > RESTARTFACTOR
factor by which the estimated number of nodes should exceed the current number of nodes
constexpr Param< bool > RESTARTNONLINEAR
whether to apply a restart when nonlinear constraints are present
constexpr Param< bool > COUNTONLYLEAVES
should only leaves count for the minnodes parameter?
constexpr Param< int > NMAXSUBTREES
the maximum number of individual SSG subtrees; -1: no limit
constexpr Param< long long > NMINNODESLASTSPLIT
minimum number of nodes to process between two consecutive SSG splits
constexpr Param< bool > ENABLED
should the event handler collect data?
constexpr Param< double > MINNODESPERDEPTH
minimum average number of nodes at each depth before producing estimations
constexpr Param< bool > SHOWSTATS
should statistics be shown at the end?
constexpr Param< double > COEFMONOSSG
coefficient of 1 - SSG in monotone approximation of search completion
constexpr Param< bool > USELEAFTS
use leaf nodes as basic observations for time series, or all nodes?
constexpr Param< char > METHOD
tree size estimation method: (c)ompletion, (e)nsemble, time series forecasts on either (g)ap,...
constexpr Param< int > REPORTFREQ
report frequency on estimation: -1: never, 0:always, k >= 1: k times evenly during search
constexpr Param< std::string > REGFORESTFILENAME
user regression forest in RFCSV format
constexpr Param< double > COEFMONOWEIGHT
coefficient of tree weight in monotone approximation of search completion
constexpr Param< char > COMPLETIONTYPE
approximation of search tree completion: (a)uto, (g)ap, tree (w)eight, (m)onotone regression,...
constexpr Param< double > MINZERODISTANCE
minimal distance from zero to enforce for child in bound tightening
constexpr Param< double > MINZERODISTANCE
minimal distance from zero to enforce for child in bound tightening
constexpr Param< bool > ONLYLPBRANCHCANDS
should only LP branching candidates be considered instead of the slower but more general constraint h...
constexpr Param< double > MAXDIVEUBQUOT
maximal quotient (curlowerbound - lowerbound)/(cutoffbound - lowerbound) where diving is performed (0...
constexpr Param< double > MAXDIVEUBQUOTNOSOL
maximal UBQUOT when no solution was found yet (0.0: no limit)
constexpr Param< double > MAXLPITERQUOT
maximal fraction of diving LP iterations compared to node LP iterations
constexpr Param< int > LPSOLVEFREQ
LP solve frequency for diving heuristics (0: only after enough domain changes have been found)
constexpr Param< int > MAXLPITEROFS
additional number of allowed LP iterations
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <actconsdiving> (-1: no limit)
constexpr Param< bool > BACKTRACK
use one level of backtracking if infeasibility is encountered?
constexpr Param< int > PRIORITY
priority of heuristic <actconsdiving>
constexpr Param< double > LPRESOLVEDOMCHGQUOT
percentage of immediate domain changes during probing to trigger LP resolve
constexpr Param< int > FREQ
frequency for calling primal heuristic <actconsdiving> (-1: never, 0: only at depth freqofs)
constexpr Param< double > MAXDIVEAVGQUOT
maximal quotient (curlowerbound - lowerbound)/(avglowerbound - lowerbound) where diving is performed ...
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <actconsdiving>
constexpr Param< double > MINRELDEPTH
minimal relative depth to start diving
constexpr Param< double > MAXRELDEPTH
maximal relative depth to start diving
constexpr Param< double > MAXDIVEAVGQUOTNOSOL
maximal AVGQUOT when no solution was found yet (0.0: no limit)
constexpr Param< bool > USEADAPTIVECONTEXT
should the heuristic use its own statistics, or shared statistics?
constexpr Param< int > PRIORITY
priority of heuristic <adaptivediving>
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <adaptivediving>
constexpr Param< double > MAXLPITERQUOT
maximal fraction of diving LP iterations compared to node LP iterations
constexpr Param< char > SCORETYPE
score parameter for selection: minimize either average 'n'odes, LP 'i'terations,backtrack/'c'onflict ...
constexpr Param< double > SELCONFIDENCECOEFF
coefficient c to decrease initial confidence (calls + 1.0) / (calls + c) in scores
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <adaptivediving> (-1: no limit)
constexpr Param< double > EPSILON
parameter that increases probability of exploration among divesets (only active if seltype is 'e')
constexpr Param< long long > MAXLPITEROFS
additional number of allowed LP iterations
constexpr Param< char > SELTYPE
selection strategy: (e)psilon-greedy, (w)eighted distribution, (n)ext diving
constexpr Param< int > FREQ
frequency for calling primal heuristic <adaptivediving> (-1: never, 0: only at depth freqofs)
constexpr Param< double > BESTSOLWEIGHT
weight of incumbent solutions compared to other solutions in computation of LP iteration limit
constexpr Param< double > MAXFIXINGRATE
maximum fixing rate for this neighborhood
constexpr Param< int > NSOLS
the number of solutions that crossover should combine
constexpr Param< double > MINFIXINGRATE
minimum fixing rate for this neighborhood
constexpr Param< bool > ACTIVE
is this neighborhood active?
constexpr Param< double > PRIORITY
positive call priority to initialize bandit algorithms
constexpr Param< double > MINFIXINGRATE
minimum fixing rate for this neighborhood
constexpr Param< double > MAXFIXINGRATE
maximum fixing rate for this neighborhood
constexpr Param< bool > ACTIVE
is this neighborhood active?
constexpr Param< double > PRIORITY
positive call priority to initialize bandit algorithms
constexpr Param< int > NPOOLSOLS
number of pool solutions where binary solution values must agree
constexpr Param< bool > ACTIVE
is this neighborhood active?
constexpr Param< double > MAXFIXINGRATE
maximum fixing rate for this neighborhood
constexpr Param< double > PRIORITY
positive call priority to initialize bandit algorithms
constexpr Param< double > MINFIXINGRATE
minimum fixing rate for this neighborhood
constexpr Param< double > PRIORITY
positive call priority to initialize bandit algorithms
constexpr Param< double > MAXFIXINGRATE
maximum fixing rate for this neighborhood
constexpr Param< bool > ACTIVE
is this neighborhood active?
constexpr Param< double > MINFIXINGRATE
minimum fixing rate for this neighborhood
constexpr Param< bool > ACTIVE
is this neighborhood active?
constexpr Param< double > PRIORITY
positive call priority to initialize bandit algorithms
constexpr Param< double > MAXFIXINGRATE
maximum fixing rate for this neighborhood
constexpr Param< double > MINFIXINGRATE
minimum fixing rate for this neighborhood
constexpr Param< bool > ACTIVE
is this neighborhood active?
constexpr Param< double > MINFIXINGRATE
minimum fixing rate for this neighborhood
constexpr Param< double > PRIORITY
positive call priority to initialize bandit algorithms
constexpr Param< double > MAXFIXINGRATE
maximum fixing rate for this neighborhood
constexpr Param< double > MAXFIXINGRATE
maximum fixing rate for this neighborhood
constexpr Param< bool > ACTIVE
is this neighborhood active?
constexpr Param< double > PRIORITY
positive call priority to initialize bandit algorithms
constexpr Param< double > MINFIXINGRATE
minimum fixing rate for this neighborhood
constexpr Param< double > MINFIXINGRATE
minimum fixing rate for this neighborhood
constexpr Param< double > PRIORITY
positive call priority to initialize bandit algorithms
constexpr Param< bool > ACTIVE
is this neighborhood active?
constexpr Param< double > MAXFIXINGRATE
maximum fixing rate for this neighborhood
constexpr Param< double > VIOLPENALTY
the penalty for each change in the binary variables from the candidate solution
constexpr Param< double > MAXFIXINGRATE
maximum fixing rate for this neighborhood
constexpr Param< double > MINFIXINGRATE
minimum fixing rate for this neighborhood
constexpr Param< bool > ACTIVE
is this neighborhood active?
constexpr Param< double > PRIORITY
positive call priority to initialize bandit algorithms
constexpr Param< bool > RESETWEIGHTS
should the bandit algorithms be reset when a new problem is read?
constexpr Param< bool > SUBSCIPRANDSEEDS
should random seeds of sub-SCIPs be altered to increase diversification?
constexpr Param< long long > MINNODES
minimum number of nodes required to start a sub-SCIP
constexpr Param< int > FREQ
frequency for calling primal heuristic <alns> (-1: never, 0: only at depth freqofs)
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <alns> (-1: no limit)
constexpr Param< double > UNFIXTOL
tolerance by which the fixing rate may be exceeded without generic unfixing
constexpr Param< bool > SCALEBYEFFORT
should the reward be scaled by the effort?
constexpr Param< double > TARGETNODEFACTOR
factor by which target node number is eventually increased
constexpr Param< bool > COPYCUTS
should cutting planes be copied to the sub-SCIP?
constexpr Param< bool > DOMOREFIXINGS
should the ALNS heuristic do more fixings by itself based on variable prioritization until the target...
constexpr Param< int > SEED
initial random seed for bandit algorithms and random decisions by neighborhoods
constexpr Param< double > BETA
reward offset between 0 and 1 at every observation for Exp.3
constexpr Param< bool > USESUBSCIPHEURS
should the heuristic activate other sub-SCIP heuristics during its search?
constexpr Param< int > NSOLSLIM
limit on the number of improving solutions in a sub-SCIP call
constexpr Param< bool > USEDISTANCES
distances from fixed variables be used for variable prioritization
constexpr Param< double > GAMMA
weight between uniform (gamma ~ 1) and weight driven (gamma ~ 0) probability distribution for exp3
constexpr Param< bool > INITDURINGROOT
should the heuristic be executed multiple times during the root node?
constexpr Param< char > BANDITALGO
the bandit algorithm: (u)pper confidence bounds, (e)xp.3, epsilon (g)reedy
constexpr Param< double > FIXTOL
tolerance by which the fixing rate may be missed without generic fixing
constexpr Param< double > EPS
increase exploration in epsilon-greedy bandit algorithm
constexpr Param< double > NODESQUOT
fraction of nodes compared to the main SCIP for budget computation
constexpr Param< double > MINIMPROVEHIGH
upper bound for the minimal improvement over the incumbent
constexpr Param< double > REWARDBASELINE
the reward baseline to separate successful and failed calls
constexpr Param< long long > NODESOFS
offset added to the nodes budget
constexpr Param< bool > SHOWNBSTATS
show statistics on neighborhoods?
constexpr Param< long long > MAXNODES
maximum number of nodes to regard in the subproblem
constexpr Param< double > STARTMINIMPROVE
initial factor by which ALNS should at least improve the incumbent
constexpr Param< double > NODESQUOTMIN
lower bound fraction of nodes compared to the main SCIP for budget computation
constexpr Param< double > REWARDCONTROL
reward control to increase the weight of the simple solution indicator and decrease the weight of the...
constexpr Param< bool > ADJUSTTARGETNODES
should the target nodes be dynamically adjusted?
constexpr Param< bool > USEREDCOST
should reduced cost scores be used for variable prioritization?
constexpr Param< long long > WAITINGNODES
number of nodes since last incumbent solution that the heuristic should wait
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <alns>
constexpr Param< int > MAXCALLSSAMESOL
number of allowed executions of the heuristic on the same incumbent solution (-1: no limit,...
constexpr Param< bool > ADJUSTFIXINGRATE
should the heuristic adjust the target fixing rate based on the success?
constexpr Param< bool > ADJUSTMINIMPROVE
should the factor by which the minimum improvement is bound be dynamically updated?
constexpr Param< std::string > REWARDFILENAME
file name to store all rewards and the selection of the bandit
constexpr Param< double > MINIMPROVELOW
lower threshold for the minimal improvement over the incumbent
constexpr Param< double > ALPHA
parameter to increase the confidence width in UCB
constexpr Param< bool > USELOCALREDCOST
should local reduced costs be used for generic (un)fixing?
constexpr Param< bool > USEPSCOST
should pseudo cost scores be used for variable priorization?
constexpr Param< int > PRIORITY
priority of heuristic <alns>
constexpr Param< int > PRIORITY
priority of heuristic <bound>
constexpr Param< int > FREQ
frequency for calling primal heuristic <bound> (-1: never, 0: only at depth freqofs)
constexpr Param< bool > ONLYWITHOUTSOL
Should heuristic only be executed if no primal solution was found, yet?
constexpr Param< char > BOUND
to which bound should integer variables be fixed? ('l'ower, 'u'pper, or 'b'oth)
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <bound>
constexpr Param< int > MAXPROPROUNDS
maximum number of propagation rounds during probing (-1 infinity, -2 parameter settings)
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <bound> (-1: no limit)
constexpr Param< int > PRIORITY
priority of heuristic <clique>
constexpr Param< int > MAXPROPROUNDS
maximum number of propagation rounds during probing (-1 infinity)
constexpr Param< double > NODESQUOT
contingent of sub problem nodes in relation to the number of nodes of the original problem
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <clique> (-1: no limit)
constexpr Param< double > MINMIPFIXINGRATE
minimum percentage of fixed variables in the sub-MIP
constexpr Param< double > MININTFIXINGRATE
minimum percentage of integer variables that have to be fixable
constexpr Param< long long > NODESOFS
number of nodes added to the contingent of the total nodes
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <clique>
constexpr Param< bool > USELOCKFIXINGS
should more variables be fixed based on variable locks if the fixing rate was not reached?
constexpr Param< int > MAXBACKTRACKS
maximum number of backtracks during the fixing process
constexpr Param< double > MINIMPROVE
factor by which clique heuristic should at least improve the incumbent
constexpr Param< long long > MAXNODES
maximum number of nodes to regard in the subproblem
constexpr Param< long long > MINNODES
minimum number of nodes required to start the subproblem
constexpr Param< bool > COPYCUTS
should all active cuts from cutpool be copied to constraints in subproblem?
constexpr Param< int > FREQ
frequency for calling primal heuristic <clique> (-1: never, 0: only at depth freqofs)
constexpr Param< double > MAXDIVEAVGQUOT
maximal quotient (curlowerbound - lowerbound)/(avglowerbound - lowerbound) where diving is performed ...
constexpr Param< int > LPSOLVEFREQ
LP solve frequency for diving heuristics (0: only after enough domain changes have been found)
constexpr Param< double > MAXDIVEAVGQUOTNOSOL
maximal AVGQUOT when no solution was found yet (0.0: no limit)
constexpr Param< int > FREQ
frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
constexpr Param< double > MAXRELDEPTH
maximal relative depth to start diving
constexpr Param< bool > ONLYLPBRANCHCANDS
should only LP branching candidates be considered instead of the slower but more general constraint h...
constexpr Param< bool > BACKTRACK
use one level of backtracking if infeasibility is encountered?
constexpr Param< double > MAXDIVEUBQUOTNOSOL
maximal UBQUOT when no solution was found yet (0.0: no limit)
constexpr Param< double > MAXDIVEUBQUOT
maximal quotient (curlowerbound - lowerbound)/(cutoffbound - lowerbound) where diving is performed (0...
constexpr Param< int > PRIORITY
priority of heuristic <coefdiving>
constexpr Param< double > MAXLPITERQUOT
maximal fraction of diving LP iterations compared to node LP iterations
constexpr Param< double > MINRELDEPTH
minimal relative depth to start diving
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <coefdiving> (-1: no limit)
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <coefdiving>
constexpr Param< double > LPRESOLVEDOMCHGQUOT
percentage of immediate domain changes during probing to trigger LP resolve
constexpr Param< int > MAXLPITEROFS
additional number of allowed LP iterations
constexpr Param< long long > MAXLPITER
maximal number of LP iterations (-1: no limit)
constexpr Param< int > MAXCONTVARS
maximal number of continuous variables after presolving
constexpr Param< long long > MINNODES
minimum number of nodes required to start the subproblem
constexpr Param< double > MINIMPROVE
factor by which the incumbent should be improved at least
constexpr Param< long long > NODESOFS
number of nodes added to the contingent of the total nodes
constexpr Param< double > BOUNDWIDENING
bound widening factor applied to continuous variables (0: fix variables to given solution values,...
constexpr Param< double > LPLIMFAC
factor by which the limit on the number of LP depends on the node limit
constexpr Param< int > SOLUTIONS
heuristic stops, if the given number of improving solutions were found (-1: no limit)
constexpr Param< int > MAXPROPROUNDS
maximal number of iterations in propagation (-1: no limit)
constexpr Param< int > FREQ
frequency for calling primal heuristic <completesol> (-1: never, 0: only at depth freqofs)
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <completesol>
constexpr Param< bool > BEFOREPRESOL
should the heuristic run before presolving?
constexpr Param< double > NODESQUOT
contingent of sub problem nodes in relation to the number of nodes of the original problem
constexpr Param< long long > MAXNODES
maximum number of nodes to regard in the subproblem
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <completesol> (-1: no limit)
constexpr Param< double > MAXUNKNOWNRATE
maximal rate of unknown solution values
constexpr Param< int > PRIORITY
priority of heuristic <completesol>
constexpr Param< double > OBJWEIGHT
weight of the original objective function (1: only original objective)
constexpr Param< bool > ADDALLSOLS
should all subproblem solutions be added to the original SCIP?
constexpr Param< bool > IGNORECONT
should number of continuous variables be ignored?
constexpr Param< double > MAXRELDEPTH
maximal relative depth to start diving
constexpr Param< double > MINRELDEPTH
minimal relative depth to start diving
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <conflictdiving> (-1: no limit)
constexpr Param< int > FREQ
frequency for calling primal heuristic <conflictdiving> (-1: never, 0: only at depth freqofs)
constexpr Param< bool > BACKTRACK
use one level of backtracking if infeasibility is encountered?
constexpr Param< bool > MAXVIOL
try to maximize the violation
constexpr Param< double > MAXDIVEUBQUOT
maximal quotient (curlowerbound - lowerbound)/(cutoffbound - lowerbound) where diving is performed (0...
constexpr Param< bool > ONLYLPBRANCHCANDS
should only LP branching candidates be considered instead of the slower but more general constraint h...
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <conflictdiving>
constexpr Param< double > MAXDIVEAVGQUOT
maximal quotient (curlowerbound - lowerbound)/(avglowerbound - lowerbound) where diving is performed ...
constexpr Param< int > MINCONFLICTLOCKS
minimal number of conflict locks per variable
constexpr Param< double > LOCKWEIGHT
weight used in a convex combination of conflict and variable locks
constexpr Param< int > PRIORITY
priority of heuristic <conflictdiving>
constexpr Param< double > MAXDIVEUBQUOTNOSOL
maximal UBQUOT when no solution was found yet (0.0: no limit)
constexpr Param< int > LPSOLVEFREQ
LP solve frequency for diving heuristics (0: only after enough domain changes have been found)
constexpr Param< double > LPRESOLVEDOMCHGQUOT
percentage of immediate domain changes during probing to trigger LP resolve
constexpr Param< double > MAXDIVEAVGQUOTNOSOL
maximal AVGQUOT when no solution was found yet (0.0: no limit)
constexpr Param< int > MAXLPITEROFS
additional number of allowed LP iterations
constexpr Param< double > MAXLPITERQUOT
maximal fraction of diving LP iterations compared to node LP iterations
constexpr Param< bool > LIKECOEF
perform rounding like coefficient diving
constexpr Param< bool > PERMUTE
should the subproblem be permuted to increase diversification?
constexpr Param< int > BESTSOLLIMIT
limit on number of improving incumbent solutions in sub-CIP
constexpr Param< int > NUSEDSOLS
number of solutions to be taken into account
constexpr Param< long long > MINNODES
minimum number of nodes required to start the subproblem
constexpr Param< bool > DONTWAITATROOT
should the nwaitingnodes parameter be ignored at the root node?
constexpr Param< long long > MAXNODES
maximum number of nodes to regard in the subproblem
constexpr Param< double > NODESQUOT
contingent of sub problem nodes in relation to the number of nodes of the original problem
constexpr Param< bool > USEUCT
should uct node selection be used at the beginning of the search?
constexpr Param< bool > USELPROWS
should subproblem be created out of the rows in the LP rows?
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <crossover> (-1: no limit)
constexpr Param< bool > RANDOMIZATION
should the choice which sols to take be randomized?
constexpr Param< double > MINIMPROVE
factor by which Crossover should at least improve the incumbent
constexpr Param< int > PRIORITY
priority of heuristic <crossover>
constexpr Param< bool > COPYCUTS
if uselprows == FALSE, should all active cuts from cutpool be copied to constraints in subproblem?
constexpr Param< long long > NWAITINGNODES
number of nodes without incumbent change that heuristic should wait
constexpr Param< double > MINFIXINGRATE
minimum percentage of integer variables that have to be fixed
constexpr Param< long long > NODESOFS
number of nodes added to the contingent of the total nodes
constexpr Param< int > FREQ
frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
constexpr Param< double > LPLIMFAC
factor by which the limit on the number of LP depends on the node limit
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <crossover>
constexpr Param< bool > USEUCT
should uct node selection be used at the beginning of the search?
constexpr Param< bool > USELPROWS
should subproblem be created out of the rows in the LP rows?
constexpr Param< double > LPLIMFAC
factor by which the limit on the number of LP depends on the node limit
constexpr Param< int > NEIGHBORHOODSIZE
radius (using Manhattan metric) of the incumbent's neighborhood to be searched
constexpr Param< long long > NODESOFS
number of nodes added to the contingent of the total nodes
constexpr Param< double > MINIMPROVE
factor by which dins should at least improve the incumbent
constexpr Param< bool > COPYCUTS
if uselprows == FALSE, should all active cuts from cutpool be copied to constraints in subproblem?
constexpr Param< int > SOLNUM
number of pool-solutions to be checked for flag array update (for hard fixing of binary variables)
constexpr Param< int > BESTSOLLIMIT
limit on number of improving incumbent solutions in sub-CIP
constexpr Param< long long > MAXNODES
maximum number of nodes to regard in the subproblem
constexpr Param< long long > MINNODES
minimum number of nodes required to start the subproblem
constexpr Param< int > FREQ
frequency for calling primal heuristic <dins> (-1: never, 0: only at depth freqofs)
constexpr Param< double > NODESQUOT
contingent of sub problem nodes in relation to the number of nodes of the original problem
constexpr Param< int > PRIORITY
priority of heuristic <dins>
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <dins>
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <dins> (-1: no limit)
constexpr Param< long long > NWAITINGNODES
number of nodes without incumbent change that heuristic should wait
constexpr Param< double > MINFIXINGRATE
minimum percentage of integer variables that have to be fixable
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <distributiondiving> (-1: no limit)
constexpr Param< bool > BACKTRACK
use one level of backtracking if infeasibility is encountered?
constexpr Param< double > MAXLPITERQUOT
maximal fraction of diving LP iterations compared to node LP iterations
constexpr Param< double > MAXDIVEUBQUOT
maximal quotient (curlowerbound - lowerbound)/(cutoffbound - lowerbound) where diving is performed (0...
constexpr Param< int > PRIORITY
priority of heuristic <distributiondiving>
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <distributiondiving>
constexpr Param< double > MAXDIVEUBQUOTNOSOL
maximal UBQUOT when no solution was found yet (0.0: no limit)
constexpr Param< int > FREQ
frequency for calling primal heuristic <distributiondiving> (-1: never, 0: only at depth freqofs)
constexpr Param< double > MAXRELDEPTH
maximal relative depth to start diving
constexpr Param< char > SCOREPARAM
the score;largest 'd'ifference, 'l'owest cumulative probability,'h'ighest c.p., 'v'otes lowest c....
constexpr Param< int > MAXLPITEROFS
additional number of allowed LP iterations
constexpr Param< double > MAXDIVEAVGQUOTNOSOL
maximal AVGQUOT when no solution was found yet (0.0: no limit)
constexpr Param< double > MINRELDEPTH
minimal relative depth to start diving
constexpr Param< double > MAXDIVEAVGQUOT
maximal quotient (curlowerbound - lowerbound)/(avglowerbound - lowerbound) where diving is performed ...
constexpr Param< bool > ONLYLPBRANCHCANDS
should only LP branching candidates be considered instead of the slower but more general constraint h...
constexpr Param< int > LPSOLVEFREQ
LP solve frequency for diving heuristics (0: only after enough domain changes have been found)
constexpr Param< double > LPRESOLVEDOMCHGQUOT
percentage of immediate domain changes during probing to trigger LP resolve
constexpr Param< int > PRIORITY
priority of heuristic <dps>
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <dps>
constexpr Param< bool > REUSE
should solutions get reused in subproblems?
constexpr Param< double > PENALTY
multiplier for absolute increase of penalty parameters (0: no increase)
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <dps> (-1: no limit)
constexpr Param< double > MAXLINKSCORE
maximal linking score of used decomposition (equivalent to percentage of linking constraints)
constexpr Param< int > FREQ
frequency for calling primal heuristic <dps> (-1: never, 0: only at depth freqofs)
constexpr Param< bool > REOPTIMIZE
should the problem get reoptimized with the original objective function?
constexpr Param< int > MAXITERATIONS
maximal number of iterations
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <dualval>
constexpr Param< int > DYNAMICDEPTH
says if and how the recursion depth is computed at runtime
constexpr Param< bool > ONLYCHEAPER
add constraint to ensure that discrete vars are improving
constexpr Param< bool > FORCEIMPROVEMENTS
exit if objective doesn't improve
constexpr Param< bool > RELAXINDICATORS
relax the indicator variables by introducing continuous copies
constexpr Param< bool > RELAXCONTVARS
relax the continous variables
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <dualval> (-1: no limit)
constexpr Param< int > NLPVERBLEVEL
verblevel of the nlp solver, can be 0 or 1
constexpr Param< int > PRIORITY
priority of heuristic <dualval>
constexpr Param< double > LAMBDAOBJ
scaling factor for the objective function
constexpr Param< double > MINGAP
minimal gap for which we still run the heuristic, if gap is less we return without doing anything
constexpr Param< int > MAXCALLS
maximal number of recursive calls of the heuristic (if dynamicdepth is off)
constexpr Param< int > FREQ
frequency for calling primal heuristic <dualval> (-1: never, 0: only at depth freqofs)
constexpr Param< int > MAXEQUALRANKS
maximal number of variables that may have maximal rank, quit if there are more, turn off by setting -...
constexpr Param< int > RANKVALUE
number of ranks that should be displayed when the heuristic is called
constexpr Param< bool > ONLYLEAVES
disable the heuristic if it was not called at a leaf of the B&B tree
constexpr Param< double > LAMBDASLACK
value added to objective of slack variables, must not be zero
constexpr Param< int > HEURVERBLEVEL
verblevel of the heuristic, default is 0 to display nothing
constexpr Param< bool > ONLYLPBRANCHCANDS
should only LP branching candidates be considered instead of the slower but more general constraint h...
constexpr Param< double > LPRESOLVEDOMCHGQUOT
percentage of immediate domain changes during probing to trigger LP resolve
constexpr Param< double > MAXRELDEPTH
maximal relative depth to start diving
constexpr Param< bool > BACKTRACK
use one level of backtracking if infeasibility is encountered?
constexpr Param< int > FREQ
frequency for calling primal heuristic <farkasdiving> (-1: never, 0: only at depth freqofs)
constexpr Param< double > MAXDIVEUBQUOTNOSOL
maximal UBQUOT when no solution was found yet (0.0: no limit)
constexpr Param< double > OBJDYNAMISM
minimal objective dynamism (log) to run
constexpr Param< double > MAXOBJOCC
maximal occurance factor of an objective coefficient
constexpr Param< int > MAXLPITEROFS
additional number of allowed LP iterations
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <farkasdiving> (-1: no limit)
constexpr Param< double > MAXDIVEAVGQUOTNOSOL
maximal AVGQUOT when no solution was found yet (0.0: no limit)
constexpr Param< bool > SCALESCORE
should the score be scaled?
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <farkasdiving>
constexpr Param< double > MAXDIVEUBQUOT
maximal quotient (curlowerbound - lowerbound)/(cutoffbound - lowerbound) where diving is performed (0...
constexpr Param< bool > ROOTSUCCESS
should the heuristic only run within the tree if at least one solution was found at the root node?
constexpr Param< double > MAXLPITERQUOT
maximal fraction of diving LP iterations compared to node LP iterations
constexpr Param< char > SCALETYPE
scale score by [f]ractionality or [i]mpact on farkasproof
constexpr Param< int > PRIORITY
priority of heuristic <farkasdiving>
constexpr Param< int > LPSOLVEFREQ
LP solve frequency for diving heuristics (0: only after enough domain changes have been found)
constexpr Param< double > MAXDIVEAVGQUOT
maximal quotient (curlowerbound - lowerbound)/(avglowerbound - lowerbound) where diving is performed ...
constexpr Param< bool > CHECKCANDS
should diving candidates be checked before running?
constexpr Param< double > MINRELDEPTH
minimal relative depth to start diving
constexpr Param< int > CYCLELENGTH
maximum length of cycles to be checked explicitly in each round
constexpr Param< int > MAXSOLS
total number of feasible solutions found up to which heuristic is called (-1: no limit)
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <feaspump>
constexpr Param< int > FREQ
frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <feaspump> (-1: no limit)
constexpr Param< int > MAXLOOPS
maximal number of pumping loops (-1: no limit)
constexpr Param< double > ALPHA
initial weight of the objective function in the convex combination
constexpr Param< bool > STAGE3
should we solve a local branching sub-MIP if no solution could be found?
constexpr Param< double > MAXLPITERQUOT
maximal fraction of diving LP iterations compared to node LP iterations
constexpr Param< int > MAXLPITEROFS
additional number of allowed LP iterations
constexpr Param< double > ALPHADIFF
threshold difference for the convex parameter to perform perturbation
constexpr Param< int > PRIORITY
priority of heuristic <feaspump>
constexpr Param< double > OBJFACTOR
factor by which the regard of the objective is decreased in each round, 1.0 for dynamic
constexpr Param< int > MAXSTALLLOOPS
maximal number of pumping rounds without fractionality improvement (-1: no limit)
constexpr Param< int > NEIGHBORHOODSIZE
radius (using Manhattan metric) of the neighborhood to be searched in stage 3
constexpr Param< int > PERTURBFREQ
number of iterations until a random perturbation is forced
constexpr Param< bool > BEFORECUTS
should the feasibility pump be called at root node before cut separation?
constexpr Param< bool > PERTSOLFOUND
should a random perturbation be performed if a feasible solution was found?
constexpr Param< bool > COPYCUTS
should all active cuts from cutpool be copied to constraints in subproblem?
constexpr Param< int > MINFLIPS
minimum number of random variables to flip, if a 1-cycle is encountered
constexpr Param< bool > USEFP20
should an iterative round-and-propagate scheme be used to find the integral points?
constexpr Param< int > PRIORITY
priority of heuristic <fixandinfer>
constexpr Param< int > FREQ
frequency for calling primal heuristic <fixandinfer> (-1: never, 0: only at depth freqofs)
constexpr Param< int > MINFIXINGS
minimal number of fixings to apply before dive may be aborted
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <fixandinfer> (-1: no limit)
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <fixandinfer>
constexpr Param< int > PROPROUNDS
maximal number of propagation rounds in probing subproblems (-1: no limit, 0: auto)
constexpr Param< double > LPRESOLVEDOMCHGQUOT
percentage of immediate domain changes during probing to trigger LP resolve
constexpr Param< double > MAXRELDEPTH
maximal relative depth to start diving
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <fracdiving> (-1: no limit)
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <fracdiving>
constexpr Param< bool > BACKTRACK
use one level of backtracking if infeasibility is encountered?
constexpr Param< int > MAXLPITEROFS
additional number of allowed LP iterations
constexpr Param< int > FREQ
frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
constexpr Param< double > MAXLPITERQUOT
maximal fraction of diving LP iterations compared to node LP iterations
constexpr Param< bool > ONLYLPBRANCHCANDS
should only LP branching candidates be considered instead of the slower but more general constraint h...
constexpr Param< double > MINRELDEPTH
minimal relative depth to start diving
constexpr Param< double > MAXDIVEUBQUOT
maximal quotient (curlowerbound - lowerbound)/(cutoffbound - lowerbound) where diving is performed (0...
constexpr Param< double > MAXDIVEAVGQUOTNOSOL
maximal AVGQUOT when no solution was found yet (0.0: no limit)
constexpr Param< int > LPSOLVEFREQ
LP solve frequency for diving heuristics (0: only after enough domain changes have been found)
constexpr Param< int > PRIORITY
priority of heuristic <fracdiving>
constexpr Param< double > MAXDIVEUBQUOTNOSOL
maximal UBQUOT when no solution was found yet (0.0: no limit)
constexpr Param< double > MAXDIVEAVGQUOT
maximal quotient (curlowerbound - lowerbound)/(avglowerbound - lowerbound) where diving is performed ...
constexpr Param< bool > FIXCONTVARS
should continuous variables outside the neighborhoods be fixed?
constexpr Param< int > MAXDISTANCE
maximum distance to selected variable to enter the subproblem, or -1 to select the distance that best...
constexpr Param< int > NODESOFS
number of nodes added to the contingent of the total nodes
constexpr Param< int > FREQ
frequency for calling primal heuristic <gins> (-1: never, 0: only at depth freqofs)
constexpr Param< double > OVERLAP
overlap of blocks between runs - 0.0: no overlap, 1.0: shift by only 1 block
constexpr Param< int > PRIORITY
priority of heuristic <gins>
constexpr Param< bool > COPYCUTS
if uselprows == FALSE, should all active cuts from cutpool be copied to constraints in subproblem?
constexpr Param< int > MAXNODES
maximum number of nodes to regard in the subproblem
constexpr Param< double > MINFIXINGRATE
percentage of integer variables that have to be fixed
constexpr Param< char > POTENTIAL
the reference point to compute the neighborhood potential: (r)oot, (l)ocal lp, or (p)seudo solution
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <gins>
constexpr Param< double > ROLLHORIZONLIMFAC
limiting percentage for variables already used in sub-SCIPs to terminate rolling horizon approach
constexpr Param< double > NODESQUOT
contingent of sub problem nodes in relation to the number of nodes of the original problem
constexpr Param< double > MINIMPROVE
factor by which gins should at least improve the incumbent
constexpr Param< bool > USEROLLINGHORIZON
should the heuristic solve a sequence of sub-MIP's around the first selected variable
constexpr Param< bool > USESELFALLBACK
should random initial variable selection be used if decomposition was not successful?
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <gins> (-1: no limit)
constexpr Param< bool > CONSECUTIVEBLOCKS
should blocks be treated consecutively (sorted by ascending label?)
constexpr Param< int > MINNODES
minimum number of nodes required to start the subproblem
constexpr Param< bool > USEDECOMP
should user decompositions be considered, if available?
constexpr Param< int > BESTSOLLIMIT
limit on number of improving incumbent solutions in sub-CIP
constexpr Param< int > NWAITINGNODES
number of nodes without incumbent change that heuristic should wait
constexpr Param< bool > RELAXDENSECONSS
should dense constraints (at least as dense as 1 - minfixingrate) be ignored by connectivity graph?
constexpr Param< bool > USEDECOMPROLLHORIZON
should user decompositions be considered for initial selection in rolling horizon,...
constexpr Param< bool > USELPROWS
should subproblem be created out of the rows in the LP rows?
constexpr Param< int > PRIORITY
priority of heuristic <guideddiving>
constexpr Param< double > LPRESOLVEDOMCHGQUOT
percentage of immediate domain changes during probing to trigger LP resolve
constexpr Param< bool > ONLYLPBRANCHCANDS
should only LP branching candidates be considered instead of the slower but more general constraint h...
constexpr Param< double > MINRELDEPTH
minimal relative depth to start diving
constexpr Param< double > MAXDIVEAVGQUOTNOSOL
maximal AVGQUOT when no solution was found yet (0.0: no limit)
constexpr Param< double > MAXDIVEUBQUOT
maximal quotient (curlowerbound - lowerbound)/(cutoffbound - lowerbound) where diving is performed (0...
constexpr Param< bool > BACKTRACK
use one level of backtracking if infeasibility is encountered?
constexpr Param< double > MAXRELDEPTH
maximal relative depth to start diving
constexpr Param< double > MAXDIVEAVGQUOT
maximal quotient (curlowerbound - lowerbound)/(avglowerbound - lowerbound) where diving is performed ...
constexpr Param< double > MAXLPITERQUOT
maximal fraction of diving LP iterations compared to node LP iterations
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <guideddiving> (-1: no limit)
constexpr Param< double > MAXDIVEUBQUOTNOSOL
maximal UBQUOT when no solution was found yet (0.0: no limit)
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <guideddiving>
constexpr Param< int > MAXLPITEROFS
additional number of allowed LP iterations
constexpr Param< int > FREQ
frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
constexpr Param< int > LPSOLVEFREQ
LP solve frequency for diving heuristics (0: only after enough domain changes have been found)
constexpr Param< bool > IMPROVESOLS
Try to improve other solutions by one-opt?
constexpr Param< int > PRIORITY
priority of heuristic <indicator>
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <indicator> (-1: no limit)
constexpr Param< bool > ONEOPT
whether the one-opt heuristic should be started
constexpr Param< int > FREQ
frequency for calling primal heuristic <indicator> (-1: never, 0: only at depth freqofs)
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <indicator>
constexpr Param< bool > BACKTRACK
use one level of backtracking if infeasibility is encountered?
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <intdiving>
constexpr Param< double > MAXLPITERQUOT
maximal fraction of diving LP iterations compared to node LP iterations
constexpr Param< double > MAXDIVEAVGQUOTNOSOL
maximal AVGQUOT when no solution was found yet (0.0: no limit)
constexpr Param< double > MAXDIVEUBQUOT
maximal quotient (curlowerbound - lowerbound)/(cutoffbound - lowerbound) where diving is performed (0...
constexpr Param< int > MAXLPITEROFS
additional number of allowed LP iterations
constexpr Param< int > PRIORITY
priority of heuristic <intdiving>
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <intdiving> (-1: no limit)
constexpr Param< double > MAXDIVEUBQUOTNOSOL
maximal UBQUOT when no solution was found yet (0.0: no limit)
constexpr Param< int > FREQ
frequency for calling primal heuristic <intdiving> (-1: never, 0: only at depth freqofs)
constexpr Param< double > MAXDIVEAVGQUOT
maximal quotient (curlowerbound - lowerbound)/(avglowerbound - lowerbound) where diving is performed ...
constexpr Param< double > MINRELDEPTH
minimal relative depth to start diving
constexpr Param< double > MAXRELDEPTH
maximal relative depth to start diving
constexpr Param< int > PRIORITY
priority of heuristic <intshifting>
constexpr Param< int > FREQ
frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <intshifting>
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <intshifting> (-1: no limit)
constexpr Param< bool > BACKTRACK
use one level of backtracking if infeasibility is encountered?
constexpr Param< int > FREQ
frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
constexpr Param< double > MAXDIVEUBQUOT
maximal quotient (curlowerbound - lowerbound)/(cutoffbound - lowerbound) where diving is performed (0...
constexpr Param< double > MAXRELDEPTH
maximal relative depth to start diving
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <linesearchdiving>
constexpr Param< double > MAXDIVEUBQUOTNOSOL
maximal UBQUOT when no solution was found yet (0.0: no limit)
constexpr Param< bool > ONLYLPBRANCHCANDS
should only LP branching candidates be considered instead of the slower but more general constraint h...
constexpr Param< int > PRIORITY
priority of heuristic <linesearchdiving>
constexpr Param< int > LPSOLVEFREQ
LP solve frequency for diving heuristics (0: only after enough domain changes have been found)
constexpr Param< double > MAXDIVEAVGQUOTNOSOL
maximal AVGQUOT when no solution was found yet (0.0: no limit)
constexpr Param< double > LPRESOLVEDOMCHGQUOT
percentage of immediate domain changes during probing to trigger LP resolve
constexpr Param< double > MINRELDEPTH
minimal relative depth to start diving
constexpr Param< int > MAXLPITEROFS
additional number of allowed LP iterations
constexpr Param< double > MAXLPITERQUOT
maximal fraction of diving LP iterations compared to node LP iterations
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <linesearchdiving> (-1: no limit)
constexpr Param< double > MAXDIVEAVGQUOT
maximal quotient (curlowerbound - lowerbound)/(avglowerbound - lowerbound) where diving is performed ...
constexpr Param< double > LPLIMFAC
factor by which the limit on the number of LP depends on the node limit
constexpr Param< bool > COPYCUTS
if uselprows == FALSE, should all active cuts from cutpool be copied to constraints in subproblem?
constexpr Param< int > NWAITINGNODES
number of nodes without incumbent change that heuristic should wait
constexpr Param< double > NODESQUOT
contingent of sub problem nodes in relation to the number of nodes of the original problem
constexpr Param< int > FREQ
frequency for calling primal heuristic <localbranching> (-1: never, 0: only at depth freqofs)
constexpr Param< double > MINIMPROVE
factor by which localbranching should at least improve the incumbent
constexpr Param< int > MINNODES
minimum number of nodes required to start the subproblem
constexpr Param< int > BESTSOLLIMIT
limit on number of improving incumbent solutions in sub-CIP
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <localbranching>
constexpr Param< bool > USELPROWS
should subproblem be created out of the rows in the LP rows?
constexpr Param< int > PRIORITY
priority of heuristic <localbranching>
constexpr Param< int > MAXNODES
maximum number of nodes to regard in the subproblem
constexpr Param< int > NEIGHBORHOODSIZE
radius (using Manhattan metric) of the incumbent's neighborhood to be searched
constexpr Param< int > NODESOFS
number of nodes added to the contingent of the total nodes
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <localbranching> (-1: no limit)
constexpr Param< double > MINFIXINGRATE
minimum percentage of integer variables that have to be fixable
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <locks> (-1: no limit)
constexpr Param< double > NODESQUOT
contingent of sub problem nodes in relation to the number of nodes of the original problem
constexpr Param< double > MINFIXINGRATELP
minimum fixing rate over all variables (including continuous) to solve LP
constexpr Param< int > PRIORITY
priority of heuristic <locks>
constexpr Param< double > ROUNDUPPROBABILITY
probability for rounding a variable up in case of ties
constexpr Param< double > MINIMPROVE
factor by which locks heuristic should at least improve the incumbent
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <locks>
constexpr Param< int > MAXPROPROUNDS
maximum number of propagation rounds to be performed in each propagation call (-1: no limit,...
constexpr Param< long long > MAXNODES
maximum number of nodes to regard in the subproblem
constexpr Param< bool > UPDATELOCKS
should the locks be updated based on LP rows?
constexpr Param< bool > USEFINALSUBMIP
should a final sub-MIP be solved to costruct a feasible solution if the LP was not roundable?
constexpr Param< long long > MINNODES
minimum number of nodes required to start the subproblem
constexpr Param< bool > COPYCUTS
should all active cuts from cutpool be copied to constraints in subproblem?
constexpr Param< int > FREQ
frequency for calling primal heuristic <locks> (-1: never, 0: only at depth freqofs)
constexpr Param< long long > NODESOFS
number of nodes added to the contingent of the total nodes
constexpr Param< long long > MAXNODES
maximum number of nodes to regard in the subproblem
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <lpface>
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <lpface> (-1: no limit)
constexpr Param< char > SUBSCIPOBJECTIVE
objective function in the sub-SCIP: (z)ero, (r)oot-LP-difference, (i)nference, LP (f)ractionality,...
constexpr Param< long long > NODESOFS
number of nodes added to the contingent of the total nodes
constexpr Param< bool > COPYCUTS
if uselprows == FALSE, should all active cuts from cutpool be copied to constraints in subproblem?
constexpr Param< double > MINFIXINGRATE
required percentage of fixed integer variables in sub-MIP to run
constexpr Param< int > PRIORITY
priority of heuristic <lpface>
constexpr Param< bool > DUALBASISEQUATIONS
should dually nonbasic rows be turned into equations?
constexpr Param< bool > USELPROWS
should subproblem be created out of the rows in the LP rows?
constexpr Param< double > NODESQUOT
contingent of sub problem nodes in relation to the number of nodes of the original problem
constexpr Param< int > FREQ
frequency for calling primal heuristic <lpface> (-1: never, 0: only at depth freqofs)
constexpr Param< double > LPLIMFAC
factor by which the limit on the number of LP depends on the node limit
constexpr Param< bool > KEEPSUBSCIP
should the heuristic continue solving the same sub-SCIP?
constexpr Param< int > MINPATHLEN
the minimum active search tree path length along which lower bound hasn't changed before heuristic be...
constexpr Param< long long > MINNODES
minimum number of nodes required to start the subproblem
constexpr Param< double > SUBNLPTRIGGER
maximum number of NLP iterations per solve
constexpr Param< double > MINIMPROVE
factor by which heuristic should at least improve the incumbent
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <mpec>
constexpr Param< double > SIGMA
regularization update factor
constexpr Param< int > PRIORITY
priority of heuristic <mpec>
constexpr Param< double > MAXNLPCOST
maximum cost available for solving NLPs per call of the heuristic
constexpr Param< int > MAXNLPITER
maximum number of NLP iterations per solve
constexpr Param< int > MAXNUNSUCC
maximum number of consecutive calls for which the heuristic did not find an improving solution
constexpr Param< int > MAXITER
maximum number of iterations of the MPEC loop
constexpr Param< double > INITTHETA
initial regularization right-hand side value
constexpr Param< int > FREQ
frequency for calling primal heuristic <mpec> (-1: never, 0: only at depth freqofs)
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <mpec> (-1: no limit)
constexpr Param< double > MINGAPLEFT
minimum amount of gap left in order to call the heuristic
constexpr Param< bool > ONLYNLPS
should the heuristic run only on continuous problems?
constexpr Param< int > PRIORITY
priority of heuristic <multistart>
constexpr Param< double > MINIMPRFAC
minimum required improving factor to proceed in improvement of a single point
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <multistart>
constexpr Param< int > MINIMPRITER
number of iteration when checking the minimum improvement
constexpr Param< int > MAXITER
number of iterations to reduce the maximum violation of a point
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <multistart> (-1: no limit)
constexpr Param< double > MAXBOUNDSIZE
maximum variable domain size for unbounded variables
constexpr Param< int > NRNDPOINTS
number of random points generated per execution call
constexpr Param< double > GRADLIMIT
limit for gradient computations for all improvePoint() calls (0 for no limit)
constexpr Param< int > FREQ
frequency for calling primal heuristic <multistart> (-1: never, 0: only at depth freqofs)
constexpr Param< double > MAXRELDIST
maximum distance between two points in the same cluster
constexpr Param< int > MAXNCLUSTER
maximum number of considered clusters per heuristic call
constexpr Param< int > BESTSOLLIMIT
limit on number of improving incumbent solutions in sub-CIP
constexpr Param< double > NODESQUOT
contingent of sub problem nodes in relation to the number of nodes of the original problem
constexpr Param< int > MAXNODES
maximum number of nodes to regard in the subproblem
constexpr Param< bool > USEUCT
should uct node selection be used at the beginning of the search?
constexpr Param< bool > USELPROWS
should subproblem be created out of the rows in the LP rows?
constexpr Param< int > NWAITINGNODES
number of nodes without incumbent change that heuristic should wait
constexpr Param< double > MINFIXINGRATE
percentage of integer variables that have to be fixed
constexpr Param< double > MINIMPROVE
factor by which mutation should at least improve the incumbent
constexpr Param< int > MINNODES
minimum number of nodes required to start the subproblem
constexpr Param< int > NODESOFS
number of nodes added to the contingent of the total nodes
constexpr Param< int > PRIORITY
priority of heuristic <mutation>
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <mutation>
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <mutation> (-1: no limit)
constexpr Param< bool > COPYCUTS
if uselprows == FALSE, should all active cuts from cutpool be copied to constraints in subproblem?
constexpr Param< int > FREQ
frequency for calling primal heuristic <mutation> (-1: never, 0: only at depth freqofs)
constexpr Param< double > MINRELDEPTH
minimal relative depth to start diving
constexpr Param< bool > PREFERLPFRACS
prefer variables that are also fractional in LP solution?
constexpr Param< double > MINSUCCQUOT
heuristic will not run if less then this percentage of calls succeeded (0.0: no limit)
constexpr Param< bool > NLPFASTFAIL
should the NLP solver stop early if it converges slow?
constexpr Param< int > MAXNLPITERREL
additional allowed number of NLP iterations relative to successfully found solutions
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <nlpdiving>
constexpr Param< double > MAXDIVEUBQUOTNOSOL
maximal UBQUOT when no solution was found yet (0.0: no limit)
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <nlpdiving> (-1: no limit)
constexpr Param< double > MAXDIVEAVGQUOT
maximal quotient (curlowerbound - lowerbound)/(avglowerbound - lowerbound) where diving is performed ...
constexpr Param< char > VARSELRULE
which variable selection should be used? ('f'ractionality, 'c'oefficient, 'p'seudocost,...
constexpr Param< double > MAXDIVEUBQUOT
maximal quotient (curlowerbound - lowerbound)/(cutoffbound - lowerbound) where diving is performed (0...
constexpr Param< char > NLPSTART
which point should be used as starting point for the NLP solver? ('n'one, last 'f'easible,...
constexpr Param< bool > SOLVESUBMIP
should a sub-MIP be solved if all cover variables are fixed?
constexpr Param< double > MAXRELDEPTH
maximal relative depth to start diving
constexpr Param< int > MAXNLPITERABS
minimial absolute number of allowed NLP iterations
constexpr Param< bool > BACKTRACK
use one level of backtracking if infeasibility is encountered?
constexpr Param< int > MAXFEASNLPS
maximal number of NLPs with feasible solution to solve during one dive
constexpr Param< double > MAXDIVEAVGQUOTNOSOL
maximal AVGQUOT when no solution was found yet (0.0: no limit)
constexpr Param< bool > PREFERCOVER
should variables in a minimal cover be preferred?
constexpr Param< int > PRIORITY
priority of heuristic <nlpdiving>
constexpr Param< double > FIXQUOT
percentage of fractional variables that should be fixed before the next NLP solve
constexpr Param< int > FREQ
frequency for calling primal heuristic <nlpdiving> (-1: never, 0: only at depth freqofs)
constexpr Param< bool > LP
should the LP relaxation be solved before the NLP relaxation?
constexpr Param< int > FREQ
frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
constexpr Param< int > PRIORITY
priority of heuristic <objpscostdiving>
constexpr Param< double > DEPTHFAC
maximal diving depth: number of binary/integer variables times depthfac
constexpr Param< double > DEPTHFACNOSOL
maximal diving depth factor if no feasible solution was found yet
constexpr Param< int > MAXSOLS
total number of feasible solutions found up to which heuristic is called (-1: no limit)
constexpr Param< int > MAXLPITEROFS
additional number of allowed LP iterations
constexpr Param< double > MAXLPITERQUOT
maximal fraction of diving LP iterations compared to total iteration number
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <objpscostdiving>
constexpr Param< double > MAXRELDEPTH
maximal relative depth to start diving
constexpr Param< double > MINRELDEPTH
minimal relative depth to start diving
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <objpscostdiving> (-1: no limit)
constexpr Param< bool > USEDIFFRAY
should the difference between the root solution and the current LP solution be used as one ray direct...
constexpr Param< bool > USEAVGRAY
should the average of the basic cone be used as one ray direction?
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <octane> (-1: no limit)
constexpr Param< int > PRIORITY
priority of heuristic <octane>
constexpr Param< int > FMAX
number of 0-1-points to be tested as possible solutions by OCTANE
constexpr Param< int > FREQ
frequency for calling primal heuristic <octane> (-1: never, 0: only at depth freqofs)
constexpr Param< bool > USEFRACSPACE
execute OCTANE only in the space of fractional variables (TRUE) or in the full space?
constexpr Param< int > FFIRST
number of 0-1-points to be tested at first whether they violate a common row
constexpr Param< bool > USEOBJRAY
should the inner normal of the objective be used as one ray direction?
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <octane>
constexpr Param< bool > USEAVGNBRAY
should the weighted average of the nonbasic cone be used as one ray direction?
constexpr Param< bool > USEAVGWGTRAY
should the weighted average of the basic cone be used as one ray direction?
constexpr Param< bool > ADDALLSOLS
should all subproblem solutions be added to the original SCIP?
constexpr Param< long long > MINNODES
minimum number of nodes required to start the subproblem
constexpr Param< bool > COPYCUTS
should all active cuts from cutpool be copied to constraints in subproblem?
constexpr Param< double > NODESQUOT
contingent of sub problem nodes in relation to the number of nodes of the original problem
constexpr Param< long long > NODESOFS
number of nodes added to the contingent of the total nodes
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <ofins>
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <ofins> (-1: no limit)
constexpr Param< double > MAXCHANGERATE
maximal rate of changed coefficients
constexpr Param< double > MAXCHANGE
maximal rate of change per coefficient to get fixed
constexpr Param< double > MINIMPROVE
factor by which RENS should at least improve the incumbent
constexpr Param< long long > MAXNODES
maximum number of nodes to regard in the subproblem
constexpr Param< double > LPLIMFAC
factor by which the limit on the number of LP depends on the node limit
constexpr Param< int > PRIORITY
priority of heuristic <ofins>
constexpr Param< int > FREQ
frequency for calling primal heuristic <ofins> (-1: never, 0: only at depth freqofs)
constexpr Param< bool > USELOOP
should the heuristic continue to run as long as improvements are found?
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <oneopt>
constexpr Param< int > PRIORITY
priority of heuristic <oneopt>
constexpr Param< bool > BEFOREPRESOL
should the heuristic be called before presolving?
constexpr Param< bool > DURINGROOT
should the heuristic be called before and during the root node?
constexpr Param< bool > WEIGHTEDOBJ
should the objective be weighted with the potential shifting value when sorting the shifting candidat...
constexpr Param< bool > FORCELPCONSTRUCTION
should the construction of the LP be forced even if LP solving is deactivated?
constexpr Param< int > FREQ
frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <oneopt> (-1: no limit)
constexpr Param< int > ADMITERATIONS
maximal number of ADM iterations in each penalty loop
constexpr Param< long long > MAXNODES
maximum number of nodes to regard in all subproblems
constexpr Param< int > PRIORITY
priority of heuristic <padm>
constexpr Param< bool > SCALING
enable sigmoid rescaling of penalty parameters
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <padm> (-1: no limit)
constexpr Param< bool > ASSIGNLINKING
should linking constraints be assigned?
constexpr Param< bool > ORIGINAL
should the original problem be used? This is only for testing and not recommended!
constexpr Param< int > PENALTYITERATIONS
maximal number of penalty iterations
constexpr Param< int > TIMING
should the heuristic run before or after the processing of the node? (0: before, 1: after,...
constexpr Param< double > NODEFAC
factor to control nodelimits of subproblems
constexpr Param< int > FREQ
frequency for calling primal heuristic <padm> (-1: never, 0: only at depth freqofs)
constexpr Param< bool > REOPTIMIZE
should the problem get reoptimized with the original objective function?
constexpr Param< long long > MINNODES
minimum number of nodes to regard in one subproblem
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <padm>
constexpr Param< double > GAP
mipgap at start
constexpr Param< long long > MAXLPITERS
maximum number of LP iterations to be performed in the subproblem
constexpr Param< int > FREQ
frequency for calling primal heuristic <proximity> (-1: never, 0: only at depth freqofs)
constexpr Param< double > NODESQUOT
sub-MIP node limit w.r.t number of original nodes
constexpr Param< bool > RESTART
should the heuristic immediately run again on its newly found solution?
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <proximity> (-1: no limit)
constexpr Param< long long > WAITINGNODES
waiting nodes since last incumbent before heuristic is executed
constexpr Param< bool > USEFINALLP
should the heuristic solve a final LP in case of continuous objective variables?
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <proximity>
constexpr Param< long long > MAXNODES
maximum number of nodes to regard in the subproblem
constexpr Param< double > MINGAP
minimum primal-dual gap for which the heuristic is executed
constexpr Param< int > PRIORITY
priority of heuristic <proximity>
constexpr Param< long long > MINLPITERS
minimum number of LP iterations performed in subproblem
constexpr Param< bool > USEUCT
should uct node selection be used at the beginning of the search?
constexpr Param< double > BINVARQUOT
threshold for percentage of binary variables required to start
constexpr Param< double > LPITERSQUOT
quotient of sub-MIP LP iterations with respect to LP iterations so far
constexpr Param< double > MINIMPROVE
factor by which proximity should at least improve the incumbent
constexpr Param< long long > MINNODES
minimum number of nodes required to start the subproblem
constexpr Param< bool > USELPROWS
should subproblem be constructed based on LP row information?
constexpr Param< long long > NODESOFS
number of nodes added to the contingent of the total nodes
constexpr Param< bool > ONLYLPBRANCHCANDS
should only LP branching candidates be considered instead of the slower but more general constraint h...
constexpr Param< double > MAXDIVEAVGQUOT
maximal quotient (curlowerbound - lowerbound)/(avglowerbound - lowerbound) where diving is performed ...
constexpr Param< double > MAXRELDEPTH
maximal relative depth to start diving
constexpr Param< int > MAXLPITEROFS
additional number of allowed LP iterations
constexpr Param< double > MAXDIVEAVGQUOTNOSOL
maximal AVGQUOT when no solution was found yet (0.0: no limit)
constexpr Param< int > PRIORITY
priority of heuristic <pscostdiving>
constexpr Param< double > MAXDIVEUBQUOTNOSOL
maximal UBQUOT when no solution was found yet (0.0: no limit)
constexpr Param< int > FREQ
frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
constexpr Param< double > MAXLPITERQUOT
maximal fraction of diving LP iterations compared to node LP iterations
constexpr Param< bool > BACKTRACK
use one level of backtracking if infeasibility is encountered?
constexpr Param< double > MINRELDEPTH
minimal relative depth to start diving
constexpr Param< double > MAXDIVEUBQUOT
maximal quotient (curlowerbound - lowerbound)/(cutoffbound - lowerbound) where diving is performed (0...
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <pscostdiving>
constexpr Param< int > LPSOLVEFREQ
LP solve frequency for diving heuristics (0: only after enough domain changes have been found)
constexpr Param< double > LPRESOLVEDOMCHGQUOT
percentage of immediate domain changes during probing to trigger LP resolve
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <pscostdiving> (-1: no limit)
constexpr Param< bool > PROPAGATEONLYROOT
should the probing part of the heuristic be applied exclusively at the root node?
constexpr Param< int > FREQ
frequency for calling primal heuristic <randrounding> (-1: never, 0: only at depth freqofs)
constexpr Param< int > MAXPROPROUNDS
limit of rounds for each propagation call
constexpr Param< bool > USESIMPLEROUNDING
should the heuristic apply the variable lock strategy of simple rounding, if possible?
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <randrounding>
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <randrounding> (-1: no limit)
constexpr Param< bool > ONCEPERNODE
should the heuristic only be called once per node?
constexpr Param< int > PRIORITY
priority of heuristic <randrounding>
constexpr Param< long long > NODESOFS
number of nodes added to the contingent of the total nodes
constexpr Param< char > STARTSOL
solution that is used for fixing values ('l'p relaxation, 'n'lp relaxation)
constexpr Param< bool > BINARYBOUNDS
should general integers get binary bounds [floor(.),ceil(.)] ?
constexpr Param< bool > USEUCT
should uct node selection be used at the beginning of the search?
constexpr Param< bool > COPYCUTS
if uselprows == FALSE, should all active cuts from cutpool be copied to constraints in subproblem?
constexpr Param< bool > USELPROWS
should subproblem be created out of the rows in the LP rows?
constexpr Param< int > FREQ
frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
constexpr Param< double > NODESQUOT
contingent of sub problem nodes in relation to the number of nodes of the original problem
constexpr Param< double > LPLIMFAC
factor by which the limit on the number of LP depends on the node limit
constexpr Param< double > MINIMPROVE
factor by which RENS should at least improve the incumbent
constexpr Param< bool > ADDALLSOLS
should all subproblem solutions be added to the original SCIP?
constexpr Param< long long > MINNODES
minimum number of nodes required to start the subproblem
constexpr Param< int > PRIORITY
priority of heuristic <rens>
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <rens>
constexpr Param< int > BESTSOLLIMIT
limit on number of improving incumbent solutions in sub-CIP
constexpr Param< double > MINFIXINGRATE
minimum percentage of integer variables that have to be fixable
constexpr Param< bool > EXTRATIME
should the RENS sub-CIP get its own full time limit? This is only for testing and not recommended!
constexpr Param< long long > MAXNODES
maximum number of nodes to regard in the subproblem
constexpr Param< bool > FULLSCALE
should the RENS sub-CIP be solved with cuts, conflicts, strong branching,... This is only for testing...
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <rens> (-1: no limit)
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <reoptsols>
constexpr Param< int > FREQ
frequency for calling primal heuristic <reoptsols> (-1: never, 0: only at depth freqofs)
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <reoptsols> (-1: no limit)
constexpr Param< int > MAXRUNS
check solutions of the last k runs. (-1: all)
constexpr Param< int > PRIORITY
priority of heuristic <reoptsols>
constexpr Param< int > MAXSOLS
maximal number solutions which should be checked. (-1: all)
constexpr Param< bool > USESLACKVARS
should slack variables be used in repair subproblem?
constexpr Param< double > NODESQUOT
contingent of sub problem nodes in relation to the number of nodes of the original problem
constexpr Param< int > PRIORITY
priority of heuristic <repair>
constexpr Param< double > MINFIXINGRATE
minimum percentage of integer variables that have to be fixed
constexpr Param< int > MINNODES
minimum number of nodes required to start the subproblem
constexpr Param< std::string > FILENAME
file name of a solution to be used as infeasible starting point, [-] if not available
constexpr Param< int > NODESOFS
number of nodes added to the contingent of the total nodes
constexpr Param< bool > USEOBJFACTOR
should a scaled objective function for original variables be used in repair subproblem?
constexpr Param< int > FREQ
frequency for calling primal heuristic <repair> (-1: never, 0: only at depth freqofs)
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <repair>
constexpr Param< bool > ROUNDIT
True : fractional variables which are not fractional in the given solution are rounded,...
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <repair> (-1: no limit)
constexpr Param< bool > USEVARFIX
should variable fixings be used in repair subproblem?
constexpr Param< int > MAXNODES
maximum number of nodes to regard in the subproblem
constexpr Param< double > ALPHA
factor for the potential of var fixings
constexpr Param< double > MINIMPROVE
factor by which rins should at least improve the incumbent
constexpr Param< int > NWAITINGNODES
number of nodes without incumbent change that heuristic should wait
constexpr Param< double > NODESQUOT
contingent of sub problem nodes in relation to the number of nodes of the original problem
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <rins> (-1: no limit)
constexpr Param< int > MAXNODES
maximum number of nodes to regard in the subproblem
constexpr Param< int > MINNODES
minimum number of nodes required to start the subproblem
constexpr Param< int > PRIORITY
priority of heuristic <rins>
constexpr Param< int > FREQ
frequency for calling primal heuristic <rins> (-1: never, 0: only at depth freqofs)
constexpr Param< double > MINFIXINGRATE
minimum percentage of integer variables that have to be fixed
constexpr Param< double > LPLIMFAC
factor by which the limit on the number of LP depends on the node limit
constexpr Param< bool > USEUCT
should uct node selection be used at the beginning of the search?
constexpr Param< bool > COPYCUTS
if uselprows == FALSE, should all active cuts from cutpool be copied to constraints in subproblem?
constexpr Param< int > NODESOFS
number of nodes added to the contingent of the total nodes
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <rins>
constexpr Param< bool > USELPROWS
should subproblem be created out of the rows in the LP rows?
constexpr Param< double > DEPTHFACNOSOL
maximal diving depth factor if no feasible solution was found yet
constexpr Param< double > DEPTHFAC
maximal diving depth: number of binary/integer variables times depthfac
constexpr Param< int > FREQ
frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
constexpr Param< int > MAXLPITEROFS
additional number of allowed LP iterations
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <rootsoldiving>
constexpr Param< double > MAXRELDEPTH
maximal relative depth to start diving
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <rootsoldiving> (-1: no limit)
constexpr Param< double > ALPHA
soft rounding factor to fade out objective coefficients
constexpr Param< int > PRIORITY
priority of heuristic <rootsoldiving>
constexpr Param< double > MINRELDEPTH
minimal relative depth to start diving
constexpr Param< int > MAXSOLS
total number of feasible solutions found up to which heuristic is called (-1: no limit)
constexpr Param< double > MAXLPITERQUOT
maximal fraction of diving LP iterations compared to node LP iterations
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <rounding> (-1: no limit)
constexpr Param< int > SUCCESSFACTOR
number of calls per found solution that are considered as standard success, a higher factor causes th...
constexpr Param< int > PRIORITY
priority of heuristic <rounding>
constexpr Param< bool > ONCEPERNODE
should the heuristic only be called once per node?
constexpr Param< int > FREQ
frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <rounding>
constexpr Param< bool > PREFERBINARIES
Should binary variables be shifted first?
constexpr Param< bool > SORTVARS
Should variables be sorted for the heuristic?
constexpr Param< int > FREQ
frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <shiftandpropagate> (-1: no limit)
constexpr Param< bool > IMPLISCONTINUOUS
should implicit integer variables be treated as continuous variables?
constexpr Param< bool > RELAX
Should continuous variables be relaxed?
constexpr Param< bool > FIXBINLOCKS
should binary variables with no locks in one direction be fixed to that direction?
constexpr Param< double > MINFIXINGRATELP
minimum fixing rate over all variables (including continuous) to solve LP
constexpr Param< int > PRIORITY
priority of heuristic <shiftandpropagate>
constexpr Param< bool > SELECTBEST
should the heuristic choose the best candidate in every round? (set to FALSE for static order)?
constexpr Param< bool > STOPAFTERFEASIBLE
Should the heuristic stop calculating optimal shift values when no more rows are violated?
constexpr Param< bool > COLLECTSTATS
should variable statistics be collected during probing?
constexpr Param< int > CUTOFFBREAKER
The number of cutoffs before heuristic stops.
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <shiftandpropagate>
constexpr Param< char > SORTKEY
the key for variable sorting: (n)orms down, norms (u)p, (v)iolations down, viola(t)ions up,...
constexpr Param< int > NPROPROUNDS
The number of propagation rounds used for each propagation.
constexpr Param< bool > PROBING
Should domains be reduced by probing?
constexpr Param< bool > ONLYWITHOUTSOL
Should heuristic only be executed if no primal solution was found, yet?
constexpr Param< bool > NORMALIZE
should coefficients and left/right hand sides be normalized by max row coeff?
constexpr Param< bool > BINLOCKSFIRST
should binary variables with no locks be preferred in the ordering?
constexpr Param< double > MAXCUTOFFQUOT
maximum percentage of allowed cutoffs before stopping the heuristic
constexpr Param< bool > NOZEROFIXING
should variables with a zero shifting value be delayed instead of being fixed?
constexpr Param< bool > UPDATEWEIGHTS
should row weight be increased every time the row is violated?
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <shifting> (-1: no limit)
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <shifting>
constexpr Param< int > PRIORITY
priority of heuristic <shifting>
constexpr Param< int > FREQ
frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <simplerounding>
constexpr Param< int > PRIORITY
priority of heuristic <simplerounding>
constexpr Param< int > FREQ
frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <simplerounding> (-1: no limit)
constexpr Param< bool > ONCEPERNODE
should the heuristic only be called once per node?
constexpr Param< int > ITERMIN
minimal number of iterations for NLP solves
constexpr Param< bool > FORBIDFIXINGS
whether to add constraints that forbid specific fixings that turned out to be infeasible
constexpr Param< double > FEASTOLFACTOR
factor on SCIP feasibility tolerance for NLP solves if resolving when NLP solution not feasible in CI...
constexpr Param< int > NODESOFFSET
number of nodes added to the current number of nodes when computing itercontingent (higher value runs...
constexpr Param< int > FREQ
frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
constexpr Param< int > NLPVERBLEVEL
verbosity level of NLP solver
constexpr Param< double > EXPECTINFEAS
percentage of NLP solves with infeasible status required to tell NLP solver to expect an infeasible N...
constexpr Param< int > ITERINIT
number of iterations used for initial NLP solves
constexpr Param< double > NODESFACTOR
factor on number of nodes in SCIP (plus nodesoffset) to compute itercontingent (higher value runs heu...
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <subnlp>
constexpr Param< bool > SETCUTOFF
whether to set cutoff in sub-SCIP to current primal bound
constexpr Param< int > PRIORITY
priority of heuristic <subnlp>
constexpr Param< double > SUCCESSRATEEXP
exponent for power of success rate to be multiplied with itercontingent (lower value decreases impact...
constexpr Param< double > OPTTOL
absolute optimality tolerance to use for NLP solves
constexpr Param< int > NINITSOLVES
number of successful NLP solves until switching to iterlimit guess and using success rate
constexpr Param< bool > KEEPCOPY
whether to keep SCIP copy or to create new copy each time heuristic is applied
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <subnlp> (-1: no limit)
constexpr Param< int > MAXPRESOLVEROUNDS
limit on number of presolve rounds in sub-SCIP (-1 for unlimited, 0 for no presolve)
constexpr Param< int > PRESOLVEEMPHASIS
presolve emphasis in sub-SCIP (0: default, 1: aggressive, 2: fast, 3: off)
constexpr Param< int > FREQ
frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <trivial>
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <trivial> (-1: no limit)
constexpr Param< int > PRIORITY
priority of heuristic <trivial>
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <trivialnegation> (-1: no limit)
constexpr Param< int > FREQ
frequency for calling primal heuristic <trivialnegation> (-1: never, 0: only at depth freqofs)
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <trivialnegation>
constexpr Param< int > PRIORITY
priority of heuristic <trivialnegation>
constexpr Param< bool > USELPROWS
should subproblem be created out of the rows in the LP rows?
constexpr Param< double > VIOLPENALTY
the penalty for each change in the binary variables from the candidate solution
constexpr Param< int > FREQ
frequency for calling primal heuristic <trustregion> (-1: never, 0: only at depth freqofs)
constexpr Param< double > OBJMINIMPROVE
the minimum absolute improvement in the objective function value
constexpr Param< double > NODESQUOT
contingent of sub problem nodes in relation to the number of nodes of the original problem
constexpr Param< int > PRIORITY
priority of heuristic <trustregion>
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <trustregion> (-1: no limit)
constexpr Param< double > LPLIMFAC
factor by which the limit on the number of LP depends on the node limit
constexpr Param< int > BESTSOLLIMIT
limit on number of improving incumbent solutions in sub-CIP
constexpr Param< bool > COPYCUTS
if uselprows == FALSE, should all active cuts from cutpool be copied to constraints in subproblem?
constexpr Param< int > MINBINVARS
the number of binary variables necessary to run the heuristic
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <trustregion>
constexpr Param< int > MAXNODES
maximum number of nodes to regard in the subproblem
constexpr Param< int > MINNODES
minimum number of nodes required to start the subproblem
constexpr Param< int > NWAITINGNODES
number of nodes without incumbent change that heuristic should wait
constexpr Param< int > NODESOFS
number of nodes added to the contingent of the total nodes
constexpr Param< int > PRIORITY
priority of heuristic <trysol>
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <trysol>
constexpr Param< int > FREQ
frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <trysol> (-1: no limit)
constexpr Param< int > PRIORITY
priority of heuristic <twoopt>
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <twoopt>
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <twoopt> (-1: no limit)
constexpr Param< int > MAXNSLAVES
maximum number of slaves for one master variable
constexpr Param< int > FREQ
frequency for calling primal heuristic <twoopt> (-1: never, 0: only at depth freqofs)
constexpr Param< double > MATCHINGRATE
parameter to determine the percentage of rows two variables have to share before they are considered ...
constexpr Param< int > WAITINGNODES
user parameter to determine number of nodes to wait after last best solution before calling heuristic
constexpr Param< bool > INTOPT
Should Integer-2-Optimization be applied or not?
constexpr Param< std::string > FIXINGALTS
prioritized sequence of fixing values used ('l'p relaxation, 'n'lp relaxation, 'i'ncumbent solution)
constexpr Param< char > FIXINGORDER
order in which variables should be fixed (increasing 'C'onflict score, decreasing 'c'onflict score,...
constexpr Param< char > COVERINGOBJ
objective function of the covering problem (influenced nonlinear 'c'onstraints/'t'erms,...
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <undercover> (-1: no limit)
constexpr Param< double > RECOVERDIV
fraction of covering variables in the last cover which need to change their value when recovering
constexpr Param< double > MINIMPROVE
factor by which the heuristic should at least improve the incumbent
constexpr Param< long long > MINNODES
minimum number of nodes required to start the subproblem
constexpr Param< bool > FIXINTFIRST
should integer variables in the cover be fixed first?
constexpr Param< int > FREQ
frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
constexpr Param< long long > MAXNODES
maximum number of nodes to regard in the subproblem
constexpr Param< int > MINCOVEREDABS
minimum number of nonlinear constraints in the original problem
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <undercover>
constexpr Param< bool > LOCKSROUNDING
shall LP values for integer vars be rounded according to locks?
constexpr Param< bool > COPYCUTS
should all active cuts from cutpool be copied to constraints in subproblem?
constexpr Param< bool > COVERBD
should bounddisjunction constraints be covered (or just copied)?
constexpr Param< int > MAXRECOVERS
maximum number of recoverings
constexpr Param< double > MAXCOVERSIZECONSS
maximum coversize (as ratio to the percentage of non-affected constraints)
constexpr Param< double > NODESQUOT
contingent of sub problem nodes in relation to the number of nodes of the original problem
constexpr Param< double > MAXCOVERSIZEVARS
maximum coversize (as fraction of total number of variables)
constexpr Param< bool > BEFORECUTS
should the heuristic be called at root node before cut separation?
constexpr Param< bool > ONLYCONVEXIFY
should we only fix variables in order to obtain a convex problem?
constexpr Param< int > MAXBACKTRACKS
maximum number of backtracks in fix-and-propagate
constexpr Param< long long > NODESOFS
number of nodes added to the contingent of the total nodes
constexpr Param< double > INFERENCEWEIGHT
weight for inference score in fixing order
constexpr Param< bool > POSTNLP
should the NLP heuristic be called to polish a feasible solution?
constexpr Param< int > MAXREORDERS
maximum number of reorderings of the fixing order
constexpr Param< double > CUTOFFWEIGHT
weight for cutoff score in fixing order
constexpr Param< double > CONFLICTWEIGHT
weight for conflict score in fixing order
constexpr Param< double > MINCOVEREDREL
minimum percentage of nonlinear constraints in the original problem
constexpr Param< bool > REUSECOVER
shall the cover be reused if a conflict was added after an infeasible subproblem?
constexpr Param< int > PRIORITY
priority of heuristic <undercover>
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <vbounds> (-1: no limit)
constexpr Param< long long > NODESOFS
number of nodes added to the contingent of the total nodes
constexpr Param< int > MAXBACKTRACKS
maximum number of backtracks during the fixing process
constexpr Param< double > MINIMPROVE
factor by which vbounds heuristic should at least improve the incumbent
constexpr Param< long long > MINNODES
minimum number of nodes required to start the subproblem
constexpr Param< int > MAXPROPROUNDS
maximum number of propagation rounds during probing (-1 infinity)
constexpr Param< long long > MAXNODES
maximum number of nodes to regard in the subproblem
constexpr Param< double > MINMIPFIXINGRATE
minimum percentage of variables that have to be fixed within sub-SCIP (integer and continuous)
constexpr Param< bool > USELOCKFIXINGS
should more variables be fixed based on variable locks if the fixing rate was not reached?
constexpr Param< int > FREQ
frequency for calling primal heuristic <vbounds> (-1: never, 0: only at depth freqofs)
constexpr Param< bool > COPYCUTS
should all active cuts from cutpool be copied to constraints in subproblem?
constexpr Param< int > TIGHTENVARIANT
which tightening variants of the vbounds heuristic should be called? (0: off, 1: w/o looking at obj,...
constexpr Param< int > PRIORITY
priority of heuristic <vbounds>
constexpr Param< double > NODESQUOT
contingent of sub problem nodes in relation to the number of nodes of the original problem
constexpr Param< double > MININTFIXINGRATE
minimum percentage of integer variables that have to be fixed
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <vbounds>
constexpr Param< int > FEASVARIANT
which variants of the vbounds heuristic that try to stay feasible should be called?...
constexpr Param< double > MAXDIVEUBQUOTNOSOL
maximal UBQUOT when no solution was found yet (0.0: no limit)
constexpr Param< int > LPSOLVEFREQ
LP solve frequency for diving heuristics (0: only after enough domain changes have been found)
constexpr Param< bool > ONLYLPBRANCHCANDS
should only LP branching candidates be considered instead of the slower but more general constraint h...
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <veclendiving> (-1: no limit)
constexpr Param< double > MAXDIVEAVGQUOT
maximal quotient (curlowerbound - lowerbound)/(avglowerbound - lowerbound) where diving is performed ...
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <veclendiving>
constexpr Param< bool > BACKTRACK
use one level of backtracking if infeasibility is encountered?
constexpr Param< double > MAXRELDEPTH
maximal relative depth to start diving
constexpr Param< double > MAXDIVEUBQUOT
maximal quotient (curlowerbound - lowerbound)/(cutoffbound - lowerbound) where diving is performed (0...
constexpr Param< double > MAXDIVEAVGQUOTNOSOL
maximal AVGQUOT when no solution was found yet (0.0: no limit)
constexpr Param< double > MAXLPITERQUOT
maximal fraction of diving LP iterations compared to node LP iterations
constexpr Param< int > PRIORITY
priority of heuristic <veclendiving>
constexpr Param< int > MAXLPITEROFS
additional number of allowed LP iterations
constexpr Param< double > LPRESOLVEDOMCHGQUOT
percentage of immediate domain changes during probing to trigger LP resolve
constexpr Param< double > MINRELDEPTH
minimal relative depth to start diving
constexpr Param< int > FREQ
frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
constexpr Param< bool > USEUCT
should uct node selection be used at the beginning of the search?
constexpr Param< double > NODESQUOT
contingent of sub problem nodes in relation to the number of nodes of the original problem
constexpr Param< bool > ONLYWITHOUTSOL
should heuristic only be executed if no primal solution was found, yet?
constexpr Param< long long > MINNODES
minimum number of nodes required to start the subproblem
constexpr Param< int > PRIORITY
priority of heuristic <zeroobj>
constexpr Param< bool > ADDALLSOLS
should all subproblem solutions be added to the original SCIP?
constexpr Param< long long > NODESOFS
number of nodes added to the contingent of the total nodes
constexpr Param< double > MINIMPROVE
factor by which zeroobj should at least improve the incumbent
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <zeroobj> (-1: no limit)
constexpr Param< long long > MAXNODES
maximum number of nodes to regard in the subproblem
constexpr Param< int > FREQ
frequency for calling primal heuristic <zeroobj> (-1: never, 0: only at depth freqofs)
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <zeroobj>
constexpr Param< long long > MAXLPITERS
maximum number of LP iterations to be performed in the subproblem
constexpr Param< int > PRIORITY
priority of heuristic <zirounding>
constexpr Param< int > MAXROUNDINGLOOPS
determines maximum number of rounding loops
constexpr Param< bool > STOPZIROUND
flag to determine if Zirounding is deactivated after a certain percentage of unsuccessful calls
constexpr Param< int > FREQ
frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
constexpr Param< double > STOPPERCENTAGE
if percentage of found solutions falls below this parameter, Zirounding will be deactivated
constexpr Param< int > FREQOFS
frequency offset for calling primal heuristic <zirounding>
constexpr Param< int > MAXDEPTH
maximal depth level to call primal heuristic <zirounding> (-1: no limit)
constexpr Param< int > MINSTOPNCALLS
determines the minimum number of calls before percentage-based deactivation of Zirounding is applied
constexpr Param< bool > USEUCTSUBSCIP
should setting of common subscip parameters include the activation of the UCT node selector?
constexpr Param< bool > ALLOWTRANSFER
should variable histories be transferred to initialize SCIP copies?
constexpr Param< bool > ALLOWMERGE
should variable histories be merged from sub-SCIPs whenever possible?
constexpr Param< bool > VALUEBASED
should statistics be collected for variable domain value pairs?
constexpr Param< double > MEMORY
maximal memory usage in MB; reported memory usage is lower than real memory usage!
constexpr Param< long long > TOTALNODES
maximal number of total nodes (incl. restarts) to process (-1: no limit)
constexpr Param< long long > STALLNODES
solving stops, if the given number of nodes was processed since the last improvement of the primal so...
constexpr Param< int > RESTARTS
solving stops, if the given number of restarts was triggered (-1: no limit)
constexpr Param< double > TIME
maximal time in seconds to run
constexpr Param< long long > NODES
maximal number of nodes to process (-1: no limit)
constexpr Param< int > MAXSOL
maximal number of solutions to store in the solution storage
constexpr Param< double > GAP
solving stops, if the relative gap = |primal - dual|/MIN(|dual|,|primal|) is below the given value,...
constexpr Param< int > AUTORESTARTNODES
if solve exceeds this number of nodes for the first time, an automatic restart is triggered (-1: no a...
constexpr Param< int > SOLUTIONS
solving stops, if the given number of solutions were found; this limit is first checked in presolving...
constexpr Param< double > ABSGAP
solving stops, if the absolute gap = |primalbound - dualbound| is below the given value
constexpr Param< int > MAXORIGSOL
maximal number of solutions candidates to store in the solution storage of the original problem
constexpr Param< double > SOFTTIME
soft time limit which should be applied after first solution was found (-1.0: disabled)
constexpr Param< int > BESTSOL
solving stops, if the given number of solution improvements were found (-1: no limit)
constexpr Param< double > MINMARKOWITZ
minimal Markowitz threshold to control sparsity/stability in LU factorization
constexpr Param< int > DISABLECUTOFF
disable the cutoff bound in the LP solver? (0: enabled, 1: disabled, 2: auto)
constexpr Param< int > SCALING
LP scaling (0: none, 1: normal, 2: aggressive)
constexpr Param< int > COLAGELIMIT
maximum age a dynamic column can reach before it is deleted from the LP (-1: don't delete columns due...
constexpr Param< bool > CHECKDUALFEAS
should LP solutions be checked for dual feasibility, resolving LP when numerical troubles occur?
constexpr Param< bool > FREESOLVALBUFFERS
should the buffers for storing LP solution values during diving be freed at end of diving?
constexpr Param< bool > PRESOLVING
should presolving of LP solver be used?
constexpr Param< char > RESOLVEALGORITHM
LP algorithm for resolving LP relaxations if a starting basis exists (automatic 's'implex,...
constexpr Param< bool > LEXDUALROOTONLY
should the lexicographic dual algorithm be applied only at the root node
constexpr Param< bool > CLEANUPCOLSROOT
should new non-basic columns be removed after root LP solving?
constexpr Param< bool > RESOLVERESTORE
should the LP be resolved to restore the state at start of diving (if FALSE we buffer the solution va...
constexpr Param< long long > ROOTITERLIM
iteration limit for initial root LP solve (-1: no limit)
constexpr Param< bool > LEXDUALSTALLING
turn on the lex dual algorithm only when stalling?
constexpr Param< bool > LEXDUALBASIC
choose fractional basic variables in lexicographic dual algorithm?
constexpr Param< bool > CLEARINITIALPROBINGLP
should lp state be cleared at the end of probing mode when lp was initially unsolved,...
constexpr Param< char > PRICING
LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing,...
constexpr Param< bool > LEXDUALALGO
should the lexicographic dual algorithm be used?
constexpr Param< int > FASTMIP
which FASTMIP setting of LP solver should be used? 0: off, 1: low
constexpr Param< bool > CLEANUPROWSROOT
should new basic rows be removed after root LP solving?
constexpr Param< int > RESOLVEITERMIN
minimum number of iterations that are allowed for LP resolve
constexpr Param< bool > CLEANUPCOLS
should new non-basic columns be removed after LP solving?
constexpr Param< int > REFACTORINTERVAL
LP refactorization interval (0: auto)
constexpr Param< bool > CLEANUPROWS
should new basic rows be removed after LP solving?
constexpr Param< int > THREADS
number of threads used for solving the LP (0: automatic)
constexpr Param< double > RESOLVEITERFAC
factor of average LP iterations that is used as LP iteration limit for LP resolve (-1: unlimited)
constexpr Param< int > LEXDUALMAXROUNDS
maximum number of rounds in the lexicographic dual algorithm (-1: unbounded)
constexpr Param< int > SOLUTIONPOLISHING
LP solution polishing method (0: disabled, 1: only root, 2: always, 3: auto)
constexpr Param< int > ROWAGELIMIT
maximum age a dynamic row can reach before it is deleted from the LP (-1: don't delete rows due to ag...
constexpr Param< double > ROWREPSWITCH
simplex algorithm shall use row representation of the basis if number of rows divided by number of co...
constexpr Param< int > SOLVEFREQ
frequency for solving LP at the nodes (-1: never; 0: only root LP)
constexpr Param< bool > CHECKFARKAS
should infeasibility proofs from the LP be checked?
constexpr Param< char > INITALGORITHM
LP algorithm for solving initial LP relaxations (automatic 's'implex, 'p'rimal simplex,...
constexpr Param< bool > CHECKPRIMFEAS
should LP solutions be checked for primal feasibility, resolving LP when numerical troubles occur?
constexpr Param< bool > CHECKSTABILITY
should LP solver's return status be checked for stability?
constexpr Param< bool > ALWAYSGETDUALS
should the Farkas duals always be collected when an LP is found to be infeasible?
constexpr Param< double > CONDITIONLIMIT
maximum condition number of LP basis counted as stable (-1.0: no limit)
constexpr Param< int > SOLVEDEPTH
maximal depth for solving LP at the nodes (-1: no depth limit)
constexpr Param< long long > ITERLIM
iteration limit for each single LP solve (-1: no limit)
constexpr Param< double > SAVEFAC
fraction of maximal memory usage resulting in switch to memory saving mode
constexpr Param< double > TREEGROWFAC
memory growing factor for tree array
constexpr Param< int > TREEGROWINIT
initial size of tree array
constexpr Param< int > ARRAYGROWINIT
initial size of dynamically allocated arrays
constexpr Param< int > PATHGROWINIT
initial size of path array
constexpr Param< double > ARRAYGROWFAC
memory growing factor for dynamically allocated arrays
constexpr Param< double > PATHGROWFAC
memory growing factor for path array
constexpr Param< bool > CALCINTEGRAL
should SCIP calculate the primal dual integral value?
constexpr Param< bool > USESMALLTABLES
should smaller hashtables be used? yields better performance for small problems with about 100 variab...
constexpr Param< bool > ALLOWSTRONGDUALREDS
should strong dual reductions be allowed in propagation and presolving?
constexpr Param< bool > SCALEOBJ
should the objective function be scaled so that it is always integer?
constexpr Param< int > USESYMMETRY
bitset describing used symmetry handling technique (0: off; 1: polyhedral (orbitopes and/or symresack...
constexpr Param< bool > RESETSTAT
should the statistics be reset if the transformed problem is freed (in case of a Benders' decompositi...
constexpr Param< bool > OUTPUTORIGSOL
should the best solution be transformed to the orignal space and be output in command line run?
constexpr Param< double > REFERENCEVALUE
objective value for reference purposes
constexpr Param< bool > SHOWDIVINGSTATS
should detailed statistics for diving heuristics be shown?
constexpr Param< bool > USEVARTABLE
should a hashtable be used to map from variable names to variables?
constexpr Param< bool > PRINTREASON
should the reason be printed if a given start solution is infeasible
constexpr Param< bool > ALLOWWEAKDUALREDS
should weak dual reductions be allowed in propagation and presolving?
constexpr Param< bool > AVOIDMEMOUT
try to avoid running into memory limit by restricting plugins like heuristics?
constexpr Param< bool > TRANSSOLSORIG
should SCIP try to transfer transformed solutions to the original space (after solving)?
constexpr Param< bool > CATCHCTRLC
should the CTRL-C interrupt be caught by SCIP?
constexpr Param< bool > TRANSORIGSOLS
should SCIP try to transfer original solutions to the transformed space (after presolving)?
constexpr Param< bool > USECONSTABLE
should a hashtable be used to map from constraint names to constraints?
constexpr Param< bool > IMPROVINGSOLS
should only solutions be checked which improve the primal bound
constexpr Param< bool > ESTIMEXTERNMEM
should the usage of external memory be estimated?
constexpr Param< bool > FINITESOLUTIONSTORE
should SCIP try to remove infinite fixings from solutions copied to the solution store?
constexpr Param< int > MAXSEPADEPTH
maximum depth to apply separation
constexpr Param< int > MAXSEPAROUNDS
maximum number of separation rounds in a local node
constexpr Param< bool > USEINTEVAL
whether to use the interval evaluation callback of the nlhdlr
constexpr Param< bool > USEREVERSEPROP
whether to use the reverse propagation callback of the nlhdlr
constexpr Param< int > MAXSEPAROUNDSROOT
maximum number of separation rounds in the root node
constexpr Param< bool > ENABLED
should this nonlinear handler be used
constexpr Param< bool > CVXQUADRATIC
whether to use convexity check on quadratics
constexpr Param< bool > DETECTSUM
whether to run convexity detection when the root of an expression is a sum
constexpr Param< bool > HANDLETRIVIAL
whether to also handle trivial convex expressions
constexpr Param< bool > ENABLED
should this nonlinear handler be used
constexpr Param< bool > CVXSIGNOMIAL
whether to use convexity check on signomials
constexpr Param< bool > CVXPRODCOMP
whether to use convexity check on product composition f(h)*h
constexpr Param< bool > DETECTSUM
whether to run convexity detection when the root of an expression is a non-quadratic sum
constexpr Param< bool > HANDLETRIVIAL
whether to also handle trivial convex expressions
constexpr Param< bool > ENABLED
should this nonlinear handler be used
constexpr Param< bool > CVXSIGNOMIAL
whether to use convexity check on signomials
constexpr Param< bool > CVXPRODCOMP
whether to use convexity check on product composition f(h)*h
constexpr Param< bool > EXTENDEDFORM
whether to create extended formulations instead of looking for maximal convex expressions
constexpr Param< bool > CVXQUADRATIC
whether to use convexity check on quadratics
constexpr Param< bool > ENABLED
should this nonlinear handler be used
constexpr Param< int > PROBINGFREQ
probing frequency (-1 - no probing, 0 - root node only)
constexpr Param< bool > ENABLED
should this nonlinear handler be used
constexpr Param< bool > CONVEXONLY
whether perspective cuts are added only for convex expressions
constexpr Param< bool > TIGHTENBOUNDS
whether variable semicontinuity is used to tighten variable bounds
constexpr Param< int > MAXPROPROUNDS
maximal number of propagation rounds in probing
constexpr Param< bool > PROBINGONLYINSEPA
whether to do probing only in separation
constexpr Param< bool > ADJREFPOINT
whether to adjust the reference point
constexpr Param< double > MINDOMREDUCTION
minimal relative reduction in a variable's domain for applying probing
constexpr Param< double > MINVIOLPROBING
minimal violation w.r.t. auxiliary variables for applying probing
constexpr Param< int > NCUTSLIMITROOT
limit for number of cuts generated at root node
constexpr Param< bool > USESTRENGTHENING
whether the strengthening should be used
constexpr Param< double > MINVIOLATION
minimal violation the constraint must fulfill such that a cut is generated
constexpr Param< bool > IGNOREBADRAYRESTRICTION
should cut be generated even with bad numerics when restricting to ray?
constexpr Param< int > NSTRENGTHLIMIT
limit for number of rays we do the strengthening for
constexpr Param< bool > USEINTERSECTIONCUTS
whether to use intersection cuts for quadratic constraints to separate
constexpr Param< int > MAXRANK
maximal rank a slackvar can have
constexpr Param< bool > USEBOUNDSASRAYS
use bounds of variables in quadratic as rays for intersection cuts
constexpr Param< int > ATWHICHNODES
determines at which nodes cut is used (if it's -1, it's used only at the root node,...
constexpr Param< int > NCUTSLIMIT
limit for number of cuts generated consecutively
constexpr Param< bool > ENABLED
should this nonlinear handler be used
constexpr Param< bool > IGNORENHIGHRE
should cut be added even when range / efficacy is large?
constexpr Param< double > MINCUTVIOLATION
minimal cut violation the generated cuts must fulfill to be added to the LP
constexpr Param< bool > ENABLED
should this nonlinear handler be used
constexpr Param< double > MINCUTEFFICACY
Minimum efficacy which a cut needs in order to be added.
constexpr Param< bool > COMPEIGENVALUES
Should Eigenvalue computations be done to detect complex cases in quadratic constraints?
constexpr Param< bool > ENABLED
should this nonlinear handler be used
constexpr Param< std::string > SOLVER
solver to use for solving NLPs; leave empty to select NLPI with highest priority
constexpr Param< bool > DISABLE
should the NLP relaxation be always disabled (also for NLPs/MINLPs)?
constexpr Param< double > MAXPLUNGEQUOT
maximal quotient (curlowerbound - lowerbound)/(cutoffbound - lowerbound) where plunging is performed
constexpr Param< int > MINPLUNGEDEPTH
minimal plunging depth, before new best node may be selected (-1 for dynamic setting)
constexpr Param< int > MEMSAVEPRIORITY
priority of node selection rule <bfs> in memory saving mode
constexpr Param< int > STDPRIORITY
priority of node selection rule <bfs> in standard mode
constexpr Param< int > MAXPLUNGEDEPTH
maximal plunging depth, before new best node is forced to be selected (-1 for dynamic setting)
constexpr Param< int > MEMSAVEPRIORITY
priority of node selection rule <breadthfirst> in memory saving mode
constexpr Param< int > STDPRIORITY
priority of node selection rule <breadthfirst> in standard mode
constexpr Param< int > STDPRIORITY
priority of node selection rule <dfs> in standard mode
constexpr Param< int > MEMSAVEPRIORITY
priority of node selection rule <dfs> in memory saving mode
constexpr Param< int > MINPLUNGEDEPTH
minimal plunging depth, before new best node may be selected (-1 for dynamic setting)
constexpr Param< int > MAXPLUNGEDEPTH
maximal plunging depth, before new best node is forced to be selected (-1 for dynamic setting)
constexpr Param< int > MEMSAVEPRIORITY
priority of node selection rule <estimate> in memory saving mode
constexpr Param< int > PLUNGEOFFSET
number of nodes before doing plunging the first time
constexpr Param< int > BESTNODEFREQ
frequency at which the best node instead of the best estimate is selected (0: never)
constexpr Param< int > BREADTHFIRSTDEPTH
depth until breadth-first search is applied
constexpr Param< int > STDPRIORITY
priority of node selection rule <estimate> in standard mode
constexpr Param< double > MAXPLUNGEQUOT
maximal quotient (estimate - lowerbound)/(cutoffbound - lowerbound) where plunging is performed
constexpr Param< int > MAXPLUNGEDEPTH
maximal plunging depth, before new best node is forced to be selected (-1 for dynamic setting)
constexpr Param< int > MEMSAVEPRIORITY
priority of node selection rule <hybridestim> in memory saving mode
constexpr Param< int > BESTNODEFREQ
frequency at which the best node instead of the hybrid best estimate / best bound is selected (0: nev...
constexpr Param< double > ESTIMWEIGHT
weight of estimate value in node selection score (0: pure best bound search, 1: pure best estimate se...
constexpr Param< int > MINPLUNGEDEPTH
minimal plunging depth, before new best node may be selected (-1 for dynamic setting)
constexpr Param< double > MAXPLUNGEQUOT
maximal quotient (estimate - lowerbound)/(cutoffbound - lowerbound) where plunging is performed
constexpr Param< int > STDPRIORITY
priority of node selection rule <hybridestim> in standard mode
constexpr Param< bool > COUNTONLYLEAVES
count only leaf nodes (otherwise all nodes)?
constexpr Param< int > MEMSAVEPRIORITY
priority of node selection rule <restartdfs> in memory saving mode
constexpr Param< int > SELECTBESTFREQ
frequency for selecting the best node instead of the deepest one
constexpr Param< int > STDPRIORITY
priority of node selection rule <restartdfs> in standard mode
constexpr Param< int > STDPRIORITY
priority of node selection rule <uct> in standard mode
constexpr Param< int > MEMSAVEPRIORITY
priority of node selection rule <uct> in memory saving mode
constexpr Param< int > NODELIMIT
maximum number of nodes before switching to default rule
constexpr Param< bool > USEESTIMATE
should the estimate (TRUE) or lower bound of a node be used for UCT score?
constexpr Param< double > WEIGHT
weight for visit quotient of node selection rule
constexpr Param< char > CHILDSEL
child selection rule ('d'own, 'u'p, 'p'seudo costs, 'i'nference, 'l'p value, 'r'oot LP value differen...
constexpr Param< double > CHECKFEASTOLFAC
feasibility tolerance factor; for checking the feasibility of the best solution
constexpr Param< double > BARRIERCONVTOL
LP convergence tolerance used in barrier algorithm.
constexpr Param< double > LPFEASTOLFACTOR
factor w.r.t.
constexpr Param< double > EPSILON
absolute values smaller than this are considered zero
constexpr Param< double > SUMEPSILON
absolute values of sums smaller than this are considered zero
constexpr Param< double > FEASTOL
feasibility tolerance for constraints
constexpr Param< double > BOUNDSTREPS
minimal relative improve for strengthening bounds
constexpr Param< double > PSEUDOCOSTDELTA
minimal objective distance value to use for branching pseudo cost updates
constexpr Param< double > DUALFEASTOL
feasibility tolerance for reduced costs in LP solution
constexpr Param< double > PSEUDOCOSTEPS
minimal variable distance value to use for branching pseudo cost updates
constexpr Param< double > INFINITY
values larger than this are considered infinity
constexpr Param< double > HUGEVAL
values larger than this are considered huge and should be handled separately (e.g....
constexpr Param< double > RECOMPUTEFAC
minimal decrease factor that causes the recomputation of a value (e.g., pseudo objective) instead of ...
constexpr Param< int > MINNTHREADS
the minimum number of threads used during parallel solve
constexpr Param< int > MODE
parallel optimisation mode, 0: opportunistic or 1: deterministic.
constexpr Param< int > MAXNTHREADS
the maximum number of threads used during parallel solve
constexpr Param< bool > FLIPPING
is flipping allowed (multiplying with -1)?
constexpr Param< int > PRIORITY
priority of presolver <boundshift>
constexpr Param< int > TIMING
timing mask of presolver <boundshift> (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE, 32:FINAL)
constexpr Param< bool > INTEGER
shift only integer ranges?
constexpr Param< int > MAXROUNDS
maximal number of presolving rounds the presolver participates in (-1: no limit)
constexpr Param< long long > MAXSHIFT
absolute value of maximum shift
constexpr Param< long long > MAXDOMAINSIZE
absolute value of maximum domain size for converting an integer variable to binaries variables
constexpr Param< int > PRIORITY
priority of presolver <convertinttobin>
constexpr Param< int > TIMING
timing mask of presolver <convertinttobin> (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE, 32:FINAL)
constexpr Param< bool > SAMELOCKSINBOTHDIRECTIONS
should only integer variables with uplocks equals downlocks be converted
constexpr Param< bool > ONLYPOWEROFTWO
should only integer variables with a domain size of 2^p - 1 be converted(, there we don't need an kna...
constexpr Param< int > MAXROUNDS
maximal number of presolving rounds the presolver participates in (-1: no limit)
constexpr Param< int > PRIORITY
priority of presolver <domcol>
constexpr Param< int > NUMMINPAIRS
minimal number of pair comparisons
constexpr Param< int > NUMMAXPAIRS
maximal number of pair comparisons
constexpr Param< int > TIMING
timing mask of presolver <domcol> (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE, 32:FINAL)
constexpr Param< bool > PREDBNDSTR
should predictive bound strengthening be applied?
constexpr Param< int > MAXROUNDS
maximal number of presolving rounds the presolver participates in (-1: no limit)
constexpr Param< bool > CONTINUOUSRED
should reductions for continuous variables be performed?
constexpr Param< int > PRIORITY
priority of presolver <dualagg>
constexpr Param< int > MAXROUNDS
maximal number of presolving rounds the presolver participates in (-1: no limit)
constexpr Param< int > TIMING
timing mask of presolver <dualagg> (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE, 32:FINAL)
constexpr Param< int > PRIORITY
priority of presolver <dualcomp>
constexpr Param< int > MAXROUNDS
maximal number of presolving rounds the presolver participates in (-1: no limit)
constexpr Param< int > TIMING
timing mask of presolver <dualcomp> (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE, 32:FINAL)
constexpr Param< bool > COMPONLYDISVARS
should only discrete variables be compensated?
constexpr Param< int > MAXRETRIEVEFAILS
maximal number of consecutive useless hashtable retrieves
constexpr Param< int > MAXHASHFAC
Maximum number of hashlist entries as multiple of number of columns in the problem (-1: no limit)
constexpr Param< int > PRIORITY
priority of presolver <dualinfer>
constexpr Param< int > MAXPAIRFAC
Maximum number of processed column pairs as multiple of the number of columns in the problem (-1: no ...
constexpr Param< int > MAXDUALBNDLOOPS
maximal number of dual bound strengthening loops
constexpr Param< int > TIMING
timing mask of presolver <dualinfer> (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE, 32:FINAL)
constexpr Param< int > MAXROUNDS
maximal number of presolving rounds the presolver participates in (-1: no limit)
constexpr Param< int > MAXROWSUPPORT
Maximum number of row's non-zeros for changing inequality to equality.
constexpr Param< bool > TWOCOLCOMBINE
use convex combination of columns for determining dual bounds
constexpr Param< int > MAXCOMBINEFAILS
maximal number of consecutive useless column combines
constexpr Param< int > MAXCONSIDEREDNONZEROS
maximal number of considered non-zeros within one column (-1: no limit)
constexpr Param< int > MAXROUNDS
maximal number of presolving rounds the presolver participates in (-1: no limit)
constexpr Param< int > TIMING
timing mask of presolver <dualsparsify> (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE, 32:FINAL)
constexpr Param< int > MAXCONTFILLIN
maximal fillin for continuous variables (-1: unlimited)
constexpr Param< int > PRIORITY
priority of presolver <dualsparsify>
constexpr Param< bool > PRESERVEGOODLOCKS
should we preserve good locked properties of variables (at most one lock in one direction)?
constexpr Param< int > MINELIMINATEDNONZEROS
minimal eliminated nonzeros within one column if we need to add a constraint to the problem
constexpr Param< bool > ENABLECOPY
should dualsparsify presolver be copied to sub-SCIPs?
constexpr Param< int > MAXINTFILLIN
maximal fillin for integer variables including binaries (-1: unlimited)
constexpr Param< int > MAXCONSIDEREDNONZEROS
maximal number of considered nonzeros within one column (-1: no limit)
constexpr Param< bool > PRESERVEINTCOEFS
should we forbid cancellations that destroy integer coefficients?
constexpr Param< double > WAITINGFAC
number of calls to wait until next execution as a multiple of the number of useless calls
constexpr Param< double > MAXRETRIEVEFAC
limit on the number of useless vs. useful hashtable retrieves as a multiple of the number of constrai...
constexpr Param< int > MAXBINFILLIN
maximal fillin for binary variables (-1: unlimited)
constexpr Param< int > SORTING
order logicor contraints to extract big-gates before smaller ones (-1), do not order them (0) or orde...
constexpr Param< bool > SEARCHEQUATIONS
should we try to extract set-partitioning constraint out of one logicor and one corresponding set-pac...
constexpr Param< int > PRIORITY
priority of presolver <gateextraction>
constexpr Param< bool > ONLYSETPART
should we only try to extract set-partitioning constraints and no and-constraints
constexpr Param< int > TIMING
timing mask of presolver <gateextraction> (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE, 32:FINAL)
constexpr Param< int > MAXROUNDS
maximal number of presolving rounds the presolver participates in (-1: no limit)
constexpr Param< int > PRIORITY
priority of presolver <implics>
constexpr Param< int > MAXROUNDS
maximal number of presolving rounds the presolver participates in (-1: no limit)
constexpr Param< int > TIMING
timing mask of presolver <implics> (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE, 32:FINAL)
constexpr Param< int > MAXROUNDS
maximal number of presolving rounds the presolver participates in (-1: no limit)
constexpr Param< int > TIMING
timing mask of presolver <inttobinary> (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE, 32:FINAL)
constexpr Param< int > PRIORITY
priority of presolver <inttobinary>
constexpr Param< int > PRIORITY
priority of presolver <qpkktref>
constexpr Param< bool > UPDATEQUADINDEF
if TRUE then apply quadratic constraint update even if the quadratic constraint matrix is known to be...
constexpr Param< bool > ADDKKTBINARY
if TRUE then allow binary variables for KKT update
constexpr Param< int > MAXROUNDS
maximal number of presolving rounds the presolver participates in (-1: no limit)
constexpr Param< bool > UPDATEQUADBOUNDED
if TRUE then only apply the update to QPs with bounded variables; if the variables are not bounded th...
constexpr Param< int > TIMING
timing mask of presolver <qpkktref> (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE, 32:FINAL)
constexpr Param< int > PRIORITY
priority of presolver <redvub>
constexpr Param< int > TIMING
timing mask of presolver <redvub> (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE, 32:FINAL)
constexpr Param< int > MAXROUNDS
maximal number of presolving rounds the presolver participates in (-1: no limit)
constexpr Param< bool > CANCELLINEAR
should we cancel nonzeros in constraints of the linear constraint handler?
constexpr Param< int > MAXROUNDS
maximal number of presolving rounds the presolver participates in (-1: no limit)
constexpr Param< bool > ENABLECOPY
should sparsify presolver be copied to sub-SCIPs?
constexpr Param< int > MAXCONSIDEREDNONZEROS
maximal number of considered non-zeros within one row (-1: no limit)
constexpr Param< int > TIMING
timing mask of presolver <sparsify> (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE, 32:FINAL)
constexpr Param< double > WAITINGFAC
number of calls to wait until next execution as a multiple of the number of useless calls
constexpr Param< int > MAXNONZEROS
maximal support of one equality to be used for cancelling (-1: no limit)
constexpr Param< int > MAXINTFILLIN
maximal fillin for integer variables including binaries (-1: unlimited)
constexpr Param< int > MAXBINFILLIN
maximal fillin for binary variables (-1: unlimited)
constexpr Param< double > MAXRETRIEVEFAC
limit on the number of useless vs. useful hashtable retrieves as a multiple of the number of constrai...
constexpr Param< int > MAXCONTFILLIN
maximal fillin for continuous variables (-1: unlimited)
constexpr Param< bool > PRESERVEINTCOEFS
should we forbid cancellations that destroy integer coefficients?
constexpr Param< char > ROWSORT
order in which to process inequalities ('n'o sorting, 'i'ncreasing nonzeros, 'd'ecreasing nonzeros)
constexpr Param< int > PRIORITY
priority of presolver <sparsify>
constexpr Param< int > MAXROUNDS
maximal number of presolving rounds the presolver participates in (-1: no limit)
constexpr Param< int > TIMING
timing mask of presolver <stuffing> (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE, 32:FINAL)
constexpr Param< int > PRIORITY
priority of presolver <stuffing>
constexpr Param< int > MAXROUNDS
maximal number of presolving rounds the presolver participates in (-1: no limit)
constexpr Param< int > TIMING
timing mask of presolver <trivial> (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE, 32:FINAL)
constexpr Param< int > PRIORITY
priority of presolver <trivial>
constexpr Param< int > MAXCOMBINEFAILS
maximal number of consecutive useless row combines
constexpr Param< int > TIMING
timing mask of presolver <tworowbnd> (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE, 32:FINAL)
constexpr Param< int > MAXRETRIEVEFAILS
maximal number of consecutive useless hashtable retrieves
constexpr Param< bool > ENABLECOPY
should tworowbnd presolver be copied to sub-SCIPs?
constexpr Param< int > MAXROUNDS
maximal number of presolving rounds the presolver participates in (-1: no limit)
constexpr Param< int > PRIORITY
priority of presolver <tworowbnd>
constexpr Param< int > MAXCONSIDEREDNONZEROS
maximal number of considered non-zeros within one row (-1: no limit)
constexpr Param< int > MAXPAIRFAC
Maximum number of processed row pairs as multiple of the number of rows in the problem (-1: no limit)
constexpr Param< int > MAXHASHFAC
Maximum number of hashlist entries as multiple of number of rows in the problem (-1: no limit)
constexpr Param< double > RESTARTMINRED
minimal fraction of integer variables removed after restart to allow for an additional restart
constexpr Param< double > CLQTABLEFAC
limit on number of entries in clique table relative to number of problem nonzeros
constexpr Param< bool > DONOTAGGR
should aggregation of variables be forbidden?
constexpr Param< bool > DONOTMULTAGGR
should multi-aggregation of variables be forbidden?
constexpr Param< int > MAXROUNDS
maximal number of presolving rounds (-1: unlimited, 0: off)
constexpr Param< int > MAXRESTARTS
maximal number of restarts (-1: unlimited)
constexpr Param< double > RESTARTFAC
fraction of integer variables that were fixed in the root node triggering a restart with preprocessin...
constexpr Param< double > IMMRESTARTFAC
fraction of integer variables that were fixed in the root node triggering an immediate restart with p...
constexpr Param< double > SUBRESTARTFAC
fraction of integer variables that were globally fixed during the solving process triggering a restar...
constexpr Param< double > ABORTFAC
abort presolve, if at most this fraction of the problem was changed in last presolve round
constexpr Param< double > ABORTFAC
pricing is aborted, if fac * pricing/maxvars pricing candidates were found
constexpr Param< int > MAXVARS
maximal number of variables priced in per pricing round
constexpr Param< bool > DELVARSROOT
should variables created at the root node be deleted when the root is solved in case they are not pre...
constexpr Param< bool > DELVARS
should variables created at the current node be deleted when the node is solved in case they are not ...
constexpr Param< int > MAXVARSROOT
maximal number of priced variables at the root node
constexpr Param< int > PRESOLTIMING
timing mask of the presolving method of propagator <dualfix> (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< bool > DELAY
should propagator be delayed, if other propagators found reductions?
constexpr Param< int > PRIORITY
priority of propagator <dualfix>
constexpr Param< int > PRESOLPRIORITY
presolving priority of propagator <dualfix>
constexpr Param< int > FREQ
frequency for calling propagator <dualfix> (-1: never, 0: only in root node)
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the propagator participates in (-1: no limit)
constexpr Param< int > TIMINGMASK
timing when propagator should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< int > PRIORITY
priority of propagator <genvbounds>
constexpr Param< bool > GLOBAL
apply global propagation?
constexpr Param< int > TIMINGMASK
timing when propagator should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< bool > PROPASCONSS
should genvbounds be transformed to (linear) constraints?
constexpr Param< bool > DELAY
should propagator be delayed, if other propagators found reductions?
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the propagator participates in (-1: no limit)
constexpr Param< int > FREQ
frequency for calling propagator <genvbounds> (-1: never, 0: only in root node)
constexpr Param< bool > PROPINROOTNODE
apply genvbounds in root node if no new incumbent was found?
constexpr Param< int > PRESOLPRIORITY
presolving priority of propagator <genvbounds>
constexpr Param< int > PRESOLTIMING
timing mask of the presolving method of propagator <genvbounds> (4:FAST, 8:MEDIUM,...
constexpr Param< bool > SORT
sort genvbounds and wait for bound change events?
constexpr Param< int > PRIORITY
priority of propagator <nlobbt>
constexpr Param< int > PRESOLPRIORITY
presolving priority of propagator <nlobbt>
constexpr Param< int > FREQ
frequency for calling propagator <nlobbt> (-1: never, 0: only in root node)
constexpr Param< bool > DELAY
should propagator be delayed, if other propagators found reductions?
constexpr Param< int > NLPITERLIMIT
iteration limit of NLP solver; 0 for no limit
constexpr Param< bool > ADDLPROWS
should non-initial LP rows be used?
constexpr Param< double > RELOBJTOLFAC
factor for NLP relative objective tolerance
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the propagator participates in (-1: no limit)
constexpr Param< double > MINNONCONVEXFRAC
(#convex nlrows)/(#nonconvex nlrows) threshold to apply propagator
constexpr Param< double > MINLINEARFRAC
minimum (#convex nlrows)/(#linear nlrows) threshold to apply propagator
constexpr Param< double > ITLIMITFACTOR
LP iteration limit for nlobbt will be this factor times total LP iterations in root node.
constexpr Param< int > TIMINGMASK
timing when propagator should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< int > PRESOLTIMING
timing mask of the presolving method of propagator <nlobbt> (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< int > NLPVERBLEVEL
verbosity level of NLP solver
constexpr Param< double > FEASTOLFAC
factor for NLP feasibility tolerance
constexpr Param< double > NLPTIMELIMIT
time limit of NLP solver; 0.0 for no limit
constexpr Param< bool > TIGHTINTBOUNDSPROBING
should integral bounds be tightened during the probing mode?
constexpr Param< bool > GENVBDSDURINGFILTER
should we try to generate genvbounds during trivial and aggressive filtering?
constexpr Param< int > SEPAMINITER
minimum number of iteration spend to separate an obbt LP solution
constexpr Param< bool > SEPARATESOL
should the obbt LP solution be separated?
constexpr Param< bool > ONLYNONCONVEXVARS
only apply obbt on non-convex variables
constexpr Param< bool > TIGHTCONTBOUNDSPROBING
should continuous bounds be tightened during the probing mode?
constexpr Param< int > TIMINGMASK
timing when propagator should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< double > DUALFEASTOL
feasibility tolerance for reduced costs used in obbt; this value is used if SCIP's dual feastol is gr...
constexpr Param< bool > APPLYTRIVIALFILTER
try to filter bounds with the LP solution after each solve?
constexpr Param< int > SEPAMAXITER
maximum number of iteration spend to separate an obbt LP solution
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the propagator participates in (-1: no limit)
constexpr Param< bool > GENVBDSDURINGSEPA
try to create genvbounds during separation process?
constexpr Param< int > PRESOLTIMING
timing mask of the presolving method of propagator <obbt> (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< bool > NORMALIZE
should coefficients in filtering be normalized w.r.t. the domains sizes?
constexpr Param< int > PRIORITY
priority of propagator <obbt>
constexpr Param< double > ITLIMITFACTOR
multiple of root node LP iterations used as total LP iteration limit for obbt (<= 0: no limit )
constexpr Param< int > PROPAGATEFREQ
trigger a propagation round after that many bound tightenings (0: no propagation)
constexpr Param< double > MINNONCONVEXITY
minimum absolute value of nonconvex eigenvalues for a bilinear term
constexpr Param< int > MINFILTER
minimal number of filtered bounds to apply another filter round
constexpr Param< int > PRESOLPRIORITY
presolving priority of propagator <obbt>
constexpr Param< bool > CREATEGENVBOUNDS
should obbt try to provide genvbounds if possible?
constexpr Param< bool > DELAY
should propagator be delayed, if other propagators found reductions?
constexpr Param< double > CONDITIONLIMIT
maximum condition limit used in LP solver (-1.0: no limit)
constexpr Param< bool > CREATELINCONS
create linear constraints from inequalities for bilinear terms?
constexpr Param< int > FREQ
frequency for calling propagator <obbt> (-1: never, 0: only in root node)
constexpr Param< long long > MINITLIMIT
minimum LP iteration limit
constexpr Param< int > ORDERINGALGO
select the type of ordering algorithm which should be used (0: no special ordering,...
constexpr Param< double > BOUNDSTREPS
minimal relative improve for strengthening bounds
constexpr Param< double > ITLIMITFACTORBILIN
multiple of OBBT LP limit used as total LP iteration limit for solving bilinear inequality LPs (< 0 f...
constexpr Param< bool > APPLYFILTERROUNDS
try to filter bounds in so-called filter rounds by solving auxiliary LPs?
constexpr Param< bool > CREATEBILININEQS
solve auxiliary LPs in order to find valid inequalities for bilinear terms?
constexpr Param< int > PRESOLPRIORITY
presolving priority of propagator <probing>
constexpr Param< int > PROPROUNDS
maximal number of propagation rounds in probing subproblems (-1: no limit, 0: auto)
constexpr Param< int > MAXRUNS
maximal number of runs, probing participates in (-1: no limit)
constexpr Param< int > FREQ
frequency for calling propagator <probing> (-1: never, 0: only in root node)
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the propagator participates in (-1: no limit)
constexpr Param< bool > DELAY
should propagator be delayed, if other propagators found reductions?
constexpr Param< int > MAXSUMUSELESS
maximal number of probings without fixings, until probing is aborted (0: don't abort)
constexpr Param< int > TIMINGMASK
timing when propagator should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< int > MAXUSELESS
maximal number of successive probings without fixings, until probing is aborted (0: don't abort)
constexpr Param< int > MAXFIXINGS
maximal number of fixings found, until probing is interrupted (0: don't iterrupt)
constexpr Param< int > PRESOLTIMING
timing mask of the presolving method of propagator <probing> (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< int > PRIORITY
priority of propagator <probing>
constexpr Param< int > MAXDEPTH
maximal depth until propagation is executed(-1: no limit)
constexpr Param< int > MAXTOTALUSELESS
maximal number of successive probings without fixings, bound changes, and implications,...
constexpr Param< int > PRESOLPRIORITY
presolving priority of propagator <pseudoobj>
constexpr Param< bool > PROPCUTOFFBOUND
propagate new cutoff bound directly globally
constexpr Param< bool > FORCE
should the propagator be forced even if active pricer are present?
constexpr Param< double > MAXVARSFRAC
maximal fraction of non-binary variables with non-zero objective without a bound reduction before abo...
constexpr Param< bool > PROPUSEIMPLICS
use implications to strengthen the propagation of binary variable (increasing the objective change)?
constexpr Param< int > PRIORITY
priority of propagator <pseudoobj>
constexpr Param< bool > RESPROPUSEIMPLICS
use implications to strengthen the resolve propagation of binary variable (increasing the objective c...
constexpr Param< bool > DELAY
should propagator be delayed, if other propagators found reductions?
constexpr Param< int > MAXIMPLVARS
maximum number of binary variables the implications are used if turned on (-1: unlimited)?
constexpr Param< int > TIMINGMASK
timing when propagator should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< int > MINUSELESS
minimal number of successive non-binary variable propagations without a bound reduction before aborte...
constexpr Param< int > MAXNEWVARS
number of variables added after the propagator is reinitialized?
constexpr Param< bool > PROPFULLINROOT
whether to propagate all non-binary variables when we are propagating the root node
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the propagator participates in (-1: no limit)
constexpr Param< int > FREQ
frequency for calling propagator <pseudoobj> (-1: never, 0: only in root node)
constexpr Param< int > PRESOLTIMING
timing mask of the presolving method of propagator <pseudoobj> (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< int > PRESOLTIMING
timing mask of the presolving method of propagator <redcost> (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< bool > CONTINUOUS
should reduced cost fixing be also applied to continuous variables?
constexpr Param< bool > DELAY
should propagator be delayed, if other propagators found reductions?
constexpr Param< int > TIMINGMASK
timing when propagator should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the propagator participates in (-1: no limit)
constexpr Param< int > PRESOLPRIORITY
presolving priority of propagator <redcost>
constexpr Param< int > FREQ
frequency for calling propagator <redcost> (-1: never, 0: only in root node)
constexpr Param< bool > FORCE
should the propagator be forced even if active pricer are present?
constexpr Param< bool > USEIMPLICS
should implications be used to strength the reduced cost for binary variables?
constexpr Param< int > PRIORITY
priority of propagator <redcost>
constexpr Param< int > FREQ
frequency for calling propagator <rootredcost> (-1: never, 0: only in root node)
constexpr Param< bool > FORCE
should the propagator be forced even if active pricer are present?
constexpr Param< int > PRESOLPRIORITY
presolving priority of propagator <rootredcost>
constexpr Param< bool > ONLYBINARY
should only binary variables be propagated?
constexpr Param< int > TIMINGMASK
timing when propagator should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< int > PRESOLTIMING
timing mask of the presolving method of propagator <rootredcost> (4:FAST, 8:MEDIUM,...
constexpr Param< bool > DELAY
should propagator be delayed, if other propagators found reductions?
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the propagator participates in (-1: no limit)
constexpr Param< int > PRIORITY
priority of propagator <rootredcost>
constexpr Param< bool > PERFORMPRESOLVING
run orbital fixing during presolving?
constexpr Param< int > OFSYMCOMPTIMING
timing of symmetry computation for orbital fixing (0 = before presolving, 1 = during presolving,...
constexpr Param< bool > ADDSTRONGSBCS
Should strong SBCs for enclosing orbit of symmetric subgroups be added if orbitopes are not used?
constexpr Param< bool > ADDCONFLICTCUTS
Should Schreier Sims constraints be added if we use a conflict based rule?
constexpr Param< int > ADDCONSSTIMING
timing of adding constraints (0 = before presolving, 1 = during presolving, 2 = after presolving)
constexpr Param< int > RECOMPUTERESTART
recompute symmetries after a restart has occured? (0 = never)
constexpr Param< int > FREQ
frequency for calling propagator <symmetry> (-1: never, 0: only in root node)
constexpr Param< int > TIMINGMASK
timing when propagator should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< bool > ADDWEAKSBCS
Should we add weak SBCs for enclosing orbit of symmetric subgroups?
constexpr Param< int > PRESOLTIMING
timing mask of the presolving method of propagator <symmetry> (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< int > SSTLEADERVARTYPE
bitset encoding which variable types can be leaders (1: binary; 2: integer; 4: impl.
constexpr Param< bool > CONSSADDLP
Should the symmetry breaking constraints be added to the LP?
constexpr Param< int > MAXNCONSSSUBGROUP
maximum number of constraints up to which subgroup structures are detected
constexpr Param< int > PRIORITY
priority of propagator <symmetry>
constexpr Param< bool > COMPRESSSYMMETRIES
Should non-affected variables be removed from permutation to save memory?
constexpr Param< bool > USECOLUMNSPARSITY
Should the number of conss a variable is contained in be exploited in symmetry detection?
constexpr Param< bool > DISPLAYNORBITVARS
Should the number of variables affected by some symmetry be displayed?
constexpr Param< bool > SYMFIXNONBINARYVARS
Whether all non-binary variables shall be not affected by symmetries if OF is active?
constexpr Param< bool > USEDYNAMICPROP
whether dynamic propagation should be used for full orbitopes
constexpr Param< int > MAXGENERATORS
limit on the number of generators that should be produced within symmetry detection (0 = no limit)
constexpr Param< bool > SSTMIXEDCOMPONENTS
Should Schreier Sims constraints be added if a symmetry component contains variables of different typ...
constexpr Param< bool > CHECKSYMMETRIES
Should all symmetries be checked after computation?
constexpr Param< int > PRESOLPRIORITY
presolving priority of propagator <symmetry>
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the propagator participates in (-1: no limit)
constexpr Param< bool > DETECTORBITOPES
Should we check whether the components of the symmetry group can be handled by orbitopes?
constexpr Param< bool > ONLYBINARYSYMMETRY
Is only symmetry on binary variables used?
constexpr Param< bool > DELAY
should propagator be delayed, if other propagators found reductions?
constexpr Param< bool > DETECTSUBGROUPS
Should we try to detect symmetric subgroups of the symmetry group on binary variables?
constexpr Param< int > SSTTIEBREAKRULE
rule to select the orbit in Schreier Sims inequalities (variable in 0: minimum size orbit; 1: maximum...
constexpr Param< bool > ADDSYMRESACKS
Add inequalities for symresacks for each generator?
constexpr Param< int > SSTLEADERRULE
rule to select the leader in an orbit (0: first var; 1: last var; 2: var having most conflicting vars...
constexpr Param< bool > PREFERLESSROWS
Shall orbitopes with less rows be preferred in detection?
constexpr Param< bool > DOUBLEEQUATIONS
Double equations to positive/negative version?
constexpr Param< bool > SSTADDCUTS
Should Schreier Sims constraints be added?
constexpr Param< double > COMPRESSTHRESHOLD
Compression is used if percentage of moved vars is at most the threshold.
constexpr Param< int > PRIORITY
priority of propagator <vbounds>
constexpr Param< double > MAXCLIQUESMEDIUM
maximum number of cliques per variable to run clique table analysis in medium presolving
constexpr Param< double > MAXCLIQUESEXHAUSTIVE
maximum number of cliques per variable to run clique table analysis in exhaustive presolving
constexpr Param< bool > DELAY
should propagator be delayed, if other propagators found reductions?
constexpr Param< bool > DOTOPOSORT
should the bounds be topologically sorted in advance?
constexpr Param< int > PRESOLPRIORITY
presolving priority of propagator <vbounds>
constexpr Param< int > PRESOLTIMING
timing mask of the presolving method of propagator <vbounds> (4:FAST, 8:MEDIUM, 16:EXHAUSTIVE,...
constexpr Param< int > MAXPREROUNDS
maximal number of presolving rounds the propagator participates in (-1: no limit)
constexpr Param< bool > USEBDWIDENING
should bound widening be used to initialize conflict analysis?
constexpr Param< bool > SORTCLIQUES
should cliques be regarded for the topological sort?
constexpr Param< bool > USECLIQUES
should cliques be propagated?
constexpr Param< double > MINNEWCLIQUES
minimum percentage of new cliques to trigger another clique table analysis
constexpr Param< int > FREQ
frequency for calling propagator <vbounds> (-1: never, 0: only in root node)
constexpr Param< bool > DETECTCYCLES
should cycles in the variable bound graph be identified?
constexpr Param< bool > USEIMPLICS
should implications be propagated?
constexpr Param< int > TIMINGMASK
timing when propagator should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP,...
constexpr Param< bool > USEVBOUNDS
should vbounds be propagated?
constexpr Param< int > MAXROUNDS
maximal number of propagation rounds per node (-1: unlimited)
constexpr Param< bool > ABORTONCUTOFF
should propagation be aborted immediately? setting this to FALSE could help conflict analysis to prod...
constexpr Param< int > MAXROUNDSROOT
maximal number of propagation rounds in the root node (-1: unlimited)
constexpr Param< int > RANDOMSEEDSHIFT
global shift of all random seeds in the plugins and the LP random seed
constexpr Param< bool > PERMUTECONSS
should order of constraints be permuted (depends on permutationseed)?
constexpr Param< int > LPSEED
random seed for LP solver, e.g. for perturbations in the simplex (0: LP default)
constexpr Param< int > PERMUTATIONSEED
seed value for permuting the problem after reading/transformation (0: no permutation)
constexpr Param< bool > PERMUTEVARS
should order of variables be permuted (depends on permutationseed)?
constexpr Param< bool > IMPROVEONLY
only use improving bounds
constexpr Param< bool > WRITEFIXEDVARS
should fixed and aggregated variables be printed (if not, re-parsing might fail)
constexpr Param< bool > USEOBJ
should an artificial objective, depending on the number of clauses a variable appears in,...
constexpr Param< bool > FREEINTS
have integer variables no upper bound by default (depending on GAMS version)?
constexpr Param< bool > REPLACEFORBIDDENCHARS
shall characters '#', '*', '+', '/', and '-' in variable and constraint names be replaced by '_'?
constexpr Param< bool > SIGNPOWER
is it allowed to use the gams function signpower(x,a)?
constexpr Param< char > INDICATORREFORM
which reformulation to use for indicator constraints: 'b'ig-M, 's'os1
constexpr Param< double > BIGMDEFAULT
default M value for big-M reformulation of indicator constraints in case no bound on slack variable i...
constexpr Param< bool > LINEARIZE_AND_CONSTRAINTS
should possible "and" constraint be linearized when writing the lp file?
constexpr Param< bool > AGGRLINEARIZATION_ANDS
should an aggregated linearization for and constraints be used?
constexpr Param< bool > AGGRLINEARIZATION_ANDS
should an aggregated linearization for and constraints be used?
constexpr Param< bool > LINEARIZE_AND_CONSTRAINTS
should possible "and" constraint be linearized when writing the mps file?
constexpr Param< bool > MULTISYMBOL
use '*' between coefficients and variables by writing to problem?
constexpr Param< bool > DYNAMICCONSS
should model constraints be subject to aging?
constexpr Param< bool > BINARY
should the output format be binary(P4) (otherwise plain(P1) format)
constexpr Param< int > MAXROWS
maximum number of rows in the scaled picture (-1 for no limit)
constexpr Param< int > MAXCOLS
maximum number of columns in the scaled picture (-1 for no limit)
constexpr Param< bool > RGBRELATIV
should the coloring values be relativ or absolute
constexpr Param< int > RGBLIMIT
maximal color value
constexpr Param< int > COEFFICIENTLIMIT
splitting coefficients in this number of intervals
constexpr Param< bool > RGBASCII
should the output format be binary(P6) (otherwise plain(P3) format)
constexpr Param< bool > USEBENDERS
should Benders' decomposition be used?
constexpr Param< bool > DYNAMICCOLS
should columns be added and removed dynamically to the LP?
constexpr Param< bool > DYNAMICCONSS
should model constraints be subject to aging?
constexpr Param< bool > INITIALCONSS
should model constraints be marked as initial?
constexpr Param< bool > DYNAMICROWS
should rows be added and removed dynamically to the LP?
constexpr Param< bool > SEPAINFSUBTREES
save global constraints to separate infeasible subtrees.
constexpr Param< int > SOLVELP
at which reopttype should the LP be solved? (1: transit, 3: strong branched, 4: w/ added logicor,...
constexpr Param< int > MAXDIFFOFNODES
maximal number of bound changes between two stored nodes on one path
constexpr Param< bool > USESPLITCONS
use constraints to reconstruct the subtree pruned be dual reduction when reactivating the node
constexpr Param< int > MAXSAVEDNODES
maximal number of saved nodes
constexpr Param< bool > USECUTS
reoptimize cuts found at the root node
constexpr Param< bool > COMMONTIMELIMIT
time limit over all reoptimization rounds?.
constexpr Param< char > VARORDERINTERDICTION
use 'd'efault, 'r'andom or a variable ordering based on 'i'nference score for interdiction branching ...
constexpr Param< double > OBJSIMROOTLP
similarity of two sequential objective function to disable solving the root LP.
constexpr Param< int > MAXCUTAGE
maximal age of a cut to be use for reoptimization
constexpr Param< bool > SEPABESTSOL
separate the optimal solution, i.e., for constrained shortest path
constexpr Param< bool > STOREVARHISTORY
use variable history of the previous solve if the objctive function has changed only slightly
constexpr Param< double > OBJSIMSOL
similarity of two objective functions to re-use stored solutions
constexpr Param< int > SOLVELPDIFF
maximal number of bound changes at node to skip solving the LP
constexpr Param< int > SAVESOLS
number of best solutions which should be saved for the following runs. (-1: save all)
constexpr Param< bool > STRONGBRANCHINGINIT
try to fix variables at the root node before reoptimizing by probing like strong branching
constexpr Param< bool > SHRINKINNER
replace branched inner nodes by their child nodes, if the number of bound changes is not to large
constexpr Param< bool > SAVECONSPROP
save constraint propagations
constexpr Param< int > FORCEHEURRESTART
force a restart if the last n optimal solutions were found by heuristic reoptsols
constexpr Param< bool > REDUCETOFRONTIER
delete stored nodes which were not reoptimized
constexpr Param< bool > ENABLE
should reoptimization used?
constexpr Param< double > DELAY
minimum similarity for using reoptimization of the search tree.
constexpr Param< bool > USEPSCOST
re-use pseudo costs if the objective function changed only slightly
constexpr Param< int > MAXROUNDSROOT
maximal number of cmir separation rounds in the root node (-1: unlimited)
constexpr Param< int > MAXAGGRS
maximal number of aggregations for each row per separation round
constexpr Param< double > MAXSLACKROOT
maximal slack of rows to be used in aggregation in the root node
constexpr Param< int > MAXAGGRSROOT
maximal number of aggregations for each row per separation round in the root node
constexpr Param< bool > TRYNEGSCALING
should negative values also be tested in scaling?
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< double > MAXAGGDENSITY
maximal density of aggregated row
constexpr Param< double > MAXROWDENSITY
maximal density of row to be used in aggregation
constexpr Param< bool > DELAY
should separator be delayed, if other separators found cuts?
constexpr Param< int > MAXTRIESROOT
maximal number of rows to start aggregation with per separation round in the root node (-1: unlimited...
constexpr Param< int > MAXSEPACUTS
maximal number of cmir cuts separated per separation round
constexpr Param< int > EXPBACKOFF
base for exponential increase of frequency at which separator <aggregation> is called (1: call at eac...
constexpr Param< int > MAXSEPACUTSROOT
maximal number of cmir cuts separated per separation round in the root node
constexpr Param< double > AGGRTOL
tolerance for bound distances used to select continuous variable in current aggregated constraint to ...
constexpr Param< bool > DYNAMICCUTS
should generated cuts be removed from the LP if they are no longer tight?
constexpr Param< int > PRIORITY
priority of separator <aggregation>
constexpr Param< double > MAXSLACK
maximal slack of rows to be used in aggregation
constexpr Param< int > MAXTRIES
maximal number of rows to start aggregation with per separation round (-1: unlimited)
constexpr Param< double > DENSITYSCORE
weight of row density in the aggregation scoring of the rows
constexpr Param< int > MAXTESTDELTA
maximal number of different deltas to try (-1: unlimited)
constexpr Param< int > MAXFAILSROOT
maximal number of consecutive unsuccessful aggregation tries in the root node (-1: unlimited)
constexpr Param< double > SLACKSCORE
weight of slack in the aggregation scoring of the rows
constexpr Param< int > MAXFAILS
maximal number of consecutive unsuccessful aggregation tries (-1: unlimited)
constexpr Param< double > MAXROWFAC
maximal row aggregation factor
constexpr Param< bool > FIXINTEGRALRHS
should an additional variable be complemented if f0 = 0?
constexpr Param< int > MAXROUNDS
maximal number of cmir separation rounds per node (-1: unlimited)
constexpr Param< int > FREQ
frequency for calling separator <aggregation> (-1: never, 0: only in root node)
constexpr Param< int > DENSITYOFFSET
additional number of variables allowed in row on top of density
constexpr Param< bool > CONSHDLRUSENORM
should the violation constraint handler use the norm of a cut to check for feasibility?
constexpr Param< double > INTCONVFRAC
fraction of frac. integral variables converted to have integral value (if intconvert)
constexpr Param< bool > ONLYACTIVEROWS
Use only active rows to generate cuts?
constexpr Param< long long > MAXNODELIMIT
maximum number of nodes considered for sub-MIP (-1: unlimited)
constexpr Param< int > FREQ
frequency for calling separator <cgmip> (-1: never, 0: only in root node)
constexpr Param< bool > OBJWEIGHTSIZE
Weight each row by its size?
constexpr Param< bool > PRIMALSEPARATION
only separate cuts that are tight for the best feasible solution?
constexpr Param< bool > ONLYRANKONE
Separate only rank 1 inequalities w.r.t. CG-MIP separator?
constexpr Param< int > MAXDEPTH
maximal depth at which the separator is applied (-1: unlimited)
constexpr Param< bool > OBJLONE
Should the objective of the sub-MIP minimize the l1-norm of the multipliers?
constexpr Param< int > MAXROWAGE
maximal age of rows to consider if onlyactiverows is false
constexpr Param< bool > INTCONVERT
Convert some integral variables attaining fractional values to have integral value?
constexpr Param< bool > DYNAMICCUTS
should generated cuts be removed from the LP if they are no longer tight?
constexpr Param< double > CUTCOEFBND
bounds on the values of the coefficients in the CG-cut
constexpr Param< bool > USEOBJLB
Use lower bound on objective function (via primal solution)?
constexpr Param< bool > USESTRONGCG
use strong CG-function to strengthen cut?
constexpr Param< bool > USECUTPOOL
use cutpool to store CG-cuts even if the are not efficient?
constexpr Param< long long > MINNODELIMIT
minimum number of nodes considered for sub-MIP (-1: unlimited)
constexpr Param< bool > ADDVIOLATIONCONS
add constraint to subscip that only allows violated cuts (otherwise add obj. limit)?
constexpr Param< bool > DECISIONTREE
Use decision tree to turn separation on/off?
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< bool > SKIPMULTBOUNDS
Skip the upper bounds on the multipliers in the sub-MIP?
constexpr Param< int > MAXROUNDSROOT
maximal number of cgmip separation rounds in the root node (-1: unlimited)
constexpr Param< bool > OUTPUT
Should information about the sub-MIP and cuts be displayed?
constexpr Param< bool > GENPRIMALSOLS
Try to generate primal solutions from Gomory cuts?
constexpr Param< bool > DELAY
should separator be delayed, if other separators found cuts?
constexpr Param< double > OBJWEIGHT
weight used for the row combination coefficient in the sub-MIP objective
constexpr Param< double > CONTCONVFRAC
fraction of integral variables converted to be continuous (if contconvert)
constexpr Param< bool > ADDVIOLCONSHDLR
add constraint handler to filter out violated cuts?
constexpr Param< int > MAXROUNDS
maximal number of cgmip separation rounds per node (-1: unlimited)
constexpr Param< int > CONTCONVMIN
minimum number of integral variables before some are converted to be continuous
constexpr Param< double > TIMELIMIT
time limit for sub-MIP
constexpr Param< double > MEMORYLIMIT
memory limit for sub-MIP
constexpr Param< int > INTCONVMIN
minimum number of integral variables before some are converted to have integral value
constexpr Param< int > EXPBACKOFF
base for exponential increase of frequency at which separator <cgmip> is called (1: call at each mult...
constexpr Param< int > PRIORITY
priority of separator <cgmip>
constexpr Param< bool > USEOBJUB
Use upper bound on objective function (via primal solution)?
constexpr Param< bool > CONTCONVERT
Convert some integral variables to be continuous to reduce the size of the sub-MIP?
constexpr Param< bool > CMIROWNBOUNDS
tell CMIR-generator which bounds to used in rounding?
constexpr Param< bool > SUBSCIPFAST
Should the settings for the sub-MIP be optimized for speed?
constexpr Param< bool > ONLYINTVARS
Generate cuts for problems with only integer variables?
constexpr Param< bool > USECMIR
use CMIR-generator (otherwise add cut directly)?
constexpr Param< bool > EARLYTERM
terminate separation if a violated (but possibly sub-optimal) cut has been found?
constexpr Param< double > CLIQUEDENSITY
minimal density of cliques to use a dense clique table
constexpr Param< int > FREQ
frequency for calling separator <clique> (-1: never, 0: only in root node)
constexpr Param< int > MAXZEROEXTENSIONS
maximal number of zero-valued variables extending the clique (-1: no limit)
constexpr Param< int > EXPBACKOFF
base for exponential increase of frequency at which separator <clique> is called (1: call at each mul...
constexpr Param< int > MAXTREENODES
maximal number of nodes in branch and bound tree (-1: no limit)
constexpr Param< int > PRIORITY
priority of separator <clique>
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< int > MAXSEPACUTS
maximal number of clique cuts separated per separation round (-1: no limit)
constexpr Param< bool > DELAY
should separator be delayed, if other separators found cuts?
constexpr Param< double > CLIQUETABLEMEM
maximal memory size of dense clique table (in kb)
constexpr Param< double > SCALEVAL
factor for scaling weights
constexpr Param< int > BACKTRACKFREQ
frequency for premature backtracking up to tree level 1 (0: no backtracking)
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< int > CLOSETHRES
threshold on number of generated cuts below which the ordinary separation is started
constexpr Param< bool > INCLOBJCUTOFF
include an objective cutoff when computing the relative interior?
constexpr Param< bool > RECOMPUTERELINT
recompute relative interior point in each separation call?
constexpr Param< int > PRIORITY
priority of separator <closecuts>
constexpr Param< int > MAXUNSUCCESSFUL
turn off separation in current node after unsuccessful calls (-1 never turn off)
constexpr Param< double > SEPACOMBVALUE
convex combination value for close cuts
constexpr Param< int > EXPBACKOFF
base for exponential increase of frequency at which separator <closecuts> is called (1: call at each ...
constexpr Param< int > FREQ
frequency for calling separator <closecuts> (-1: never, 0: only in root node)
constexpr Param< bool > DELAY
should separator be delayed, if other separators found cuts?
constexpr Param< double > MAXLPITERFACTOR
factor for maximal LP iterations in relative interior computation compared to node LP iterations (neg...
constexpr Param< bool > SEPARELINT
generate close cuts w.r.t. relative interior point (best solution otherwise)?
constexpr Param< int > PRIORITY
priority of separator <cmir>
constexpr Param< int > FREQ
frequency for calling separator <cmir> (-1: never, 0: only in root node)
constexpr Param< int > EXPBACKOFF
base for exponential increase of frequency at which separator <cmir> is called (1: call at each multi...
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< bool > DELAY
should separator be delayed, if other separators found cuts?
constexpr Param< int > PRIORITY
priority of separator <convexproj>
constexpr Param< bool > DELAY
should separator be delayed, if other separators found cuts?
constexpr Param< int > MAXDEPTH
maximal depth at which the separator is applied (-1: unlimited)
constexpr Param< int > NLPITERLIMIT
iteration limit of NLP solver; 0 for no limit
constexpr Param< int > EXPBACKOFF
base for exponential increase of frequency at which separator <convexproj> is called (1: call at each...
constexpr Param< int > FREQ
frequency for calling separator <convexproj> (-1: never, 0: only in root node)
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< int > MAXROUNDS
maximal number of separation rounds per iteration in a branching node (-1: no limit)
constexpr Param< int > MAXINVCUTSROOT
maximal number of cuts investigated per iteration in the root node
constexpr Param< double > MAXWEIGHTRANGE
maximal valid range max(|weights|)/min(|weights|) of row weights
constexpr Param< bool > STRENGTHEN
strengthen cut if integer variables are present.
constexpr Param< int > MAXROUNDSROOT
maximal number of separation rounds in the root node (-1: no limit)
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< int > MAXRANKINTEGRAL
maximal rank of a disj. cut that could be scaled to integral coefficients (-1: unlimited)
constexpr Param< int > MAXINVCUTS
maximal number of cuts investigated per iteration in a branching node
constexpr Param< int > PRIORITY
priority of separator <disjunctive>
constexpr Param< int > MAXCONFSDELAY
delay separation if number of conflict graph edges is larger than predefined value (-1: no limit)
constexpr Param< int > MAXDEPTH
node depth of separating bipartite disjunctive cuts (-1: no limit)
constexpr Param< bool > DELAY
should separator be delayed, if other separators found cuts?
constexpr Param< int > MAXRANK
maximal rank of a disj. cut that could not be scaled to integral coefficients (-1: unlimited)
constexpr Param< int > EXPBACKOFF
base for exponential increase of frequency at which separator <disjunctive> is called (1: call at eac...
constexpr Param< int > FREQ
frequency for calling separator <disjunctive> (-1: never, 0: only in root node)
constexpr Param< bool > DYNAMICCUTS
should generated cuts be removed from the LP if they are no longer tight?
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< double > MINVIOLATION
minimal violation of an edge-concave cut to be separated
constexpr Param< int > EXPBACKOFF
base for exponential increase of frequency at which separator <eccuts> is called (1: call at each mul...
constexpr Param< int > MAXSEPACUTS
maximal number of edge-concave cuts separated per separation round
constexpr Param< double > CUTMAXRANGE
maximal coef. range of a cut (max coef. divided by min coef.) in order to be added to LP relaxation
constexpr Param< int > MAXAGGRSIZE
search for edge-concave aggregations of at most this size
constexpr Param< int > MINAGGRSIZE
search for edge-concave aggregations of at least this size
constexpr Param< int > MAXBILINTERMS
maximum number of bilinear terms allowed to be in a quadratic constraint
constexpr Param< int > FREQ
frequency for calling separator <eccuts> (-1: never, 0: only in root node)
constexpr Param< bool > DELAY
should separator be delayed, if other separators found cuts?
constexpr Param< int > MAXSTALLROUNDS
maximum number of unsuccessful rounds in the edge-concave aggregation search
constexpr Param< int > PRIORITY
priority of separator <eccuts>
constexpr Param< int > MAXSEPACUTSROOT
maximal number of edge-concave cuts separated per separation round in the root node
constexpr Param< int > MAXROUNDS
maximal number of eccuts separation rounds per node (-1: unlimited)
constexpr Param< int > MAXROUNDSROOT
maximal number of eccuts separation rounds in the root node (-1: unlimited)
constexpr Param< int > MAXDEPTH
maximal depth at which the separator is applied (-1: unlimited)
constexpr Param< bool > DELAY
should separator be delayed, if other separators found cuts?
constexpr Param< int > PRIORITY
priority of separator <flowcover>
constexpr Param< int > EXPBACKOFF
base for exponential increase of frequency at which separator <flowcover> is called (1: call at each ...
constexpr Param< int > FREQ
frequency for calling separator <flowcover> (-1: never, 0: only in root node)
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< int > PRIORITY
priority of separator <gauge>
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< int > FREQ
frequency for calling separator <gauge> (-1: never, 0: only in root node)
constexpr Param< bool > DELAY
should separator be delayed, if other separators found cuts?
constexpr Param< int > EXPBACKOFF
base for exponential increase of frequency at which separator <gauge> is called (1: call at each mult...
constexpr Param< int > NLPITERLIMIT
iteration limit of NLP solver; 0 for no limit
constexpr Param< int > MAXRANK
maximal rank of a gomory cut that could not be scaled to integral coefficients (-1: unlimited)
constexpr Param< int > MAXSEPACUTSROOT
maximal number of gomory cuts separated per separation round in the root node
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< int > MAXRANKINTEGRAL
maximal rank of a gomory cut that could be scaled to integral coefficients (-1: unlimited)
constexpr Param< bool > DYNAMICCUTS
should generated cuts be removed from the LP if they are no longer tight?
constexpr Param< bool > SIDETYPEBASIS
choose side types of row (lhs/rhs) based on basis information?
constexpr Param< bool > FORCECUTS
if conversion to integral coefficients failed still consider the cut
constexpr Param< double > AWAY
minimal integrality violation of a basis variable in order to try Gomory cut
constexpr Param< int > FREQ
frequency for calling separator <gomory> (-1: never, 0: only in root node)
constexpr Param< bool > SEPARATEROWS
separate rows with integral slack
constexpr Param< int > MAXSEPACUTS
maximal number of gomory cuts separated per separation round
constexpr Param< bool > DELAYEDCUTS
should cuts be added to the delayed cut pool?
constexpr Param< bool > MAKEINTEGRAL
try to scale cuts to integral coefficients
constexpr Param< bool > DELAY
should separator be delayed, if other separators found cuts?
constexpr Param< bool > GENBOTHGOMSCG
Should both Gomory and strong CG cuts be generated (otherwise take best)?
constexpr Param< int > MAXROUNDS
maximal number of gomory separation rounds per node (-1: unlimited)
constexpr Param< int > MAXROUNDSROOT
maximal number of gomory separation rounds in the root node (-1: unlimited)
constexpr Param< int > PRIORITY
priority of separator <gomory>
constexpr Param< int > EXPBACKOFF
base for exponential increase of frequency at which separator <gomory> is called (1: call at each mul...
constexpr Param< bool > TRYSTRONGCG
try to generate strengthened Chvatal-Gomory cuts?
constexpr Param< bool > DELAY
should separator be delayed, if other separators found cuts?
constexpr Param< int > FREQ
frequency for calling separator <gomorymi> (-1: never, 0: only in root node)
constexpr Param< int > EXPBACKOFF
base for exponential increase of frequency at which separator <gomorymi> is called (1: call at each m...
constexpr Param< int > PRIORITY
priority of separator <gomorymi>
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< int > PRIORITY
priority of separator <impliedbounds>
constexpr Param< bool > USETWOSIZECLIQUES
should violated inequalities for cliques with 2 variables be separated?
constexpr Param< int > EXPBACKOFF
base for exponential increase of frequency at which separator <impliedbounds> is called (1: call at e...
constexpr Param< int > FREQ
frequency for calling separator <impliedbounds> (-1: never, 0: only in root node)
constexpr Param< bool > DELAY
should separator be delayed, if other separators found cuts?
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< int > EXPBACKOFF
base for exponential increase of frequency at which separator <interminor> is called (1: call at each...
constexpr Param< double > MINCUTVIOL
minimum required violation of a cut
constexpr Param< bool > USEBOUNDS
whether to also enforce nonegativity bounds of principle minors
constexpr Param< bool > DELAY
should separator be delayed, if other separators found cuts?
constexpr Param< int > MAXROUNDSROOT
maximal number of separation rounds in the root node (-1: unlimited)
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< int > MAXROUNDS
maximal number of separation rounds per node (-1: unlimited)
constexpr Param< int > FREQ
frequency for calling separator <interminor> (-1: never, 0: only in root node)
constexpr Param< bool > USESTRENGTHENING
whether to use strengthened intersection cuts to separate minors
constexpr Param< int > PRIORITY
priority of separator <interminor>
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< int > FREQ
frequency for calling separator <intobj> (-1: never, 0: only in root node)
constexpr Param< bool > DELAY
should separator be delayed, if other separators found cuts?
constexpr Param< int > EXPBACKOFF
base for exponential increase of frequency at which separator <intobj> is called (1: call at each mul...
constexpr Param< int > PRIORITY
priority of separator <intobj>
constexpr Param< int > FREQ
frequency for calling separator <knapsackcover> (-1: never, 0: only in root node)
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< bool > DELAY
should separator be delayed, if other separators found cuts?
constexpr Param< int > PRIORITY
priority of separator <knapsackcover>
constexpr Param< int > EXPBACKOFF
base for exponential increase of frequency at which separator <knapsackcover> is called (1: call at e...
constexpr Param< bool > FIXINTEGRALRHS
should an additional variable be complemented if f0 = 0?
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< int > NCLUSTERS
number of clusters to generate in the shrunken network – default separation
constexpr Param< int > MAXTESTDELTA
maximal number of different deltas to try (-1: unlimited) – default separation
constexpr Param< int > MODELTYPE
model type of network (0: auto, 1:directed, 2:undirected)
constexpr Param< bool > DELAY
should separator be delayed, if other separators found cuts?
constexpr Param< bool > DYNAMICCUTS
should generated cuts be removed from the LP if they are no longer tight?
constexpr Param< bool > SEPARATEKNAPSACK
should we separate knapsack cover inequalities on the network cuts?
constexpr Param< int > MAXSEPACUTSROOT
maximal number of mcf cuts separated per separation round in the root node – default separation
constexpr Param< int > EXPBACKOFF
base for exponential increase of frequency at which separator <mcf> is called (1: call at each multip...
constexpr Param< bool > SEPARATEFLOWCUTSET
should we separate flowcutset inequalities on the network cuts?
constexpr Param< double > MAXARCINCONSISTENCYRATIO
maximum inconsistency ratio of arcs not to be deleted
constexpr Param< bool > SEPARATESINGLENODECUTS
should we separate inequalities based on single-node cuts?
constexpr Param< int > FREQ
frequency for calling separator <mcf> (-1: never, 0: only in root node)
constexpr Param< bool > TRYNEGSCALING
should negative values also be tested in scaling?
constexpr Param< double > MAXINCONSISTENCYRATIO
maximum inconsistency ratio for separation at all
constexpr Param< bool > CHECKCUTSHORECONNECTIVITY
should we separate only if the cuts shores are connected?
constexpr Param< int > PRIORITY
priority of separator <mcf>
constexpr Param< double > MAXWEIGHTRANGE
maximal valid range max(|weights|)/min(|weights|) of row weights
constexpr Param< int > MAXSEPACUTS
maximal number of mcf cuts separated per separation round
constexpr Param< int > MAXROUNDS
maximal number of separation rounds per node (-1: unlimited)
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< int > MAXROUNDSROOT
maximal number of separation rounds in the root node (-1: unlimited)
constexpr Param< bool > IGNOREPACKINGCONSS
whether to ignore circle packing constraints during minor detection
constexpr Param< double > MINCUTVIOL
minimum required violation of a cut
constexpr Param< bool > DELAY
should separator be delayed, if other separators found cuts?
constexpr Param< int > EXPBACKOFF
base for exponential increase of frequency at which separator <minor> is called (1: call at each mult...
constexpr Param< double > MAXMINORSFAC
factor for the maximum number of minors, i.e., max(const, fac * # quadratic terms)
constexpr Param< int > MAXMINORSCONST
constant for the maximum number of minors, i.e., max(const, fac * # quadratic terms)
constexpr Param< int > FREQ
frequency for calling separator <minor> (-1: never, 0: only in root node)
constexpr Param< int > PRIORITY
priority of separator <minor>
constexpr Param< int > PRIORITY
priority of separator <mixing>
constexpr Param< bool > DELAY
should separator be delayed, if other separators found cuts?
constexpr Param< int > FREQ
frequency for calling separator <mixing> (-1: never, 0: only in root node)
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< int > EXPBACKOFF
base for exponential increase of frequency at which separator <mixing> is called (1: call at each mul...
constexpr Param< int > MAXROUNDS
maximal number of mixing separation rounds per node (-1: unlimited)
constexpr Param< bool > ISCUTSONINTS
Should general integer variables be used to generate cuts?
constexpr Param< int > MAXNUNSUCCESSFUL
maximal number of consecutive unsuccessful iterations
constexpr Param< bool > USELOCALBOUNDS
Should local bounds be used?
constexpr Param< int > MAXROUNDSROOT
maximal number of mixing separation rounds in the root node (-1: unlimited)
constexpr Param< int > OFFSETNODESLEVEL
offset of nodes allowed in the same level of the level graph (additional to the percentage of levelno...
constexpr Param< bool > DELAY
should separator be delayed, if other separators found cuts?
constexpr Param< int > SORTSWITCH
use sorted variable array (unsorted(0), maxlp(1), minlp(2), maxfrac(3), minfrac(4))
constexpr Param< int > MAXCUTSLEVEL
maximal number of oddcycle cuts generated in every level of the level graph
constexpr Param< int > MAXREFERENCE
minimal weight on an edge (in level graph or bipartite graph)
constexpr Param< bool > ADDSELFARCS
add links between a variable and its negated
constexpr Param< int > MAXUNSUCESSFULL
number of unsuccessful calls at current node
constexpr Param< int > MAXSEPACUTS
maximal number of oddcycle cuts separated per separation round
constexpr Param< bool > INCLUDETRIANGLES
separate triangles found as 3-cycles or repaired larger cycles
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< bool > REPAIRCYCLES
try to repair violated cycles with double appearance of a variable
constexpr Param< int > MAXCUTSROOT
maximal number of oddcycle cuts generated per chosen variable as root of the level graph
constexpr Param< bool > LIFTODDCYCLES
Should odd cycle cuts be lifted?
constexpr Param< int > SCALINGFACTOR
factor for scaling of the arc-weights
constexpr Param< bool > SORTROOTNEIGHBORS
sort level of the root neighbors by fractionality (maxfrac)
constexpr Param< int > FREQ
frequency for calling separator <oddcycle> (-1: never, 0: only in root node)
constexpr Param< int > MAXROUNDS
maximal number of oddcycle separation rounds per node (-1: unlimited)
constexpr Param< bool > USEGLS
Should the search method by Groetschel, Lovasz, Schrijver be used? Otherwise use levelgraph method by...
constexpr Param< int > MAXPERNODESLEVEL
percentage of nodes allowed in the same level of the level graph [0-100]
constexpr Param< int > PRIORITY
priority of separator <oddcycle>
constexpr Param< int > MAXSEPACUTSROOT
maximal number of oddcycle cuts separated per separation round in the root node
constexpr Param< bool > MULTIPLECUTS
Even if a variable is already covered by a cut, still try it as start node for a cycle search?
constexpr Param< bool > RECALCLIFTCOEF
Calculate lifting coefficient of every candidate in every step (or only if its chosen)?
constexpr Param< int > PERCENTTESTVARS
percentage of variables to try the chosen method on [0-100]
constexpr Param< bool > ALLOWMULTIPLECUTS
Even if a variable is already covered by a cut, still allow another cut to cover it too?
constexpr Param< int > CUTTHRESHOLD
maximal number of other cuts s.t. separation is applied (-1 for direct call)
constexpr Param< int > MAXROUNDSROOT
maximal number of oddcycle separation rounds in the root node (-1: unlimited)
constexpr Param< bool > LPLIFTCOEF
Choose lifting candidate by coef*lpvalue or only by coef?
constexpr Param< int > OFFSETTESTVARS
offset of variables to try the chosen method on (additional to the percentage of testvars)
constexpr Param< int > MAXNLEVELS
maximal number of levels in level graph
constexpr Param< int > EXPBACKOFF
base for exponential increase of frequency at which separator <oddcycle> is called (1: call at each m...
constexpr Param< bool > APPLYBDCHGS
should the found global bound deductions be applied in the original SCIP?
constexpr Param< bool > REDUCEDINFER
should the inference values only be used when rapidlearning found other reductions?
constexpr Param< long long > NWAITINGNODES
number of nodes that should be processed before rapid learning is executed locally based on the progr...
constexpr Param< int > MAXNODES
maximum number of nodes considered in rapid learning run
constexpr Param< bool > APPLYSOLVED
should a solved status be copied to the original SCIP?
constexpr Param< int > EXPBACKOFF
base for exponential increase of frequency at which separator <rapidlearning> is called (1: call at e...
constexpr Param< int > FREQ
frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
constexpr Param< bool > CHECKDUALBOUND
should the progress on the dual bound be checked?
constexpr Param< bool > DELAY
should separator be delayed, if other separators found cuts?
constexpr Param< double > MINVARCONSRATIO
minimal ratio of unfixed variables in relation to basis size to allow local rapid learning
constexpr Param< int > PRIORITY
priority of separator <rapidlearning>
constexpr Param< double > LPITERQUOT
maximal fraction of LP iterations compared to node LP iterations
constexpr Param< bool > CHECKEXEC
check whether rapid learning should be executed
constexpr Param< bool > CHECKOBJ
should the (local) objective function be checked?
constexpr Param< bool > APPLYCONFLICTS
should the found conflicts be applied in the original SCIP?
constexpr Param< bool > APPLYINFERVALS
should the inference values be used as initialization in the original SCIP?
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< bool > COPYCUTS
should all active cuts from cutpool be copied to constraints in subproblem?
constexpr Param< int > MINNODES
minimum number of nodes considered in rapid learning run
constexpr Param< int > MAXNVARS
maximum problem size (variables) for which rapid learning will be called
constexpr Param< bool > CHECKDEGENERACY
should local LP degeneracy be checked?
constexpr Param< int > MAXCALLS
maximum number of overall calls
constexpr Param< int > MAXNCONSS
maximum problem size (constraints) for which rapid learning will be called
constexpr Param< double > MININFLPRATIO
minimal threshold of inf/obj leaves to allow local rapid learning
constexpr Param< bool > CHECKNSOLS
should the number of solutions found so far be checked?
constexpr Param< bool > CHECKLEAVES
should the ratio of leaves proven to be infeasible and exceeding the cutoff bound be checked?
constexpr Param< double > MINDEGENERACY
minimal degeneracy threshold to allow local rapid learning
constexpr Param< bool > APPLYPRIMALSOL
should the incumbent solution be copied to the original SCIP?
constexpr Param< bool > CONTVARS
should rapid learning be applied when there are continuous variables?
constexpr Param< double > CONTVARSQUOT
maximal portion of continuous variables to apply rapid learning
constexpr Param< int > MAXROUNDS
maximal number of separation rounds per node (-1: unlimited)
constexpr Param< bool > ONLYCONTROWS
if set to true, only continuous rows are used for rlt cuts
constexpr Param< double > DIRCUTOFFDISTWEIGHT
weight of directed cutoff distance in cut score calculation
constexpr Param< bool > HIDDENRLT
whether RLT cuts (TRUE) or only McCormick inequalities (FALSE) should be added for hidden products
constexpr Param< bool > DELAY
should separator be delayed, if other separators found cuts?
constexpr Param< bool > USEPROJECTION
if set to true, projected rows are checked first
constexpr Param< double > OBJPARALWEIGHT
weight of objective parallelism in cut score calculation
constexpr Param< int > FREQ
frequency for calling separator <rlt> (-1: never, 0: only in root node)
constexpr Param< double > EFFICACYWEIGHT
weight of efficacy in cut score calculation
constexpr Param< bool > DETECTHIDDEN
if set to true, hidden products are detected and separated by McCormick cuts
constexpr Param< double > BADSCORE
threshold for score of cut relative to best score to be discarded
constexpr Param< int > MAXUNKNOWNTERMS
maximal number of unknown bilinear terms a row is still used with (-1: unlimited)
constexpr Param< int > MAXROUNDSROOT
maximal number of separation rounds in the root node (-1: unlimited)
constexpr Param< bool > ADDTOPOOL
if set to true, globally valid RLT cuts are added to the global cut pool
constexpr Param< double > GOODMAXPARALL
maximum parallelism for good cuts
constexpr Param< double > GOODSCORE
threshold for score of cut relative to best score to be considered good, so that less strict filterin...
constexpr Param< int > EXPBACKOFF
base for exponential increase of frequency at which separator <rlt> is called (1: call at each multip...
constexpr Param< int > MAXUSEDVARS
maximal number of variables used to compute rlt cuts (-1: unlimited)
constexpr Param< bool > USEINSUBSCIP
if set to true, rlt is also used in sub-scips
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< double > MAXPARALL
maximum parallelism for non-good cuts
constexpr Param< int > MAXNCUTS
maximal number of rlt-cuts that are added per round (-1: unlimited)
constexpr Param< bool > ONLYEQROWS
if set to true, only equality rows are used for rlt cuts
constexpr Param< bool > ONLYORIGINAL
if set to true, only original rows and variables are used
constexpr Param< int > PRIORITY
priority of separator <rlt>
constexpr Param< int > EXPBACKOFF
base for exponential increase of frequency at which separator <strongcg> is called (1: call at each m...
constexpr Param< bool > DELAY
should separator be delayed, if other separators found cuts?
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< int > FREQ
frequency for calling separator <strongcg> (-1: never, 0: only in root node)
constexpr Param< int > PRIORITY
priority of separator <strongcg>
constexpr Param< int > MAXSEPACUTS
maximal number of zerohalf cuts separated per separation round
constexpr Param< double > GOODMAXPARALL
maximum parallelism for good cuts
constexpr Param< double > OBJPARALWEIGHT
weight of objective parallelism in cut score calculation
constexpr Param< int > MAXCUTCANDS
maximal number of zerohalf cuts considered per separation round
constexpr Param< double > MAXROWDENSITY
maximal density of row to be used in aggregation
constexpr Param< double > EFFICACYWEIGHT
weight of efficacy in cut score calculation
constexpr Param< int > MAXSEPACUTSROOT
maximal number of zerohalf cuts separated per separation round in the root node
constexpr Param< double > MAXSLACKROOT
maximal slack of rows to be used in aggregation in the root node
constexpr Param< int > DENSITYOFFSET
additional number of variables allowed in row on top of density
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< double > MAXPARALL
maximum parallelism for non-good cuts
constexpr Param< int > MAXROUNDS
maximal number of zerohalf separation rounds per node (-1: unlimited)
constexpr Param< double > MINVIOL
minimal violation to generate zerohalfcut for
constexpr Param< bool > DYNAMICCUTS
should generated cuts be removed from the LP if they are no longer tight?
constexpr Param< int > MAXROUNDSROOT
maximal number of zerohalf separation rounds in the root node (-1: unlimited)
constexpr Param< double > DIRCUTOFFDISTWEIGHT
weight of directed cutoff distance in cut score calculation
constexpr Param< bool > DELAY
should separator be delayed, if other separators found cuts?
constexpr Param< double > GOODSCORE
threshold for score of cut relative to best score to be considered good, so that less strict filterin...
constexpr Param< int > INITSEED
initial seed used for random tie-breaking in cut selection
constexpr Param< int > PRIORITY
priority of separator <zerohalf>
constexpr Param< double > MAXSLACK
maximal slack of rows to be used in aggregation
constexpr Param< double > BADSCORE
threshold for score of cut relative to best score to be discarded
constexpr Param< int > EXPBACKOFF
base for exponential increase of frequency at which separator <zerohalf> is called (1: call at each m...
constexpr Param< int > FREQ
frequency for calling separator <zerohalf> (-1: never, 0: only in root node)
constexpr Param< char > EFFICACYNORM
row norm to use for efficacy calculation ('e'uclidean, 'm'aximum, 's'um, 'd'iscrete)
constexpr Param< int > CUTAGELIMIT
maximum age a cut can reach before it is deleted from the global cut pool, or -1 to keep all cuts
constexpr Param< int > POOLFREQ
separation frequency for the global cut pool (-1: disable global cut pool, 0: only separate pool at t...
constexpr Param< int > MAXCUTSROOT
maximal number of separated cuts at the root node (0: disable root node separation)
constexpr Param< double > MAXBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< int > MAXSTALLROUNDSROOT
maximal number of consecutive separation rounds without objective or integrality improvement in the r...
constexpr Param< char > ORTHOFUNC
function used for calc. scalar prod. in orthogonality test ('e'uclidean, 'd'iscrete)
constexpr Param< double > MINEFFICACYROOT
minimal efficacy for a cut to enter the LP in the root node
constexpr Param< double > MAXLOCALBOUNDDIST
maximal relative distance from current node's dual bound to primal bound compared to best node's dual...
constexpr Param< double > MINEFFICACY
minimal efficacy for a cut to enter the LP
constexpr Param< int > MAXADDROUNDS
maximal additional number of separation rounds in subsequent price-and-cut loops (-1: no additional r...
constexpr Param< int > MAXROUNDSROOTSUBRUN
maximal number of separation rounds in the root node of a subsequent run (-1: unlimited)
constexpr Param< double > MINACTIVITYQUOT
minimum cut activity quotient to convert cuts into constraints during a restart (0....
constexpr Param< char > CUTSELRESTART
cut selection during restart ('a'ge, activity 'q'uotient)
constexpr Param< double > MAXCOEFRATIOFACROWPREP
maximal ratio between coefficients (as factor of 1/feastol) to ensure in rowprep cleanup
constexpr Param< char > CUTSELSUBSCIP
cut selection for sub SCIPs ('a'ge, activity 'q'uotient)
constexpr Param< int > MAXROUNDSROOT
maximal number of separation rounds in the root node (-1: unlimited)
constexpr Param< int > MAXROUNDS
maximal number of separation rounds per node (-1: unlimited)
constexpr Param< bool > FILTERCUTPOOLREL
should cutpool separate only cuts with high relative efficacy?
constexpr Param< int > MAXCUTS
maximal number of cuts separated per separation round (0: disable local separation)
constexpr Param< int > MAXRUNS
maximal number of runs for which separation is enabled (-1: unlimited)
constexpr Param< double > MAXCOEFRATIO
maximal ratio between coefficients in strongcg, cmir, and flowcover cuts
constexpr Param< int > MAXSTALLROUNDS
maximal number of consecutive separation rounds without objective or integrality improvement in local...
constexpr Param< bool > ENABLED
should the event handler adapt the solver behavior?
constexpr Param< long long > NODEOFFSET
node offset for rank-1 and estimate transitions
constexpr Param< bool > USEEMPHSETTINGS
should emphasis settings for the solving phases be used, or settings files?
constexpr Param< bool > USERESTART1TO2
should a restart be applied between the feasibility and improvement phase?
constexpr Param< bool > FALLBACK
should the event handler fall back from optimal phase?
constexpr Param< std::string > IMPROVESETNAME
settings file for improvement phase – precedence over emphasis settings
constexpr Param< double > OPTIMALVALUE
optimal solution value for problem
constexpr Param< char > TRANSITIONMETHOD
transition method: Possible options are 'e'stimate,'l'ogarithmic regression,'o'ptimal-value based,...
constexpr Param< char > XTYPE
x-type for logarithmic regression - (t)ime, (n)odes, (l)p iterations
constexpr Param< std::string > FEASSETNAME
settings file for feasibility phase – precedence over emphasis settings
constexpr Param< bool > TESTMODE
should the event handler test all phase transitions?
constexpr Param< bool > INTERRUPTOPTIMAL
should the event handler interrupt the solving process after optimal solution was found?
constexpr Param< std::string > PROOFSETNAME
settings file for proof phase – precedence over emphasis settings
constexpr Param< bool > USERESTART2TO3
should a restart be applied between the improvement and the proof phase?
constexpr Param< bool > ACTIVE
is statistics table <benders> active
constexpr Param< bool > ACTIVE
is statistics table <branchrules> active
constexpr Param< bool > ACTIVE
is statistics table <compression> active
constexpr Param< bool > ACTIVE
is statistics table <concurrentsolver> active
constexpr Param< bool > ACTIVE
is statistics table <conflict> active
constexpr Param< bool > ACTIVE
is statistics table <cons_nonlinear> active
constexpr Param< bool > ACTIVE
is statistics table <constiming> active
constexpr Param< bool > ACTIVE
is statistics table <constraint> active
constexpr Param< bool > ACTIVE
is statistics table <cutsel> active
constexpr Param< bool > ACTIVE
is statistics table <estim> active
constexpr Param< bool > ACTIVE
is statistics table <exprhdlr> active
constexpr Param< bool > ACTIVE
is statistics table <heuristics> active
constexpr Param< bool > ACTIVE
is statistics table <lp> active
constexpr Param< bool > ACTIVE
is statistics table <neighborhood> active
constexpr Param< bool > ACTIVE
is statistics table <nlhdlr_bilinear> active
constexpr Param< bool > ACTIVE
is statistics table <nlhdlr_quadratic> active
constexpr Param< bool > ACTIVE
is statistics table <nlhdlr> active
constexpr Param< bool > ACTIVE
is statistics table <nlp> active
constexpr Param< bool > ACTIVE
is statistics table <nlpi> active
constexpr Param< bool > ACTIVE
is statistics table <orbitalfixing> active
constexpr Param< bool > ACTIVE
is statistics table <origprob> active
constexpr Param< bool > ACTIVE
is statistics table <presolvedprob> active
constexpr Param< bool > ACTIVE
is statistics table <presolver> active
constexpr Param< bool > ACTIVE
is statistics table <pricer> active
constexpr Param< bool > ACTIVE
is statistics table <propagator> active
constexpr Param< bool > ACTIVE
is statistics table <relaxator> active
constexpr Param< bool > ACTIVE
is statistics table <root> active
constexpr Param< bool > ACTIVE
is statistics table <separator> active
constexpr Param< bool > ACTIVE
is statistics table <solution> active
constexpr Param< bool > ACTIVE
is statistics table <status> active
constexpr Param< bool > ACTIVE
is statistics table <timing> active
constexpr Param< bool > ACTIVE
is statistics table <tree> active
constexpr Param< bool > READING
belongs reading time to solving time?
constexpr Param< bool > ENABLED
is timing enabled?
constexpr Param< bool > STATISTICTIMING
should timing for statistic output be performed?
constexpr Param< bool > RARECLOCKCHECK
should clock checks of solving time be performed less frequently (note: time limit could be exceeded ...
constexpr Param< int > CLOCKTYPE
default clock type (1: CPU user seconds, 2: wall clock time)
constexpr Param< bool > NLPIEVAL
should time for evaluation in NLP solves be measured?
constexpr Param< bool > DISPSOLS
should the node where solutions are found be visualized?
constexpr Param< std::string > BAKFILENAME
name of the BAK tool output file, or - if no BAK tool output should be created
constexpr Param< bool > DISPLB
should lower bound information be visualized?
constexpr Param< bool > REALTIME
should the real solving time be used instead of a time step counter in visualization?
constexpr Param< bool > OBJEXTERN
should be output the external value of the objective?
constexpr Param< std::string > VBCFILENAME
name of the VBC tool output file, or - if no VBC tool output should be created
constexpr Param< bool > PRINTZEROS
should variables set to zero be printed?
constexpr Param< bool > ALLCONSS
should all constraints be written (including the redundant constraints)?
constexpr Param< int > GENERICNAMESOFFSET
when writing a generic problem the index for the first variable should start with?
Enum equivalent of SCIP's string parameters.
Stores the argument type and string representation of a parameter.