-o and command validatesolve in interactive shell to validate the solution against an external primal and dual reference value.heuristics/completesol/maxunkownrate to heuristics/completesol/maxunknownrateSCIP_UNUSED in memory.h if def.h is not includedsolvingphases/enabledRoot LP Estimate that shows the root LP best-estimate with every pseudo-cost updatePrimal Heuristic section.CONSENFORELAX to enforce a relaxation solution, see How to add constraint handlersCONSINITLP callback now has a new parameter infeasible, which is a pointer to store whether infeasibility was detected while building the initial LP relaxationconftype and iscutoffinvolved to SCIPinitConflictAnalysis() that indicate the type of the conflict and whether the current cutoff bound is used or notinfeasible to SCIPinitlpCons()fixedvars, fixedvals, nfixedvars to SCIPcopyVars()fixedvars, fixedvals, nfixedvars to SCIPcopyOrigVars()success to valid in SCIPgetConsCopy()SCIP_HASHTABLE and SCIP_HASHMAPSCIP_HASHTABLE and SCIP_HASHMAP choose an appropriate size internally to allow insertion of that many elements without resizingSCIP_MULTIHASH behaves like the old SCIP_HASHTABLE and SCIPcalcMultihashSize() should be used as replacement for SCIPcalcHashtableSize()curvature to SCIPcreateNlRow()initialseed to SCIPcreateDiveset()SCIP_HEURTIMING for primal heuristic timing maskstimingmask from unsigned int to SCIP_HEURTIMING in SCIPincludeHeur(), SCIPincludeHeurBasic()includeslp for SCIPincludeRelax() and SCIPincludeRelaxBasic() to indicate whether relaxation includes all linear rows and can be enforcedcompletely to SCIPtrySol(), SCIPtrySolFree(), SCIPcheckSol() to check all constraints when printing violations[debug] prefix via the message handler (compare SCIPdebugPrintf())-v to print detailed build optionsseparating/clique/cliquedensity to 0.0 such that the separator always constructs a dense clique table which proved to be faster on the benchmarks MMM and stableset.misc/permutationseed, misc/permuteconss and misc/permutevars changed to randomization/permutationseed, randomization/permuteconss and randomization/permutevarsconflict/useinflp and conflict/useboundlp are now of type char (before bool)presolving/components/) are now parameters of the components constraint handler (starting with constraints/components/)branching/sumadjustweight to adjust branching scores by adding a sum epsilon in order to keep score differences near zero, which are otherwise completely disregarded (they are adjusted to at least sum epsilon)concurrent/∗ and parallel/∗ for configuring the concurrent solving modeconstraints/cardinality/branchbalanced to decide whether to use a balanced branching scheme in the enforcing of cardinality constraintsconstraints/cardinality/balanceddepth to set the maximal depth until balanced branching is turned offconstraints/cardinality/balancedcutoff to determine that balanced branching is only used if the branching cut off value w.r.t. the current LP solution is greater than a given valueconstraints/indicator/sepaperspective to turn on separation of perspective cuts for indicator constraintsconstraints/indicator/sepapersplocal to decide whether local cuts can be used for perspective cuts for indicator constraintsconstraints/quadratic/projectedcuts to enable convex quadratics to generate gradients cuts at the projection of the point onto the region described by the constraint, which is supportinglp/solutionpolishing to enable LP polishing only at the root LP or alwaysmisc/referencevalue to pass a reference value for further analysis of the tree search, see also in featurespresolving/qpkktref/addkktbinary to allow the presence of binary variables for the KKT updatepresolving/qpkktref/updatequadbounded to add the KKT conditions to QPs only if all variables are boundedpresolving/qpkktref/updatequadindef to add the KKT conditions to QPs only if the quadratic matrix is indefiniterandomization/lpseed to set the initial seed of the LP solversolvingphases/enabled to activate adaptive behavior during the solution process; several further parameters in the solvingphases-section to control how to switch the parameters and whether a restart should be performed between the phases.SCIP_REGRESSION data structure in pub_misc.h to incrementally compute a best-fit line through pairs of observationsSCIP_MAXTREEDEPTH (replaces SCIPgetDepthLimit() and SCIPtreeGetDepthLimit())examples/ and applications/ have been updated.make.project defines a variable SCIP_VERSION containing the SCIP version numberobj/static or obj/shared, depending on SHARED=false or SHARED=true, respectively.lib/static and lib/shared, the include files are in lib/include.SHARED=trueSHARED=true automatically generates the combined library libscipsolver.so for easier linkingmake help lists all makefile options.make install copies now all header filesdll to build Windows dlls with MSVCdll target to windowslibSCIP_DIGRAPHSCIP_ERROR when a memory exception is caught in SoPlex (was SCIP_LPERROR)SCIP_STAGE_PROBLEM