SIGTERM
signal. If the process receives a SIGTERM
, SCIP terminates the solution process with a new SCIP_STATUS
code SCIP_STATUS_TERMINATE
and displays all relevant statistics before exiting.constraints/quadratic/maxdisaggrsize
to 1 (disaggregation can still be very helpful on some instances, but also seems hurtful on others)constraints/orbisack/orbisack/coverseparation
to constraints/orbisack/coverseparation
visual/displb
that enables output of lower bounds for visualizationpresolving/symmetry/displaynorbitvars
(whether we display the number of affected variables in the statistics)separating/efficacyfac
to change the weight of the efficacy in cut score calculationseparating/dircutoffdistfac
to change the weight of the directed cutoff distance in cut score calculationSCIP_STATUS
code SCIP_STATUS_TERMINATE
in scip/interrupt.h for handling of SIGTERM signals.NULL
pointer handling in LPIstable
for adding user-defined statistics tablesSCIP_BANDIT
together with callbacksSCIP_NLPTERMSTAT_UOBJLIM
objval
to SCIP_DECL_NLPIGETSOLUTION
for returning the optimal objective value (can be set to NULL
)allowlocal
to SCIP_DECL_SEPAEXECLP
and SCIP_DECL_SEPAEXECSOL
to switch generation of locally valid cutsdstatssize
to SCIP_DECL_NLPIDELVARSET
and SCIP_DECL_NLPIDELCONSSET
allowaddcons
from SCIPselectVarPseudoStrongBranching(), SCIPselectVarStrongBranching(), and SCIPincludeBranchruleRelpscost()scaling
from SCIPgetRowprepViolation()allowlocal
to SCIPseparateSol()SCIP_LPPARAM_LOBJLIM
and SCIP_LPPARAM_UOBJLIM
by SCIP_LPPARAM_OBJLIM
objval
to SCIPnlpiGetSolution() of NLPIs for returning the optimal objective value (can be set to NULL
)varnameslength
to SCIPexprParse()dstatssize
to SCIPnlpiDelVarSet() and SCIPnlpiDelConsSet()exprtree
parameter of SCIPnlpiChgExprtree()includeslp
to SCIPmarkRelaxSolValid(), SCIPsetRelaxSolVals() and SCIPsetRelaxSolValsSol();includeslp
from SCIPrelaxCreate() and SCIPincludeRelax()int
to unsigned int
SCIP_DISJOINTSET
member of the clique table and cannot be publicly accessedcopytables
to SCIPcopyPlugins()SCIP_STAGE_INITSOLVE
randomization/randomseedshift
automatically)display linclass
after reading a problem to classify linear constraint types-r
to pass a nonnegative integer as random seed.src/symmetry/
(initially only to BLISS)SCIP_LPPAR_LOBJLIM
and SCIP_LPPAR_UOBJLIM
by SCIP_LPPAR_OBJLIM
constraints/quadratic/disaggregate
by constraints/quadratic/maxdisaggrsize
to bound the total number of created constraints when disaggregating a quadratic constraintlp/solutionpolishing
to enable LP polishing only during probing and diving modeconflict/useboundlp
has new values d
(only dual solution analysis) and b
(both, conflict and dual solution analysis)heuristics/completesol/maxunkownrate
has changed to heuristics/completesol/maxunknownrate
heuristics/{clique,vbounds}/minfixingrate
by heuristics/{clique,vbounds}/minintfixingrate
and heuristics/{clique,vbounds}/minmipfixingrate
, which check the fixing rate before LP solving and after sub-MIP presolveseparating/maxstallrounds
only applies to nodes in the tree (not the root node, anymore); use the new parameter separating/maxstallroundsroot
for the root nodeseparating/aggregation
constraints/{abspower,bivariate,nonlinear,quadratic,soc}/scaling
constraints/{abspower,bivariate,quadratic,nonlinear}/mincutefficacysepa
constraints/{abspower,bivariate,quadratic,nonlinear}/mincutefficacyenfofac
constraints/soc/minefficacy
conflict/usemir
conflict/prefermir
heuristics/clique/{multiplier,initseed}
separating/feastolfac
separating/orthofac
separating/cgmip/allowlocal
(use parameter passed to separation callback instead)separating/{gomory,strongcg}/maxweightrange
conflict/prefinfproof
(prefer infeasibility proof to boundexceeding proof)conflict/sepaaltproofs
constraints/indicator/maxsepanonviolated
to stop separation after separation of non violated cutsconstraints/orbisack/coverseparation
(whether orbisack cover inequalities should be separated)constraints/orbisack/orbiSeparation
(whether facet defining inequalities for orbisack should be separated)constraints/orbisack/coeffbound
(maximal value of coefficients in orbisack facet inequalities)constraints/orbisack/checkpporbisack
(check whether orbisacks can be strengthened by packing/partitioning constraints)constraints/orbisack/checkalwaysfeas
(whether conscheck returns always SCIP_FEASIBLE
)constraints/orbitope/checkpporbitope
(check packing/partitioning orbitopes)constraints/orbitope/sepafullorbitope
(separate full orbitopes)constraints/orbitope/checkalwaysfeas
(whether conscheck returns always SCIP_FEASIBLE
)constraints/quadratic/{usebilinineqbranch,minscorebilinterms,bilinineqmaxseparounds}
constraints/quadratic/disaggrmergemethod
to change the strategy of how to merge independent blocks of quadratic constraintsconstraints/quadratic/mincurvcollectbilinterms
to change the minimal curvature of constraints to be considered when returning bilinear terms to other pluginsconstraints/quadratic/binreformbinaryonly
to disable reformulation of products of binary and non-binary variablesconstraints/symresack/ppsymresack
(check whether symresacks can be strengthend by packing/partitining constraints)constraints/symresack/checkalwaysfeas
(whether conscheck returns always SCIP_FEASIBLE
)expbackoff
to all separators which increases the frequency exponentially over the depth in the treeheuristics/completesol/{beforepresol,maxlpiter,maxcontvars}
heuristics/{clique,vbounds}/maxbacktracks
to limit the number of backtracks in the fix-and-propagate phaseheuristics/{clique,vbounds}/uselockfixings
to enable fixing of additional variables based on variable locksheuristics/vbounds/{feasvariant,tightenvariant}
to specify the fixing variants used by the vbounds heuristiclp/refactorinterval
to change the refactorization interval of the LP solvermisc/debugsol
to specify a debug solution that should be checked during the solvemisc/usesymmetry
to determine whether symmetry handling should be usedpresolving/symbreak/conssaddlp
(whether symmetry handling inequalities should be added to the LP)presolving/symbreak/addsymresacks
(whether symresacks should be used to handle symmetries)presolving/symbreak/computeorbits
(whether symmetry orbits should be computed)presolving/symbreak/detectorbitopes
(whether it should be checked if some symmetries can be handled by orbitopes)presolving/symmetry/computepresolved
(Whether symmetries are computed after presolving)presolving/symmetry/maxgenerators
(maximal number of generators generated by symmetry detection)presolving/symmetry/checksymmetries
(whether validity of computed symmetries should be verified)propagating/obbt/{itlimitfactorbilin,minnonconvexity,createbilinineqs}
propagating/vbounds/minnewcliques
to specify the minimum number of new cliques to trigger another clique table analysispropagating/vbounds/{maxcliquesmedium,maxcliquesexhaustive}
to limit the number of cliques relative to the number of binary variable for performing clique table analysisseparating/maxincrounds
separating/maxlocalbounddist
, separating/maxcoefratio
and separating/intsupportfac
presolving/milp/maxbadgesizepar
to limit the maximal badge size if PaPILO is called in parallel modepresolving/milp/maxbadgesizeseq
to limit the maximal badge size if PaPILO is called in sequential modeSCIP_Shortbool
(equal to uint8_t) for storing Boolean values in a more compact mannerSCIP_DISJOINTSET
to incrementally update connectedness information for a graph on nodes {0,...,n-1}src/scip/rbtree.{c,h}
SCIP_LINCONSSTATS
, see type_cons.h, to work with linear constraint classification through the C APISCIP_TABLE
together with callbacks to output SCIP statisticsWORHP=true
in order to link to WORHPFILTERSQP=true
in order to link to FilterSQPDEBUGSOL={true,false}
to enable checks against a user given debug solutionfalse
usefp20
parameterOBJSENSE
section and tries to generate unique names of constraints