NORMAL, an automatical check of the best solution is performed in the original problem, and an error message is displayed, if it violates an original constraintcons_cumulative.{c,h} SCIP can resource-constraint scheduling problemtightenboundsfreqcons_cumulative.{c,h}objfeaspump; parameter names have been changed accordinglyexamples/TSPINITSOL and EXITSOL for variable pricers, primal heuristics, conflict handlers, relaxators, separators, propagators, event handlers, node selectors and display columnsCONFLICTEXEC of conflict handlers receive additional parameters dynamic and removeableCONSLOCK and CONSUNLOCK are replaced by a single method CONSLOCK with the number of locks being positive or negativeforcecut=TRUE will add the cut to the LP even if it is redundantextra information for the current problem, s.t. the full problem information can be distributed to different files read by different readersNULL or aborting with an error messagemaxproprounds in SCIPpropagateProbing()MEMHDR is now called BLKMEMscip.h by scip/scip.h and objscip.h by objscip/objscip.h; This should allow a user to have include files of the same name as the ones of SCIP, e.g. tree.h or var.h.afterrelaxation for primal heuristicscheckbounds for SCIPtrySol(), SCIPtrySolFree(), SCIPcheckSol()RETCODENULL or aborting with an error message; in SCIPvarGetProbvarBinary(), the fixing of a fixed variable does not influence the negation status anymoreNULL for fixed variables anymore; it may also return a multi-aggregated variable instead of aborting with an error messageaggregated in SCIPmultiaggregateVars()RETCODEdynamic to SCIPcreateCons() and all plugin methods SCIPcreateCons...()limits/sol to limits/solutionslp/pricing to steepest edge pricingbranching/relpscost/minreliable changed to 1.0branching/relpscost/maxlookahead changed to 8branching/relpscost/sbiterofs changed to 100000heuristics/coefdiving/maxlpiterquot changed to 0.05heuristics/fracdiving/maxlpiterquot changed to 0.05heuristics/guideddiving/maxlpiterquot changed to 0.05heuristics/linesearchdiving/maxlpiterquot changed to 0.05heuristics/pscostdiving/maxlpiterquot changed to 0.05heuristics/feaspump/freq changed to 20heuristics/objfeaspump/freq changed to 20heuristics/objpscostdiving/freq changed to 20heuristics/rootsoldiving/freq changed to 20separating/clique/maxtreenodes changed to -1branching/scorefuncconstraints/.../delaypresolconstraints/.../delaypropconstraints/.../delaysepaconflict/dynamicconflict/removeableheuristics/coefdiving/maxlpiterofsheuristics/feaspump/maxlpiterofsheuristics/feaspump/maxsolsheuristics/fracdiving/maxlpiterofsheuristics/guideddiving/maxlpiterofsheuristics/linesearchdiving/maxlpiterofsheuristics/objfeaspump/maxlpiterofsheuristics/objfeaspump/maxsolsheuristics/objpscostdiving/maxlpiterofsheuristics/objpscostdiving/maxsolsheuristics/pscostdiving/maxlpiterofsheuristics/rootsoldiving/maxlpiterofsheuristics/rootsoldiving/maxsolsheuristics/fixandinfer/proprounds and heuristics/fixandinfer/minfixingslp/cleanupcolsroot and lp/cleanuprowsroot to distinguish cleanup settings between root node and other nodeslp/checkstability to disable stability check of LP solver's result codelp/initalgorithm and lp/resolvealgorithm for switching between simplex and barrier algorithmlp/pricing to set the pricing strategy used in the LP solvernumerics/barrierconvtol to set the convergence tolerance in the barrier algorithmpresolving/.../delaypropagating/.../delayreading/cnfreader/dynamicconssreading/mpsreader/dynamicconssseparating/.../delaySCIP_DELAYED for EXEC method of separators, presolvers and propagators and SEPA, PROP and PRESOL methods of constraint handlersCONSLOCK-method (missing parameter scip in SCIPaddVarLocks())objrelax.h in includes of objscip.hfile == NULLCONSLOCK method of constraint handlers that don't need constraints is not calledNDEBUG and use the optimized libraryINITSOL and EXITSOLin feasibility tolerances, new methods SCIPisFeasIntegral(), SCIPisFeasFracIntegral(), SCIPfeasFloor(), SCIPfeasCeil() and SCIPfeasFrac() should be usedpresolving/abortfac a value of 0 now means to abort presolving only after no more change has been foundPROBLEM stageor and and constraint handlerslp/colagelimit and lp/rowagelimit may now be set to -1 to disable deletion of columns/rows due to agingscip-<version>/libcplex.linux.x86.a to libcplex.linux.x86.gnu.a)assert(eventfilter->len == 0 || eventfilter->eventmask != 0x00000000) from event.cheuristics/pscostdiving/freqofs to 2 and frequency offset of fracdiving heuristics/feaspump/freqofs to 0 in order to not call pscostdiving in root node, where nearly all pseudo costs are uninitialized.separating/efficacynorm to choose between Euclidean, maximum, sum and discrete norm in efficacy calculationSCIP_DELAYED for primal heuristicsgap limit reached even if the problem was solved to optimality, if the optimal solution was found at a node with lower bound equal to the global lower bound