1/**@page RN9 Release notes for SCIP 9
3@section RN910 SCIP 9.1.0
4*************************
9- added constraint handler that checks and enforces bounds on original variables which have been fixed or aggregated in the transformed problem
10- allow for implicit integer variables in xor constraints
11- implemented symmetry detection callbacks for pseudoboolean constraints
12- added option to consider enforcement of nonlinear constraints (including spatial branching) before integrality has been enforced
17- make sure that, in dual proof analysis, upgraded constraints can report their number of variables
18- check knapsack constraints as linear constraints to avoid violations based on implicit integrality
19- make sure that symmetry detection callbacks report success
20- make arithmetics in cuts.c more robust to avoid invalid scg cuts due to numerical rounding sensitivity
21- allow to copy pseudoboolean constraints even if no AND constraints are present in order to avoid a warning
22- set value for variable that is introduced to reformulate nonlinear objective function when reading .nl files with initial solution
23- fixed that multi-aggregations from PaPILO were accepted without ensuring that their bounds hold
25Examples and applications
26-------------------------
28- TSP: removed `gzstream.h/hpp` and parse gzipped files differently
35- SCIP_DECL_NLHDLRENFO takes additional parameter branchcandonly to indicate whether only branching candidates should be registered,
36 without looking for cuts or boundchanges
40- new function SCIPgetExprActivityNonlinear() to get activity of nonlinear constraint
41- new function SCIPincludeConshdlrFixedvar() to include new constraint handler that checks bounds on fixed original variables
45- limits/primal to terminate the solve as soon as the primal bound is at least as good as this value, same as limits/objectivestop (deprecated)
46- limits/dual to terminate the solve as soon as the dual bound is at least as good as this value
47- presolving/milp/internalmaxrounds to control the maximal rounds for each call of the milp presolver (PaPILO)
48- constraints/fixedvar/∗ to control the new constraint handler that checks bounds on fixed original variables
49- constraints/nonlinear/branching/mixfractional to specify minimal average pseudo cost count for discrete variables
50 at which to start considering spatial branching before branching on fractional integer variables
51 (default infinity means that integrality is always enforced before nonlinear constraints)
52- constraints/nonlinear/branching/fracweight to specify weight of fractionality of integer variables in spatial branching
54### New data structures
56- enum SCIP_Status has been extended by SCIP_STATUS_PRIMALLIMIT and SCIP_STATUS_DUALLIMIT to indicate termination at limits/primal and limits/dual respectively
61- changed the default symmetry computation package from sassy+bliss to sassy+nauty
62- bliss source is no longer included in the source tree, but can be linked as external library (https://github.com/ds4dm/Bliss)
63- cmake now automatically downloads and installs the latest release version of SoPlex from GitHub if it is not found directly
68- updated nauty to version 2.8.8
71@section RN901 SCIP 9.0.1
72*************************
77- fixed bug in detection of double lex matrices due to wrong memory allocation
78- fixed bug where parameter `limits/objectivestop` was copied to subscips in plugins which have different objectives
79- in count mode respect empty solution when problem is solved in presolving
80- fixed that SCIP may have tried to pass a negative random seed to an LP solver
81- fixed bug where conflict analysis in strong branching tried to analyze an unsuccessful LP solve
82- enable parameter limits/restarts by allowing to reach the restart limit in restartAllowed()
83- handle normalizing linear constraints in presolving with more caution to avoid numerical difficulties for integer variables with large coefficients
84- use quad precision to calculate residual activity bounds to reduce numerical errors for large variable bounds in cons_linear.c
85- in SCIPsolveProbingLP() when objective has been changed do not return cutoff due to exceeding the cutoff bound
86- set probing LP to be a relaxation only when objective has not been changed
87- declare contradicting infinities in getMinActivity() and getMaxActivity() as non-tight
88- reject farkas solution with large values to bound magnification of errors in SCIPgetFarkasProof()
89- if all variables are fixed, apply relative feasibility tolerance to avoid invalid infeasibility in applyFixings() of cons_linear.c
90- delete empty redundant knapsack and linear constraints after cleanup in SCIPmatrixCreate()
91- cleanup first constraints in SCIPcleanupConssVarbound(), SCIPcleanupConssSetppc(), and SCIPcleanupConssLogicor()
92- symmetry handling methods have not been added immediately after computing symmetries, which has been fixed
93- delay checking node limits after presolving to correctly continue up to the exceeding main node
94- simplified the objective sense assumption for the subproblems in the Lagromory separator
95- update effective root depth iteratively to avoid trapping it at a single child node
96- fixed that dualsparsify presolver did not always check do-not-multiaggregate variable flag
97- fixed bug in computing elements of orbits in orbital reduction
102- redefine isrelax to istight in cons_linear.c
109- A file cmake.log containing the changed options is written to the cmake build directory.
110- removed replacement of the settings of RelWithDebInfo
111- add compile option -ffp-contract=off or /fp:precise to enhance reproducibility across different systems
115- add flags -ffp-contract=off and /fp:precise to enhance reproducibility across different systems
122- added parameter "propagating/symmetry/symtiming" to determine when symmetries are computed and handled
124### Changed parameters
126- Disabled "propagating/symmetry/addconsstiming" since it is not used anymore.
127- Disabled "propagating/symmetry/ofsymcomptiming" since it is not used anymore.
129@section RN900 SCIP 9.0.0
130*************************
135- added simplification of abs(x)^n to x^n when n is even (simplify rule POW12)
136- in expression simplification, added possibility to expand power of sum with exponents larger than 2 (simplify rule POW7)
137- in expression simplification, added possibility to expand products with sums as factor when there are more than two factors (simplify rule SP12b)
138- in expression simplification, added possibility to allow expanding power of products with fractional exponent (simplify rule POW5a)
139- can now build with Lapack (used for solving nonlinear problems) explicitly; if IPOPT is used, then Lapack is accessed through it;
140 an interface to Lapack is available in lapack_calls.h
141- added support for logical constraints in binary variables and basic logical operators (and, or, not, equal) to AMPL .nl reader
142- indicator constraints now use the same slack variable for the linear constraints if binary variables are used multiple times
143 for indicator constraints
144- new diving heuristic indicatordiving that focuses on indicator variables which control semicontinuous variables
145- updated statistics on NLP relaxation; information on convexity of NLP has been added
146- added new bandit method (EXP.3-IX) that is the new default of the ALNS heuristic
147- added dialog to display recognized permutation symmetries ("display symmetry")
148- The symmetry detection code has been completely restructured. Instead of completely encoding symmetry information in
149 prop_symmetry.c, there is a new callback for constraint handlers, which returns symmetry relevant information by
150 encoding a constraint as a node and edge colored graph. This way, also custom constraint handlers can provide
151 symmetry information.
152- added special presolving step for logicor and set covering/packing for constraints with two variables and one independent variable
153- increased the depth field of the tree structure from 16 to 30 bits and the max depth of the search tree from 65534 to 1073741822
154- added new cut selector plugin called cutsel_ensemble. Performs a superset of hybrid cutsel. Implements new filtering methods and scoring options.
155- added new branching rule based on Gomory mixed-integer cuts
156- added new branching score to the reliability pseudo-cost branching rule
157- added new cut selector plugin called cutsel_dynamic. Performs a superset of hybrid cutsel. Implements new filtering methods and scoring options.
158- added monoidal strengthening to intersection cut generation of nlhdlr_quadratic
159- extended heuristic dps to run after processing the node and to use strict limits for the reoptimization step
160- extended obbt propagator to handle variables of the linear constraints corresponding to indicator constraints
161- added new heuristic heur_scheduler that models the selection of LNS and diving heuristics as a multi-armed bandit problem
162- added nonlinear handler for signomial expressions: adds cuts based on a difference of convex functions representation
163- Delayed separators are now called if no other cuts have been found. Previously, such separators were only called near stalling or when the separation rounds limit was reached.
164- added a new separator sepa_lagromory to generate Lagromory cuts in a relax-and-cut framework, i.e., GMI cuts generated
165 at different bases that are explored in the process of solving the Lagrangian dual problem at a node. This separator
167- when parsing nonlinear constraints from CIP files, the * after the number in a term is now optional if followed by a variable,
168 i.e., instead of 3*<x>*<y>, now also 3<x>*<y> can be read, but 3<x><y> is not supported;
169 this allows to read some CIP files that were written with SCIP < 8
170- when running bliss, we now limit the number of actually created generators and not the ones considered by bliss
172Performance improvements
173------------------------
175- Variable conflict-based addition of Schreier-Sims cuts for symmetry handling in prop_symmetry.c does no longer use
176 an expensive explicit conflict graph construction.
177- Only run propagation of indicator constraints if relevant variables have changed.
178- Propagation of indicator constraints propagates maximal activity of linear constraint to upper bound of slack variable.
179- Added initialization of LP relaxation for SOC constraints.
180- Avoided some numerical issues when separating SOC constraints.
181- If differentation of convex expression fails in convex nlhdlr, then a perturbed point is tried.
182- Use sassy/bliss as default symmetry computation package.
183- No longer linearize indicator constraints in undercover heuristic by default.
184- Deactivate pre-root heuristic zeroobj in undercover heuristic.
185- Added new branching score tiebreaker for reliability pseudo-cost branching rule
186- Try nearest bound if zero solution value is out of bounds in heuristic trivial.
191### New and changed callbacks
193- Added solution linearization callback for nonlinear handlers.
194 The nonlinear handler may use this callback to add tight cuts that use the given solution as reference point to the cutpool.
195 The callback is called if option constraints/nonlinear/linearizeheursol is enabled.
196- The callback for copying problem data SCIP_DECL_PROBCOPY() now has a parameter "original" indicating whether the original
197 or transformed problem should be copied. Similarly, SCIPprobCopy() in prob.h/c has such a parameter.
198- Added CONSGETPERMSYMGRAPH and CONSGETSIGNEDPERMSYMGRAPH callback for constraint handlers, which provides symmetry information about constraints to SCIP.
200### Deleted and changed API methods
202- SCIPtpiInitLock(), SCIPtpiDestroyLock(), SCIPtpiInitCondition(), SCIPtpiDestroyCondition() now take a double
203 pointer to SCIP_LOCK/SCIP_CONDITION, respectively.
204- Renamed SCIPtpiSumbitJob() to SCIPtpiSubmitJob().
205- SCIPcreateConsIndicatorLinCons(), SCIPcreateConsIndicatorGenericLinCons() do not allow binvar to be NULL anymore
206- Replaced SCIPnlrowSetCurvature() by SCIPsetNlRowCurvature().
207- SCIPsnprintf() now returns the required string length in case reallocation is necessary.
208- SCIPcomputeCoverUndercover() receives three more arguments which nonlinearities to cover
209- removed definition of SQRT
210- SCIPincludeObjConshdlr(), SCIPincludeConshdlr(), SCIPconshdlrCreate() receive two more arguments for the
211 conshdlr callbacks CONSGETPERMSYMGRAPH and CONSGETSIGNEDPERMSYMGRAPH
212- removed SYM_VARTYPE, SYM_OPTYPE, SYM_CONSTTYPE, SYM_RHSTYPE, SYM_MATRIXDATA
213- new parameter issigned for SCIPcomputeOrbitsSym()
214- new parameter symtype for SCIPcomputeComponentsSym()
215- new parameter symtype and permvardomaincenter for SCIPlexicographicReductionAddPermutation()
216- replaced parameters matrixdata and exprdata of SYMcomputeSymmetryGenerators() by graph
220- new functions for interfacing with Lapack: SCIPlapackIsAvailable(), SCIPlapackIsAvailable(), SCIPlapackComputeEigenvalues(), and SCIPlapackSolveLinearEquations
221 These functions should be used instead of SCIPisIpoptAvailableIpopt(), SCIPcallLapackDsyevIpopt(), and
222 SCIPsolveLinearEquationsIpopt() in the context of computing eigenvalues or solving linear equations.
223 If IPOPT is available, the calls will be passed on to Ipopt's interface to Lapack.
224- SCIPmultiplyBySumExprSum(), SCIPpowerExprSum()
226- SCIPgetPrimalDualIntegral() returns the primal dual integral stored in the statistics
227- new functions SCIPcreateConsIndicatorLinConsPure() and SCIPcreateConsIndicatorGenericLinConsPure() that
228 create indicator constraints from a linear constraint without a slack variable
229- SCIPgetNLPNlRowsStat() to retrieve counts on linear, convex, and nonconvex rows in NLP
230- SCIPnlhdlrSetSollinearize(), SCIPnlhdlrHasSollinearize()
231- SCIPbendersGetNLPParam()
232- new API functions SCIPlexicographicReductionGetStatistics(), SCIPlexicographicReductionPrintStatistics(),
233 SCIPlexicographicReductionPropagate(), SCIPlexicographicReductionAddPermutation(), SCIPlexicographicReductionReset(),
234 SCIPlexicographicReductionFree(), SCIPincludeLexicographicReduction(), for lexicographic reduction.
235- new API functions SCIPorbitopalReductionGetStatistics(), SCIPorbitopalReductionPrintStatistics(),
236 SCIPorbitopalReductionPropagate(), SCIPorbitopalReductionAddOrbitope(), SCIPorbitopalReductionReset(),
237 SCIPorbitopalReductionFree(), SCIPincludeOrbitopalReduction(), SCIPorbitopalReductionGetDefaultColumnOrdering(),
238 for orbitopal fixing.
239- new API functions SCIPorbitalReductionGetStatistics(), SCIPorbitalReductionPrintStatistics(),
240 SCIPorbitalReductionPropagate(), SCIPorbitalReductionAddComponent(), SCIPorbitalReductionReset(),
241 SCIPorbitalReductionFree(), SCIPincludeOrbitalReduction(), for orbital fixing.
242- new API functions SCIPgetShadowTreeEventHandlerExecutionTime(), SCIPshadowTreeGetShadowNodeFromNodeNumber(),
243 SCIPshadowTreeGetShadowNode(), SCIPgetShadowTree(), SCIPactivateShadowTree(), SCIPincludeEventHdlrShadowTree(),
244 for managing a copy of the branch-and-bound tree for symmetry handling purposes.
245- SCIPdotWriteOpening(), SCIPdotWriteNode(), SCIPdotWriteArc(), SCIPdotWriteClosing()
246- SCIPincludeCutselEnsemble(), SCIPselectCutsEnsemble() to include cutsel_ensemble or use the selection algorithm
247- SCIPincludeBranchruleGomory() includes new gomory cut based branching rule
248- SCIPgetVarAvgGMIScore(), SCIPincVarGMISumScore(), SCIPgetVarLastGMIScore(), SCIPsetVarLastGMIScore() set historical values used by SCIP's default branching rule
249- SCIPincludeNlhdlrSignomial() includes the signomial nonlinear handler
250- SCIPgetExprMonomialData() returns a monomial representation of a product expression
251- SCIPestimateRoot() computes estimators for roots with exponent in [0,1]
252- SCIPincludeCutselDynamic(), SCIPselectCutsDynamic() to include cutsel_dynamic or use the selection algorithm
253- SCIPincludeSepaLagromory() to include the new Lagromory separator
254- SCIPconsCompCheck() to compare two constraints based on their check priority
255- SCIPgetConsPermsymGraph() and SCIPgetConsSignedPermsymGraph() to access the (signed) permutation symmetry detection graph of a constraint
256- SCIPsetConshdlrGetPermsymGraph() and SCIPsetConshdlrGetSignedPermsymGraph() to set the (signed) permutation symmetry detection graph of a constraint
257- SCIPconshdlrSupportsPermsymDetection() and SCIPconshdlrSupportsSignedPermsymDetection() to access whether a conshdlr supports detection of (signed) permutation symmetries
258- new API functions for creating and manipulating a symmetry detection graph: SCIPcreateSymgraph(), SCIPfreeSymgraph(), SCIPcopySymgraph(), SCIPextendPermsymDetectionGraphLinear(),
259 SCIPaddSymgraphVarAggregation(), SCIPaddSymgraphOpnode(), SCIPaddSymgraphValnode(), SCIPaddSymgraphConsnode(), SCIPgetSymgraphVarnodeidx(), SCIPgetSymgraphNegatedVarnodeidx(),
260 SCIPupdateSymgraphLhs(), SCIPupdateSymgraphRhs(), SCIPfixSymgraphVarnode(), SCIPaddSymgraphEdge(), SCIPcomputeSymgraphColors(), SCIPgetSymgraphSymtype(), SCIPgetSymgraphVars(),
261 SCIPgetSymgraphNVars(), SCIPgetSymgraphNConsnodes(), SCIPgetSymgraphNNodes(), SCIPgetSymgraphNEdges(), SCIPgetSymgraphEdgeFirst(), SCIPgetSymgraphEdgeSecond(),
262 SCIPgetSymgraphVarnodeColor(), SCIPgetSymgraphNodeType(), SCIPgetSymgraphNodeColor(), SCIPisSymgraphEdgeColored(), SCIPgetSymgraphEdgeColor(), SCIPgetSymgraphNVarcolors(),
263 SCIPhasGraphUniqueEdgetype(), SCIPallocateSymgraphConsnodeperm(), SCIPcreateSymgraphConsnodeperm(), SCIPgetSymgraphConsnodeperm(), SCIPfreeSymgraphConsnodeperm(),
264 SCIPgetSymActiveVariables(), SCIPfreeSymDataExpr(), SCIPgetSymExprdataNConstants(), SCIPgetSymExprdataConstants(), SCIPgetCoefSymData(),
265 SCIPcreateSymOpNodeType(), SCIPgetSymOpNodeType()
266- SCIPexprhdlrSetGetSymdata(), SCIPexprhdlrHasGetSymData(), SCIPgetSymDataExpr(), SCIPcallExprGetSymData() to access symmetry data of expressions
267- SYMcheckGraphsAreIdentical() to check whether two symmetry detection graphs are identical
268- new functions SYMbuildSassyGraph(), SYMbuildSassyGraphCheck()
270- new definitions SCIP_DECL_CONSGETPERMSYMGRAPH, SCIP_DECL_EXPRGETSYMDATA
271- new member SYM_NODETYPE_CONS in SYM_NODETYPE enum
272- new members SYM_CONSOPTYPE_SUM, SYM_CONSOPTYPE_SLACK, SYM_CONSOPTYPE_COEF, SYM_CONSOPTYPE_RHS, SYM_CONSOPTYPE_LAST in SYM_CONSOPTYPE enum
273- new defintion SCIP_DECL_EXPRGETSYMDATA
274- new function SCIPdetectSingleOrDoubleLexMatrices()
276### Command line interface
278- Added optional parameter -i when calling SCIP in AMPL-mode (-AMPL parameter).
279 If -i is specified, a SCIP shell is started where normally SCIPsolve() would be called.
281### Interfaces to external software
283- added interface to nauty/traces for symmetry computation
284- added interface to sassy, a preprocessor for symmetry computation
285- The directory src/sassy contains the source code of sassy.
286- Added interface to Lapack (used for solving nonlinear problems).
287- The AMPL interface now supports parameters specified in AMPL command scripts via option scip_options.
288 The value of scip_options is expected to be a sequence of parameter names and values, separated by a space, e.g.,
289 `option scip_options 'limits/time 10 display/verblevel 1';`.
290 String values should not be quoted and spaces in string values are not supported.
291- sassy can be used now as preprocessor for nauty/traces
292- The solution status codes written to AMPL solution files now match those from https://mp.ampl.com/details.html#_CPPv4N2mp3sol6StatusE.
294### Changed parameters
296- change default value of parameter separating/filtercutpoolrel to FALSE
297- Shrunk range of parameter "propagating/symmetry/sstleaderrule" from [0,3] to [0,2], removed "MAXCONFLICTS"-option.
298- Removed reading/gmsreader/freeints. A default upper bound of +inf is now assumed for integer variables in GAMS (which is the case since GAMS 23.1).
299- Disabled "propagating/symmetry/symfixnonbinaryvars" since it is not used in the new symmetry code.
300- Replaced "propagating/symmetry/onlybinarysymmetry" with "propagating/symmetry/enforcecomputesymmetry" and set to FALSE by default.
301- Disabled "propagating/symmetry/performpresolving" since running orbital reduction during presolving is not effective.
302- Repurposed "propagating/symmetry/usedynamicprop" since it now also applies to lexicographic reduction.
303- Changed default value of parameter "propagating/symmetry/addsymresacks" from FALSE to TRUE.
307- separating/maxcutsgenfactor and separating/maxcutsrootgenfactor as factors (w.r.t. separating/maxcuts and
308 separating/maxcutsroot) for limits on the number of cuts generated (which used to be constants '2')
309- expr/pow/expandmaxexponent to specify limit on exponent when to expand power of sum
310- expr/pow/distribfracexponent to enable expanding power of products with fractional exponents
311- expr/product/expandalways to enable expanding any product with sums as factor (that is, also when more than two factors)
312- nlhdlr/convex/maxperturb to specify maximal perturbation of non-differential reference points
313- benders/default/nlpiterlimit to adjust iteration limit for NLP solver for Benders' decomposition NLP subproblems
314- limits/objectivestop to interrupt the solve as soon as a primal solution is found
315 that is at least as good as the given value
316- heuristics/undercover/{coverand,coverind,covernl} to control which nonlinearities to consider (by default only "and" and nonlinear constraints)
317- cutselection/ensemble/∗ all parameters for new ensemble cut selector
318- cutselection/dynamic/∗ all parameters for new dynamic cut selector
319- branching/relpscost/gmiavgeffweight specifies the weight in the relpscost branching score of the normalized efficacy of all generated GMI cuts (for a variable)
320 branching/relpscost/gmilasteffweight specifies the weight in the elpscost branching score of the normalized efficacy of the last generated GMI cut (for a variable)
321- nlhdlr/quadratic/usemonoidal to enable monoidal strengthening when separating quadratics with intersection cuts
322- nlhdlr/quadratic/trackmore to collect more statistics for monoidal strengthening when separating quadratics with intersection cuts
323- nlhdlr/quadratic/useminrep to use the minimal representation to compute cut coefficients when separating quadratics with intersection cuts
324- nlhdlr/quadratic/sparsifycuts to enable sparsification of intersection cuts for quadratics
325- heuristics/dps/reoptlimits to set strict limits for the reoptimization step in dps
326- heuristics/dps/timing to run dps after processing the node
327- heuristics/scheduler/∗ all parameters for new scheduler heuristic
328- nlhdlr/signomial/enabled, nlhdlr/signomial/maxnundervars, nlhdlr/signomial/mincutscale: parameters for the signomial nonlinear handler
329- separating/lagromory/freq to denote the frequency for calling Lagromory separator
330- separating/lagromory/away to denote the minimal integrality violation of a basis variable to try separation
331- separating/lagromory/dynamiccuts to denote whether the generated cuts be removed from LP if they are no longer tight
332- separating/lagromory/maxroundsroot to denote the maximal number of separation rounds in the root node
333- separating/lagromory/maxrounds to denote the maximal number of separation rounds in a non-root node
334- separating/lagromory/nmaxcutsperlproot to denote, in the root node, the maximal number of Lagromory cuts that can be
335 separated per explored basis of the Lagrangian dual
336- separating/lagromory/nmaxcutsperlp to denote, in a non-root node, the maximal number of Lagromory cuts that can be
337 separated per explored basis of the Lagrangian dual
338- separating/lagromory/perroundnmaxlpiters to denote the maximal number of separating LP iterations that are allowed per
340- separating/lagromory/dualdegeneracyratethreshold to denote the minimum dual degeneracy rate for the separator execution
341- separating/lagromory/varconsratiothreshold to denote the minimum variable-constraint ratio on the optimal face for the
343- many other advanced parameters for the Lagromory separator, which are also mentioned under separating/lagromory/∗
347- new data structure SYM_GRAPH to encode symmetry information from a constraint
348- new data structure SYM_EXPRDATA to encode symmetry information from expressions
349- replaced enum SYM_SYMTYPE by a complete new one; removed SYM_RHSSENSE, added SYM_NODETYPE and SYM_CONSOPTYPE
354- deleted the now unused files: tpi_none.h, tpi_openmp.h, tpi_tnycthrd.h, type_tpi_none.h, type_tpi_openmp.h, type_tpi_tnycthrd.h
359- new unittests for nlhdlr_quadratic that test monoidal strengthening and the use of the minimal representation to compute cut coefficients
360- unittests for nlhdlr_signomial
365- changed `set lim obj` to `set lim objective` in ctest since `obj` is no longer unambiguous
372- New flag -DLAPACK=on for linking with Lapack (must be available in the system)
373- added flag option "SYM=sbliss" for using sassy/bliss as a graph automorphism package
374- use SYM=sbliss by default, since sassy and bliss are now shipped with SCIP.
375- added flag option "SYM=snauty" for using sassy/nauty as a graph automorphism package
379- added flag option "nauty" for SYM variable to specify which graph automorphism package should be used
380- added flag option "sbliss" (sassy/bliss) for SYM variable to specify which graph automorphism package should be used
381- added flag option "snauty" (sassy/nauty) for SYM variable to specify which graph automorphism package should be used
382- use SYM=sbliss by default, since sassy and bliss are now shipped with SCIP
383- New flag LAPACK for linking with Lapack (must be available in the system)
384- A file scip/config.h is created in the build directory ($(OBJDIR)/include) now.
385 Defining NO_CONFIG_HEADER is no longer necessary and has no effect anymore.
390- Number of runs in which separation is enabled will now be correct as per "separating/maxruns" parameter. Earlier,
391 separation was enabled for "maxruns + 1" number of runs, i.e., separation was enabled even when "maxruns = 0" was set.
392- add safeguard for number of selected cuts
393- use double double precision for delta in activity updates of cons_linear.c
394- sort constraints in checkSolOrig() to keep the logic of constraint handlers intact
395- fixed make install when SHARED=no and make uninstall
396- check absolute coefficients relative to extremal average to avoid invalid unifications in normalizeCons()
397- enforce and check symmetry-based constraints to take their locks (in dual reductions) into account
398- flush changes at the end of SCIPlpiSetBase() in lpi_grb.c to apply the newly set basis correctly
403- The TPI has been changed to become mostly independent from the actual parallel interface during compile time.
404 For this, the locks and conditions are now pointers to abstract structs.
405- fixed that scip/def.h, the header for C preprocessor definition (`#define`'s), included headers for some SCIP type and function definitions
406 (scip/type_retcode.h, scip/type_message.h, scip/pub_message.h)
409@page RN8 Release notes for SCIP 8
411@section RN810 SCIP 8.1.0
412*************************
417- fixed that scaling of rows in Gurobi interface (SCIPlpiScaleRow()) changed infinite sides to large finite ones (1e20) when scale factor is negative
418- check whether objective limit is truly reached in SCIPlpiIsStable()
419- if an objective limit is set and Mosek claims that it is exceeded, check that this is indeed the case in SCIPlpiIsStable()
420- the .mps file reader was extended to additionally accept .mps files with the objective sense section on one line
421- ensure that delayed cutpool separation does not happen if enough cuts have been found already
422- fixed that a Gurobi or Mosek interface (LPI) could not be freed from a thread different than the one it was created in, which lead to problems when, e.g., using the concurrent optimizer
423- in cons_varbound if both variables are fixed, instead of propagating the constraint check the feasibility of the constraint since propagating can lead to unnecessary numerical troubles
424- fixed memory leak in branching rule "distribution"
425- fixed that undercover did not enforce that sufficiently many variables in an and-constraints were fixed to have it linearized in the generated sub-scip
426- fixed two bugs in cons_varbound: avoid adding variable bounds if vbdcoef is infinite and unlock/lock variables if lhs/rhs/vbdcoef are changed
427- globalize constraint changes before bound changes during the effective root shift in treeSwitchPath() to correctly update variable locks by avoiding global bounds with outstanding bound change events when deleting constraints
428- fixed error when attempting to copy SCIP with activated pricers
429- remove integrality check for implicit integral variables in cons_integral.c, updated the definition for variable type implicit integer to be more explicit that these variables can take fractional values, and updated FAQ entry
430- updated and, or, and pseudoboolean constraint handlers to better handle fractional implicit integer variables in enforcement
431- avoid invalid strong Chvatal-Gomory cuts by ceiling with tolerance in the calculation of parameter k and flooring slack coefficients with standard epsilon tolerance as well as quad precision
432- add missing row links to columns in SCIPflushRowExtensions() required to maintain correct row norms
433- restrict separator intobj to solutions for which there can be no better feasible integral objective values to avoid cutting them off
434- delay removal of clique lists from SCIPvarRemoveCliquesImplicsVbs() into cliqueCleanup() to avoid segmentation faults by incomplete cleanups after variable conversions
435- reject sub-solutions with invalid objectives in SCIPtranslateSubSols() due to contradicting infinite contributions
436- correct column index in getMinMaxActivityResiduals() to make presolver dualinfer work
437- copy quiet flag from main scip's message handler to the one of solverscip in concurrent optimization
438- avoid bound tightening cycles towards huge redundancy bounds in fullDualPresolve() to avert fatal numerical trouble in representing vertices of linear relaxations with unbounded domains
439- fix problem where debug solution did not work if branching constraints are present
440- update index of dominating variable on coefficient deletion in dualPresolving() of constraint handler logicor
441- pass on flags from a redundant to the implying varbound constraint in preprocessConstraintPairs() to avoid suboptimal fixings by model relaxations
442- apply reductions of dualinfer only if a dual solution exists (primal is bounded)
443- before presolving is finished check solutions before retransforming them including tiny values to keep check flags consistent
444- disable heuristics before and during presolving in benders decomposition to avoid messing up the objective structure in the solution store by dropping auxiliary variables in the required retransformations
445- correct local flag of singleton conflict constraints in tightenSingleVar() against invalid bound globalization
446- respect unboundedness in the computation of activity bounds in conflict.c to avoid invalid huge bounds due to small coefficients on unbounded variables
447- ensure positive sides of a linear constraint when recognizing a set partition in rangedRowSimplify() to account for redundancy issues
448- relax numerical conditions for variable aggregations to avert invalid variable fixings
449- fixed harmless read of uninitialized data when creating parameters
450- fix call of SCIPnlpiOraclePrintProblem in nlpi_worhp
452Performance improvements
453------------------------
455- Use sassy/bliss as default symmetry computation package.
460### Interfaces to external software
462- added interface to nauty/traces for symmetry computation
463- added interface to sassy, a preprocessor for symmetry computation
464- The directory src/sassy contains the source code of sassy.
471- added flag option "SYM=sbliss" for using sassy/bliss as a graph automorphism package
475- added flag option "nauty" for SYM variable to specify which graph automorphism package should be used
476- added flag option "sbliss" for SYM variable to specify which graph automorphism package should be used
477- use SYM=sbliss by default, since sassy and bliss are now shipped with SCIP
482- the parameter change callback is no longer called at the moment a parameter is created
484@section RN804 SCIP 8.0.4
485*************************
490- use quad precision in cutsSubstituteMIR() for substituting slack variables into CMIR cuts
491- use quad precision for activity computations in cons_linear.c
493### Deleted and changed API methods
495- SCIPshrinkDisjunctiveVarSet() no longer attempts to cutoff the current node if it finds the
496 given disjunction to be infeasible; it is now in the responsibility of the caller to act accordingly
501- added XML parser routines from src/xml/xml.h
503### Interfaces to external software
505- updated XPRESS interface to work with XPRESS 41 as well
506- new interface to LP solver HiGHS (lpi_highs.cpp)
508### Changed parameters
510- changed integer parameter "propagating/symmetry/recomputrestart" from range {0, 1, 2} to being fixed at value 0
515- added new checks for objective, bounds and sides inside the scaling tests in lpi/change.c
520- relax condition of assert in lpSolve to hold only if lp/checkstability is true
521- OPB reader: dynamically increase the size of the line buffer for reading in getMaxAndConsDim()
522- Enabled the solution limit checks in SCIPsolveIsStopped in solve.c when in SCIP_STAGE_PRESOLVING
523- fix quad precision comparison for the calculation of knapsackcover constraints.
524- force copying of symmetry constraints for concurrent solve
525- increase the precision of double multiplications in quad precision environments
526- corrected handling of different variable types in symmetry
527- orbitope detection: refine computation of overlap structure and fixed bug in finding orbitope generators
528- ensure that winner is always determined in concurrent mode
529- when a row with invalid index range is added to the global cutpool, update the indices instead of failing with an assert
530- update of watched literals in cons_xor.c and ensure that fixed variables are counted in propacateCons()
531- avoid some numerical issue in check for redundant variables in linear constraints (introduced with version 8.0.2)
532- more rows are treated as being integral in cutsSubstituteMIR() for CMIR cuts
533- fixed several relaxations of the rhs of cuts to 0 in cuts.c
534- avoid aggregation into a single linear constraint if they should not be upgraded (needed for indicator constraints)
535- apply effective root changes before fork is repropagated during treeSwitchPath() in tree.c
536- avoid invalid objective value for solutions generated from an unbounded LP relaxation in case of a nonlinear objective function
537- disable recomputing symmetries after a restart (constraint removal is not permitted)
538- avoid cutting off optimal solutions for small feasibility tolerances in conflict analysis
539- initialize variable in presol_dualsparsify.c
540- fix in presolving of variable bound constraints to use absolute instead of relative difference
541- free variable histories in reoptimization mode
542- handle whitespaces in interactive shell history consistently
543- check and enforce equalities on which the objective is projected in cons_linear.c
544- ensure row feasibilities of solution shiftings in heur_oneopt.c and heur_twoopt.c
545- remove rounded row check blocking tolerable primal solutions in cons_varbound.c
546- fixed that presolve of logicor-constraints may have attempted to cutoff a root of the not yet existing branch-and-bound tree
547- only consider positive slack variables as active in benders.c
548- in the feasibility check of and/or constraints, allow for fractional values in operands
549- fixed linear outer-approximation for some composite absolute-value expressions
554- Extended documentation of the parameter limits/solutions to point out that the limit is first checked in presolving
555- Added more information about using SCIPcache- and SCIPflushRowExtensions() to documentation and comments
556- Extended the `how to add' sections of the documentation by adding information on how to include default plugins into SCIP
558@section RN803 SCIP 8.0.3
559*************************
561Examples and applications
562-------------------------
564- Externalize STP and PolySCIP applications
569### Command line interface
571- When running the AMPL interface, the .nl filename extension does not need to be omitted for the input file anymore.
578- Forbid CMAKE_BUILD_TYPE nonstandard values
579- Move -I/path/to/src/amplmp/include to front of compiler flags for include directories
586- fixed an incorrect handling of xor constraints
587- the feasibility checker for integrality constraints now uses checkintegrality even for implied integers
588- skip integrality check in cons_integral for relaxation-only implicit-integer variables
589- fixed an issue caused by aggregated variables not added to a hashmap in the xor constraint handler
590- changed function solveRowEchelonGF2 in cons_xor.c to avoid errors if rank is 0
591- fixed that the implication presolver tried to aggregate or tighten bounds of multiaggregated variables
592- fixed a sign check in detection of linear constraints that are parallel to the objective
593- fixed bug in Clp and lpi_clp with missing basis information when calling the barrier with crossover; needs new Clp version
594- do not assume aggregation is successful in cons_setppc.c
599- Changed license to Apache 2.0, see https://www.apache.org/licenses/LICENSE-2.0.
600- When an LP could not be solved accurately, scaling is now turned off as a last fall-back method.
601- Methods for using the debug solution mechanism SCIPdebugAddSolVal, SCIPdebugGetSol, SCIPdebugGetSolVal,
602 SCIPdebugSolIsValidInSubtree, SCIPdebugIsMainscip, SCIPdebugSolEnable, SCIPdebugSolDisable, SCIPdebugSolIsEnabled,
603 SCIPwithDebugSol are now exported
605@section RN802 SCIP 8.0.2
606*************************
611### Deleted and changed API methods
613- added input parameter SCIP_Bool initiallp to SCIPcutselsSelect
614- changed function type int to SCIP_Longint for SCIPcutpoolGetMaxNCuts
615- replaced SCIPsepastoreGetNCutsFound with SCIPsepastoreGetNCutsAdded following the naming convention for the new statistics
616- replaced SCIPsepaIncNAppliedCuts with SCIPsepaIncNCutsApplied
620- added SCIPsepastoreGetNCutsAdded, SCIPsepastoreGetNCutsAddedViaPool, SCIPsepastoreGetNCutsAddedDirect
621- added SCIPsepaIncNCutsAdded, SCIPsepaDecNCutsAdded, SCIPsepaIncNCutsApplied, SCIPsepaGetNRootCalls, SCIPsepaGetNCutsAdded, SCIPsepaGetNCutsAddedViaPool, SCIPsepaGetNCutsAddedDirect, SCIPsepaGetNCutsAppliedViaPool, SCIPsepaGetNCutsAppliedDirect
622- added SCIPcutpoolGetNRootCalls, SCIPcutpoolGetNCutsAdded, SCIPcutpoolAddMaxNCuts, SCIPcutpoolSetTime, SCIPcutpoolAddNCalls, SCIPcutpoolAddNRootCalls, SCIPcutpoolAddNCutsFound, SCIPcutpoolAddNCutsAdded,
623- added SCIPcutselGetNCalls, SCIPcutselGetNRootCalls, SCIPcutselGetNRootCuts, SCIPcutselGetNRootForcedCuts, SCIPcutselGetNRootCutsFiltered, SCIPcutselGetNLocalCuts, SCIPcutselGetNLocalForcedCuts, SCIPcutselGetNLocalCutsFiltered,
625### Interfaces to external software
627- Added compatibility with Mosek 10.0.18.
631- new parameters to turn on more statistics: misc/showdivingstats (diving heuristics), heuristics/alns/shownbstats (ALNS), estimation/showstats (tree size estimation)
635- added nrootcalls and ncutsadded to SCIP_Cutpool
636- added fromcutpool flag to SCIP_Row and fixed 33 bit allocation
637- added ncalls, nrootcalls, nrootcutsselected, nrootcutsforced, nrootcutsfiltered, nlocalcutsselected, nlocalcutsforced, nlocalcutsfiltered to SCIP_Cutsel
638- added ncutsadded, ncutsaddedviapool, ncutsaddeddirect, ncutsappliedviapool, ncutsapplieddirect, nrootcalls to SCIP_Sepa
639- added ncutsadded, ncutsaddedviapool, ncutsaddeddirect to SCIP_Sepastore
640- fixed statistics of relaxators w.r.t. number of times conss/cuts were added
647- new option `-DAUTOBUILD` that configures scip with dependencies on availability.
648 Packages like Ipopt, PaPILO, Readline, Zimpl, ZLIB, GMP, Worhp are automatically found and linked, otherwise ignored.
649 The individual flags for these packages are ignored. This makes a quick build easier. It is by default set to off.
654- read objective offset from ZIMPL files
655- Make sure that objective limit is disabled if not all variables are in the LP. If we would run into
656 an objective limit in this case, the results of the LP solver are unclear.
657- fixed bug in reopt.c, which occured for bounds outside of current valid bounds
658- fixed problem with recomputing symmetries after a restart
659- fixed bug in SCIPcalcMIR() with wrong order of arguments for removeZerosQuad()
660- fixed segmentation fault in update of cut statistic
661- fixed bug in presolving of and constraints by merging variables with multiple occurrences before cliquePresolve()
662- fixed bug in dual presolving of linear constraints by setting implicit integers to integers in multi-aggregation
663- fixed update of presolve statistics on added constraints and changed coefficients in constraint handler for nonlinear constraints
664- fixed bug with reading CIP files with large constraints split over several lines
665- fixed bug with infinite bounds in the computation of conflict cuts
666- fixed check for unbounded solution constructed by SCIPlpGetUnboundedSol(): The constructed solution is very likely infeasible
667 since scaling increases small numerical feasibility violations. Therefore, the solution is now always accepted. However, the
668 feasibility of the ray is now checked. This fix now might lead to several rounds of separation in order to resolve unbounded solutions,
669 whereas previously SCIP started to branch immediately.
670- changed to absolute tolerances in all redundancy checks for linear constraints
675- Added extended cutselector statistics splitting between root node specific and general statistics
676- Added extended and refined cutpool statistics showing the number of cuts added from the cutpool to the sepastore
677- Added extended and refined separator statistics to get a better view of the individual generators performance
678- turned off output of statistics for the following information by default:
679 diving heuristics, ALNS neighborhood information and tree size estimation statistics;
680 they can be turned on using the following new parameters:
681 misc/showdivingstats (diving heuristics), heuristics/alns/shownbstats (ALNS), estimation/showstats (tree size estimation)
683@section RN801 SCIP 8.0.1
684*************************
689- clique lifting in cons_setppc (parameter enablecliquelifting) is only disabled if it has been applied
690- avoid warning if Mosek has reached/exceeded the objective limit
691- improved curvature check for quadratic expressions when extended formulations are disabled
693Examples and applications
694-------------------------
696- Fixed handling of enforcing in the TSP example.
701### Interfaces to external software
703- Added compatibility with Mosek 10.0.13.
708- BLISS is now built from the vendored version from https://github.com/ds4dm/Bliss
712- avoid warnings about unrecognized compiler warning silencing options when compilation with GCC fails
713- adjust mosek find module to version 9.3
714- added cmake compatibility for ipopt versions 3.14.x
718- avoid warnings about unrecognized compiler warning silencing options when compilation with GCC fails
719- fixed that compilation with MS/Intel compilers on Windows and Cray compilers was broken when enabling PAPILO
724- fixed uninitialized array in detection of suborbitopes
725- Fixed problem with reading long lines in LP/FZN/OPB/Diff-files. The buffer is now reallocated,
726 which also should be much faster.
727- fixed that recursive products in expressions were sometimes not flattened
728- fixed that expressions in original variables could not be simplified
729- fixed handling of objective limit with Mosek
730- made SCIPlpiGetSolverName()/SCIPlpiGetSolverDesc() thread-safe for LP Solvers (Cplex,Gurobi,Glop,Mosek,SoPlex,Xpress)
731- made SYMsymmetryGetName() thread-safe for Bliss
732- fixed memory allocation issue in detection of SOC nlhdlr
733- fixed that reaching the walltime limit in Ipopt was not handled properly
734- Deactivated dual fixing of unlocked variables with zero objective in presol_milp that SCIP is unable to postsolve.
735- set the column flag kImplInt for implicit integers in the papilo problem
736- fixed bug in propagation of indicator constraints (one case always reported a change through propagation)
738@section RN800 SCIP 8.0.0
739*************************
744- Variables that were marked as relaxation-only and that were not used in any solution (SCIP_SOL)
745 are now deleted when during a restart.
746- New symmetry handling method, symmetry handling inequalities based on the Schreier Sims table,
747 which is able to handle symmetries of arbitrary kinds of variables.
748- Revise way in which external memory (e.g., of LP-solver) is estimated.
749- The symmetry code can now heuristically search for orbitopes that do not completely handle
750 a symmetry component and add certain Schreier Sims cuts to such components.
751- The LPIs for Gurobi and Mosek are thread-safe now.
752- The complete code is now thread-safe by default.
753- New separator to generate mixing cuts (works well for stochastic programming with probabilistic constraint).
754- New parsing routines for cons_orbisack and cons_symresack.
755- Variables can now be marked to forbid aggregation.
756- Heuristic PADM can now reoptimize found solution with original objective function.
757- Added code to support debugging of catching or releasing of variables to var.c (prints backtrace
758 when catching and releasing).
759- SCIPintervalSin() and SCIPintervalCos() are now rounding-safe.
760- Removed special handling of second-order cones in undercover heuristic for now.
761- Removed use of Hessian sparsity pattern for nonquadratic nonlinear constraints in undercover heuristic.
762- Added reader for AMPL .nl files.
763- New separator sepa_rlt to compute cuts via the reformulation-linearization technique (RLT).
764- New separator sepa_minor to compute cuts from 2x2 minors of a violated semidefiniteness constraint that is
765 implied by the extended formulation for bilinear products.
766- New separator sepa_interminor to compute intersection cuts from 2x2 (not only principle) minors of a violated
767 rank-one constraint that is implied by the extended formulation for bilinear products.
768- Symmetry handling has been extended to detect also symmetries between variables that also appear in nonlinear constraints.
769- Improved OBBT propagator by only considering variables that are contained in at least one nonconvex expression that has an auxiliary variable.
770- Default parameter settings for NLP solves are now defined independently of the NLP solver.
771- Added table to print statistics on NLP solvers.
772- Knapsack, linear, logicor, setppc, and varbound constraints now add themselves to the NLP relaxation, if enabled.
773 And, linking constraints and bounddisjunctions in one variable are added to the NLP relaxation now.
774- Ipopt interface now supports warmstarts from a full primal/dual solution pair.
775- Extended data structure SCIP_ROWPREP and routines to assemble a linear inequality before it is turned into a SCIP row and
776 made it available via the API.
777- MIR procedure is now available for strengthening the Benders' optimality cut
778- SCIPbranchcandCalcLPCands() now also returns fractional variables in unbounded solutions.
779- New emphasis "benchmark" to avoid different solving paths that may come from checking remaining memory.
780- New plugin type for cut selection: users can now include their own cut selection rules, default rule moved to cutsel_hybrid.
781- New construction heuristic DPS which additionally needs a user-provided decomposition and splits the problem into several sub-SCIPs
782 according to this decomposition. The sub-SCIPs are solved and updated repeatedly until a feasible solution of the original problem is found.
785- Removed support for expression types min and max for now. Removed support for expression type sign.
786 Removed complex expression types sum, product, linear, quadratic, polynomial.
787 Removed support for parameterized expressions.
788- Added support for expression types sin, cos, and entropy. Added an expression type that stores a SCIP variable.
789- Added handling of sin and cos expressions in OSiL reader.
790- Added handling of sin, cos, and tan expressions in ZIMPL reader.
791- Added expression handler plugin type, removed user expression type.
792- Replaced expressions, expression trees, and expression graphs by a new implementation of expressions.
793- Added differentiation methods (Gradients and Hessian directions) to expressions.
794- Added integrality information to expressions.
795- Added comparison and hashing of expressions.
796- Improved simplification of expressions and identification of common subexpressions, in particular terms that appear
797 equally in several quadratic functions are now identified.
798- Expression simplification now expands powers also when the resulting exponents will be larger than 2.
799- Added table to print statistics on expression handlers.
800- Removed interval-arithmetic evaluation from expression interpreter (interfaces to automatic differentiation codes).
801- Hessians for user-provided expression handlers are not available in the NLP solver interfaces for now.
802- Sparse Hessians are now returned by expression interpreter. Removed dense Hessians.
804Constraint handlers for NLP:
805- cons_nonlinear has been completely rewritten and now handles constraints of the form lhs <= expr <= rhs, where
806 expr is an expression using the new expression type. A linear part of a nonlinear constraint is no longer distinguished.
807- Methods that work on a particular nonlinear structure are now implemented via nonlinear handlers (nlhdlr).
808 These handlers are plugins of cons_nonlinear and interact with cons_nonlinear by detecting structures in expressions and
809 providing propagation and separation mechanisms.
810- Added nlhdlr "default" as a mandatory nlhdlr: this is a nlhdlr that gets active on expressions that no other nlhdlr handles.
811 It then uses the callbacks implemented in expression handlers to provide domain propagation and linear under/overestimates.
812- Added nlhdlr for quadratic expressions: domain propagation that was previously part of cons_quadratic; separation via intersection cuts (currently disabled).
813- Added nlhdlr for bilinear expressions: collects bilinear products and provides under/overestimation of a product over a 2D-projection of the LP.
814- Added nlhdlr for convex and concave expressions: detection of convex/concave subexpressions and linear under/overestimation.
815- Added nlhdlr for quotients: detects quotients, provides specialized linear under/overestimation and domain propagation for univariate quotients.
816- Added nlhdlr for perspective reformulations: detects expressions in semi-continuous variables and tightens linear
817 under/overestimates of these expressions by applying a perspective transformation.
818- Added nlhdlr for second-order cones: detects second-order cone constraints (as ||x|| <= t or a quadratic that can written like that) and
819 separates on a disaggregated reformulation (similar to cons_soc previously).
820- Removed constraint handlers abspower, bivariate, quadratic, and soc.
821- Removed simplification of duplicate abspower constraints for now.
822 Removed simplification of abspower constraints with loose variables.
823 Removed resolving of domain propagation (ConsResProp callback) and conflict analysis for abspower constraints.
824 Removed propagation of varbounds for variables of abspower constraints.
825 Removed reformulation of abs(x)^p * x into signpower expression for now.
826- Removed reformulation of SOC constraints when adding to the NLP.
827 Removed possibility to add linearizations a la Glineur or BenTal&Nemirovski for SOC constraints.
828- Removed possibility to disaggregate quadratic constraints.
829 Removed lifted tangent inequalities for bilinear terms in quadratic constraints.
830 Removed option to project LP solution onto feasible region of a quadratic constraint via interior point or gauge function.
831 Removed handling of unbounded LPs when enforcing quadratic constraints.
832- Removed construction of cuts from interval gradients for nonlinear constraints.
833 Removed possibility to pretend that all nonlinear constraints are convex.
834 Removed possibility to create local or non-initial nonlinear constraints for now.
835- Removed explicit reformulation of nonlinear constraints in presolve.
836 An extended formulation is now generated implicitly and used to construct the LP relaxation,
837 but the original formulation is used to check feasibility, propagate variable domains, etc.
838 Variables that are added for the extended formulation are now marked as relaxation-only.
839- Improved locking of nonlinear variables in nonlinear constraints by taking monotonicity into account.
840- Improved mechanisms to detect and handle structures in nonlinear constraints, which allows for several algorithms
841 to work simultaneously on equal or overlapping expressions.
842- Improved linearization of (sums of) products of binary variables, e.g., clique information is now taken into account.
843 Removed option to linearize products between a binary and a non-binary variable.
844- Nonlinear constraints with the same function (but possibly different left- or right-hand-side) are now merged.
845- When a variable appears in only one concave less-or-equal constraint, it will be fixed to one of its bounds in more cases now.
846- New branching rule for variables in nonlinear constraints (implemented in cons_nonlinear) that scores candidates
847 based on constraint violation, variable type, and pseudo-costs simultaneously.
848- Added tables to print statistics of nonlinear constraint handler and nonlinear handlers.
850Performance improvements
851------------------------
853- Use the objective cutoff row as base row for separation in sepa_aggregation.c.
854- Separate lifted cover cuts based on newer lifting function of Letchford and Souli (2019) in sepa_aggregation.c.
855- In-tree restarts due to tree size estimation have been made compatible with orbital fixing.
856- Improved upgrade of orbisacks to packing/partitioning orbitopes.
857- Improved running time of symresack cover separation.
858- Improved propagation algorithm for orbisack and symresack.
859- Improved handling for expressions of type signpower in CppAD interface by making use of CppADs conditional expressions.
860- Faster reevaluation of Hessian for quadratic expressions in CppAD interface.
861- Enabled optimization of taped expressions in the CppAD interface.
862- Sparse Hessian evaluation for expressions with sparse Hessian in the CppAD interface.
863- Disabled branching on variables that are added for the extended formulation of a nonlinear constraint.
864- Prefer branching on variables in nonconvex terms of nonlinear constraints also if a cut could be generated but would yield a small reduction in the convexification gap only.
865- When violations of nonlinear constraints are tiny, the feasibility tolerance for the LP relaxation may now be reduced temporarily to allow for cuts to have an effect.
866- Improved under/overestimation of multidimensional vertex-polyhedral (e.g., multilinear or concave) functions by use of scaling and keeping the cut-generating LP around.
867- Products in nonlinear constraints are no longer disaggregated for the extended formulation.
868- No longer relax bounds of integral variables when computing bounds on activity in nonlinear constraints.
869- Revised and improved Ipopt interface.
870- Revised and improved subNLP primal heuristic, in particular choice of iteration limit and starting condition and reuse of subSCIP.
871- Merge strongcg into the gomory separator to avoid computing the same base equality twice. The files
872 sepa_strongcg.{h|c} have been removed.
873- The RENS neighborhood in ALNS now fixes fractional variables if necessary for reaching its target fixing rate.
874- Use cpsolver emphasis in sepa_rapidlearning.
875- If decomposition/maxgraphedge = 0, the computation of the block graph is completely turned off.
876- Fixed a performance bug in cons_integral.c where rounding information was passed incorrectly to the generic diving algorithm.
878Examples and applications
879-------------------------
881- Add c++ Sudoku example
882- Removed circle.c and renamed string.c to spring.c in CallableLibrary example.
883- SCIP-Jack (Steiner tree application):
884 Most files have been modified and many new ones have been added (code base more than doubled).
885 Two new problem classes are supported: maximum-weight connected subgraph problem with budget constraints, partial-terminal node-weighted Steiner tree problem.
886 Major performance improvements accross all problem classes that are supported.
891### New and changed callbacks
893- extend SEPAEXEC{LP,SOL} callbacks by parameter "depth", which should be used within separation instead of SCIPgetCurrentDepth()
894- extend SCIPseparateSolCutpool() by parameter "pretendroot", which is passed to SCIPcutpoolSeparate() instead of SCIPtreeGetCurrentDepth(scip->tree) == 0
895- removed SCIP_DECL_EXPRGRAPHVARADDED, SCIP_DECL_EXPRGRAPHVARREMOVE, SCIP_DECL_EXPRGRAPHVARCHGIDX
896- removed SCIP_DECL_USEREXPRESTIMATE, SCIP_DECL_USEREXPREVAL, SCIP_DECL_USEREXPRINTEVAL, SCIP_DECL_USEREXPRCURV, SCIP_DECL_USEREXPRPROP, SCIP_DECL_USEREXPRCOPYDATA, SCIP_DECL_USEREXPRFREEDATA, SCIP_DECL_USEREXPRPRINT
897- added SCIP_DECL_EXPR_OWNERFREE, SCIP_DECL_EXPR_OWNERPRINT, SCIP_DECL_EXPR_OWNEREVALACTIVITY, SCIP_DECL_EXPR_OWNERCREATE
898- added SCIP_DECL_EXPR_INTEVALVAR, SCIP_DECL_EXPR_MAPEXPR
899- added SCIP_DECL_EXPRCOPYHDLR, SCIP_DECL_EXPRFREEHDLR, SCIP_DECL_EXPRCOPYDATA, SCIP_DECL_EXPRFREEDATA, SCIP_DECL_EXPRPRINT, SCIP_DECL_EXPRPARSE, SCIP_DECL_EXPRCURVATURE, SCIP_DECL_EXPRMONOTONICITY, SCIP_DECL_EXPRINTEGRALITY, SCIP_DECL_EXPRHASH, SCIP_DECL_EXPRCOMPARE, SCIP_DECL_EXPREVAL, SCIP_DECL_EXPRBWDIFF, SCIP_DECL_EXPRFWDIFF, SCIP_DECL_EXPRBWFWDIFF, SCIP_DECL_EXPRINTEVAL, SCIP_DECL_EXPRESTIMATE, SCIP_DECL_EXPRINITESTIMATES, SCIP_DECL_EXPRSIMPLIFY, SCIP_DECL_EXPRREVERSEPROP
900- removed SCIP_DECL_QUADCONSUPGD
901- added SCIP_DECL_VERTEXPOLYFUN
902- added argument nvarexprs to SCIP_DECL_NONLINCONSUPGD to inform upgrade method about number of variables in constraint
903- removed SCIP_DECL_EXPRGRAPHNODEREFORM
904- added SCIP_DECL_NLHDLRCOPYHDLR, SCIP_DECL_NLHDLRFREEHDLRDATA, SCIP_DECL_NLHDLRFREEEXPRDATA, SCIP_DECL_NLHDLRINIT, SCIP_DECL_NLHDLREXIT, SCIP_DECL_NLHDLRDETECT, SCIP_DECL_NLHDLREVALAUX, SCIP_DECL_NLHDLRINTEVAL, SCIP_DECL_NLHDLRREVERSEPROP, SCIP_DECL_NLHDLRINITSEPA, SCIP_DECL_NLHDLREXITSEPA, SCIP_DECL_NLHDLRENFO, SCIP_DECL_NLHDLRESTIMATE
905- replaced BMS_BLKMEM* blkmem argument of SCIP_DECL_NLPICOPY by SCIP* scip, removed targetnlpi argument
906- added SCIP* scip and SCIP_NLPIDATA** nlpidata arguments to SCIP_DECL_NLPIFREE
907- added SCIP* scip to SCIP_DECL_NLPIGETSOLVERPOINTER, SCIP_DECL_NLPICREATEPROBLEM, SCIP_DECL_NLPIFREEPROBLEM, SCIP_DECL_NLPIGETPROBLEMPOINTER, SCIP_DECL_NLPIADDVARS, SCIP_DECL_NLPIADDCONSTRAINTS, SCIP_DECL_NLPISETOBJECTIVE, SCIP_DECL_NLPICHGVARBOUNDS, SCIP_DECL_NLPICHGCONSSIDES, SCIP_DECL_NLPIDELVARSET, SCIP_DECL_NLPIDELCONSSET, SCIP_DECL_NLPICHGLINEARCOEFS, SCIP_DECL_NLPICHGOBJCONSTANT, SCIP_DECL_NLPISETINITIALGUESS, SCIP_DECL_NLPISOLVE, SCIP_DECL_NLPIGETSOLSTAT, SCIP_DECL_NLPIGETTERMSTAT, SCIP_DECL_NLPIGETSOLUTION, SCIP_DECL_NLPIGETSTATISTICS
908- replaced SCIP_DECL_NLPICHGEXPRTREE by SCIP_DECL_NLPICHGEXPR
909- removed nquadelems, quadelems, exprvaridxs arguments from SCIP_DECL_NLPIADDCONSTRAINTS, changed exprtrees argument to exprs
910- removed nquadelems, quadelems, exprvaridxs arguments from SCIP_DECL_NLPISETOBJECTIVE, changed exprtree argument to expr
911- removed SCIP_DECL_NLPICHGQUADCOEFS, SCIP_DECL_NLPICHGNONLINCOEF, SCIP_DECL_NLPISETMESSAGEHDLR
912- added SCIP_NLPIPROBLEM* problem to SCIP_DECL_NLPIGETSOLVERPOINTER
914### Deleted and changed API methods
916- When calling SCIPdelVar() in the SCIP_STAGE_PROBLEM stage, it is now documented as the user's responsibility to ensure
917 the variable is not present in any constraints. Otherwise, SCIPsolve() now returns SCIP_INVALIDDATA.
918- removed SCIPselectCuts(), replaced by SCIPselectCutsHybrid() of the hybrid cut selector plugin
919- If SCIPvarMarkRelaxationOnly() is called for a variable, then this now need to happen before the
920 variable is added to the transformed problem (SCIPaddVar()).
921 SCIPvarMarkRelaxationOnly() will automatically call SCIPvarMarkDeletable().
922- SCIPcomputeOrbitsFilterSym() and SCIPcomputeComponentsSym(): Type of argument componentblocked
923 changed from SCIP_Shortbool* to unsigned*.
924- removed SCIPsetParam()
925- SCIPcreateConsOrbitope() and SCIPcreateConsBasicOrbitope() have two new arguments "usedynamicprop"
926 and "mayinteract" to encode whether a dynamic reordering of the orbitope rows shall be used in
927 full orbitope propagation and whether the orbitope might interact with other symmetry handling
928 methods, respectively.
929- internal function SCIPgetPropertiesPerm() has been replaced by SCIPisInvolutionPerm()
930- internal function SCIPgenerateOrbitopeVarsMatrix() has new arguments "storelexorder", "lexorder",
931 "nvarsorder", "maxnvarsorder" to compute and store the lexicographic order defined by an orbitope
932- renamed SCIPcomputeArraysIntersection() and SCIPcomputeArraysSetminus() to
933 SCIPcomputeArraysIntersectionInt() and SCIPcomputeArraysSetminusInt(), respectively, and changed
934 their return type from SCIP_RETCODE (which _always_ was SCIP_OKAY) to void
935- removed SCIPincludeDialogDefault(), use SCIPincludeDialogDefaultBasic() instead and check whether you also need SCIPincludeDialogDefaultSet() and SCIPincludeDialogDefaultFix()
936- removed exprint argument from SCIPaddNlRowGradientBenderscutOpt()
937- added copyexprhdlrs argument to SCIPcopyPlugins() (19th position)
938- added copycutselectors argument to SCIPcopyPlugins() (10th position)
939- removed refpoint argument from SCIPaddSquareSecant()
940- added argument exprdata to SYMcomputeSymmetryGenerators()
941- removed SCIPconsNonlinearGetRhs(), SCIPconsNonlinearGetLhs(), SCIPconsNonlinearAddLinearCoef()
942- removed arguments timelimit, minimprove, itercontingent, and iterused from SCIPapplyHeurSubNlp()
943- removed SCIPresolveSolHeurSubNlp(), SCIPgetSubScipHeurSubNlp(), SCIPgetVarMappingScip2SubScipHeurSubNlp(), SCIPgetVarMappingSubScip2ScipHeurSubNlp()
944- SCIPlockVarCons() and SCIPunlockVarCons() are now allowed in stage TRANSFORMED as well
945- Added functions SCIPsetSepaIsParentsepa(), SCIPsetSepaParentsepa() [in scip_sepa.h], SCIPsepaSetIsParentsepa(), SCIPsepaSetParentsepa() [in sepa.h],
946 SCIPsepaIsParentsepa(), SCIPsepaGetParentsepa() [in pub_sepa.h]
947- Added function SCIPpruneTree() to immediately delete nodes that were marked to be deleted with SCIPcutoffNode
950- SCIPhasNLPContinuousNonlinearity() now returns SCIP_RETCODE and has additional argument result
951- removed SCIPnlrowGetNQuadVars(), SCIPnlrowGetQuadVars(), SCIPnlrowSearchQuadVar(), SCIPnlrowGetNQuadElems(), SCIPnlrowGetQuadElems(), SCIPnlrowGetQuadData()
952- renamed SCIPnlrowGetExprtree() to SCIPnlrowGetExpr() and changed return type to SCIP_EXPR*
953- removed arguments nquadvars, quadvars, nquadelems, quadelems from SCIPcreateNlRow(); argument expr(ession) is now of type SCIP_EXPR*
954- removed SCIPaddQuadVarToNlRow(), SCIPaddQuadVarsToNlRow(), SCIPaddQuadElementToNlRow(), SCIPaddQuadElementsToNlRow(), SCIPchgNlRowQuadElement(), SCIPsetNlRowExprtreeParam(), SCIPsetNlRowExprtreeParams()
955- renamed SCIPsetNlRowExprtree() to SCIPsetNlRowExpr() and changed type of expr(tree) argument to SCIP_EXPR*
956- SCIPenableNLP() is no longer allowed in stages INITSOLVE and SOLVING
957- removed SCIPaddLinearConsToNlpHeurSubNlp()
958- SCIPhasNLPSolution() now returns true also if a infeasible solution to the NLP exists; SCIPcreateNLPSol() can now also be used when only an infeasible solution to the NLP exists
959- renamed SCIPsolveNLP() to SCIPsolveNLPParam() and added parameter SCIP_NLPPARAM param
960- removed SCIPsolveDiveNLP(), use SCIPsolveNLPParam() instead
963- removed SCIPnlpiCopy(), SCIPnlpiFree(), SCIPnlpiChgQuadCoefs(), SCIPnlpiChgNonlinCoef(), SCIPnlpiSetMessageHdlr()
964- removed SCIPnlpiCreate() from public API, use SCIPincludeNlpi() instead
965- removed SCIPnlpiGetSolverPointer() from public API, use SCIPgetNlpiSolverPointer() instead
966- removed SCIPnlpiCreateProblem() from public API, use SCIPcreateNlpiProblem() instead
967- removed SCIPnlpiFreeProblem() from public API, use SCIPfreeNlpiProblem() instead
968- removed SCIPnlpiGetProblemPointer() from public API, use SCIPgetNlpiProblemPointer() instead
969- removed SCIPnlpiAddVars() from public API, use SCIPaddNlpiVars() instead
970- removed SCIPnlpiAddConstraints() from public API, use SCIPaddNlpiConstraints() instead
971- removed SCIPnlpiSetObjective() from public API, use SCIPsetNlpiObjective() instead
972- removed SCIPnlpiChgVarBounds() from public API, use SCIPchgNlpiVarBounds() instead
973- removed SCIPnlpiChgConsSides() from public API, use SCIPchgNlpiConsSides() instead
974- removed SCIPnlpiDelVarSet() from public API, use SCIPdelNlpiVarSet() instead
975- removed SCIPnlpiDelConsSet() from public API, use SCIPdelNlpiConsSet() instead
976- removed SCIPnlpiChgLinearCoefs() from public API, use SCIPchgNlpiLinearCoefs() instead
977- removed SCIPnlpiChgExprtree() from public API, use SCIPchgNlpiExpr() instead
978- removed SCIPnlpiChgObjConstant() from public API, use SCIPchgNlpiObjConstant() instead
979- removed SCIPnlpiSetInitialGuess() from public API, use SCIPsetNlpiInitialGuess() instead
980- removed SCIPnlpiSolve() from public API, use SCIPsolveNlpiParam() instead
981- removed SCIPnlpiGetSolstat() from public API, use SCIPgetNlpiSolstat() instead
982- removed SCIPnlpiGetTermstat() from public API, use SCIPgetNlpiTermstat() instead
983- removed SCIPnlpiGetSolution() from public API, use SCIPgetNlpiSolution() instead
984- removed SCIPnlpiGetStatistics() from public API, use SCIPgetNlpiStatistics() instead
985- removed SCIPnlpiGetWarmstartSize()
986- removed SCIPnlpiGetWarmstartMemo()
987- removed SCIPnlpiSetWarmstartMemo()
988- removed SCIPnlpiGetIntPar()
989- removed SCIPnlpiSetIntPar()
990- removed SCIPnlpiGetRealPar()
991- removed SCIPnlpiSetRealPar()
992- removed SCIPnlpiGetStringPar(),
993- removed SCIPnlpiSetStringPar()
994- removed SCIPnlpiSetPriority() from public API, use SCIPsetNlpiPriority() instead
995- removed argument nlpi from SCIPincludeNlpi() and added name, description, priority,
996 nlpicopy, nlpifree, nlpigetsolverpointer, nlpicreateproblem, nlpifreeproblem, nlpigetproblempointer, nlpiaddvars, nlpiaddconstraints, nlpisetobjective, nlpichgvarbounds, nlpichgconssides, nlpidelvarset, nlpidelconsset, nlpichglinearcoefs, nlpichgexpr, nlpichgobjconstant, nlpisetinitialguess, nlpisolve, nlpigetsolstat, nlpigettermstat, nlpigetsolution, nlpigetstatistics, nlpidata
997- removed SCIPcreateNlpSolverAll(), use SCIPincludeNlpSolverAll() instead
998- removed SCIPcreateNlpSolverFilterSQP(), use SCIPincludeNlpSolverFilterSQP() instead
999- removed SCIPcreateNlpSolverIpopt(), use SCIPincludeNlpSolverIpopt() instead
1000- removed SCIPcreateNlpSolverWorhp(), use SCIPincludeNlpSolverWorhp() instead
1001- replaced argument BMS_BLKMEM* blkmem of SCIPnlpiOracleCreate() by SCIP* scip
1002- added argument SCIP* scip to SCIPnlpiOracleFree(), SCIPnlpiOracleSetProblemName(), SCIPnlpiOracleAddVars(), SCIPnlpiOracleAddConstraints(), SCIPnlpiOracleSetObjective(), SCIPnlpiOracleChgVarBounds(), SCIPnlpiOracleChgConsSides(), SCIPnlpiOracleDelVarSet(), SCIPnlpiOracleDelConsSet(), SCIPnlpiOracleChgLinearCoefs(), SCIPnlpiOracleChgObjConstant(), SCIPnlpiOracleGetEvalCapability(), SCIPnlpiOracleEvalObjectiveValue(), SCIPnlpiOracleEvalConstraintValue(), SCIPnlpiOracleEvalConstraintValues(), SCIPnlpiOracleEvalObjectiveGradient(), SCIPnlpiOracleEvalConstraintGradient(), SCIPnlpiOracleGetJacobianSparsity(), SCIPnlpiOracleEvalJacobian(), SCIPnlpiOracleGetHessianLagSparsity(), SCIPnlpiOracleEvalHessianLag(), SCIPnlpiOraclePrintProblem(), SCIPnlpiOraclePrintProblemGams()
1003- removed arguments nquadelems, quadelems, exprvaridxs, exprtrees from SCIPnlpiOracleAddConstraints(), added argument SCIP_EXPR** exprs
1004- removed arguments nquadelems, quadelems, exprvaridxs, exprtree from SCIPnlpiOracleSetObjective(), added argument SCIP_EXPR* expr
1005- replaced arguments isnewx of SCIPnlpiOracleEvalHessianLag() by two arguments isnewx_obj and isnewx_cons
1006- removed SCIPnlpiOracleChgExprtree(), use SCIPnlpiOracleChgExpr() instead
1007- removed SCIPnlpiOracleSetInfinity(), SCIPnlpiOracleGetInfinity(), SCIPnlpiOracleChgQuadCoefs(), SCIPnlpiOracleChgExprParam(), SCIPnlpiOracleGetMaxDegree()
1008- removed SCIPnlpiOracleGetVarDegree() and SCIPnlpiOracleGetVarDegrees(), use SCIPnlpiOracleIsVarNonlinear() and SCIPnlpiOracleGetVarCounts(), respectively, instead
1009- removed SCIPnlpiOracleGetConstraintDegree(), use SCIPnlpiOracleIsConstraintNonlinear() instead
1010- removed argument messagehdlr from SCIPnlpiOraclePrintProblem() and SCIPnlpiOraclePrintProblemGams()
1011- removed SCIPcreateNlpiProb(), use SCIPcreateNlpiProblemFromNlRows() instead
1012- renamed SCIPupdateNlpiProb() to SCIPupdateNlpiProblem() and moved into scip_nlpi.{h,c}
1013- renamed SCIPaddNlpiProbRows() to SCIPaddNlpiProblemRows() and moved into scip_nlpi.{h,c}
1014- removed SCIPsetModifiedDefaultSettingsIpopt()
1015- removed SCIPgetIpoptApplicationPointerIpopt(), use SCIPgetNlpiSolverPointer() instead
1016- removed SCIPnlpStatisticsCreate(), SCIPnlpStatisticsFree(), SCIPnlpStatisticsGetNIterations(), SCIPnlpStatisticsGetTotalTime(), SCIPnlpStatisticsSetNIterations(), SCIPnlpStatisticsSetTotalTime(), the struct is public now
1017- renamed LapackDsyev() to SCIPcallLapackDsyevIpopt()
1018- renamed SCIPsolveLinearProb() to SCIPsolveLinearEquationsIpopt()
1020Expression interpreter:
1021- removed functions that operated with SCIPInterval
1022- changed first argument of SCIPexprintCreate() to SCIP*
1023- added SCIP* as first argument to SCIPexprintFree()
1024- added SCIP* as first argument to SCIPexprintCompile(), changed third argument to SCIP_EXPR*, added fourth argument SCIP_EXPRINTDATA**
1025- added arguments SCIP*, SCIP_EXPRINT*, and SCIP_EXPR* as first arguments to SCIPexprintFreeData()
1026- renamed SCIPexprintGetExprtreeCapability() to SCIPexprintGetExprCapability();
1027 added SCIP* as first argument, changed third argument to SCIP_EXPR*, added fourth argument SCIP_EXPRINTDATA*
1028- removed SCIPexprintNewParametrization()
1029- SCIPexprintEval(): added SCIP* as first argument, changed third argument to SCIP_EXPR*, added fourth argument SCIP_EXPRINTDATA*
1030- removed SCIPexprintEvalInt()
1031- SCIPexprintGrad(): added SCIP* as first argument, changed third argument to SCIP_EXPR*, added fourth argument SCIP_EXPRINTDATA*
1032- removed SCIPexprintGradInt()
1033- removed SCIPexprintHessianSparsityDense() and SCIPexprintHessianDense, use SCIPexprintHessianSparsity() and SCIPexprintHessian() instead
1036- removed SCIPexpropGetName(), use SCIPexprhdlrGetName() instead
1037- removed SCIPexpropGetNChildren()
1038- removed SCIPexprGetOperator(), use SCIPexprGetHdlr() instead
1039- removed SCIPexprGetOpIndex(), SCIPexprGetOpReal(), SCIPexprGetOpData(), use SCIPexprGetData() instead
1040- removed SCIPexprGetRealPowerExponent(), SCIPexprGetIntPowerExponent(), SCIPexprGetSignPowerExponent(), use SCIPgetExponentExprPow() instead
1041- removed SCIPexprGetLinearCoefs(), SCIPexprGetLinearConstant(), use SCIPgetCoefsExprSum() and SCIPgetConstantExprSum() instead
1042- removed SCIPexprGetQuadElements(), SCIPexprGetQuadConstant(), SCIPexprGetQuadLinearCoefs(), SCIPexprGetNQuadElements(), use SCIPexprGetQuadraticData(), SCIPexprGetQuadraticQuadTerm(), SCIPexprGetQuadraticBilinTerm() instead
1043- removed SCIPexprGetMonomials(), SCIPexprGetNMonomials, SCIPexprGetPolynomialConstant(), SCIPexprGetMonomialCoef(), SCIPexprGetMonomialNFactors(), SCIPexprGetMonomialChildIndices(), SCIPexprGetMonomialExponents()
1044- removed SCIPexprGetUserData(), SCIPexprHasUserEstimator(), SCIPexprGetUserEvalCapability()
1045- removed SCIPexprCreate(), use SCIPcreateExpr() instead
1046- removed SCIPexprCopyDeep(), use SCIPduplicateExpr() instead
1047- removed SCIPexprFreeDeep(), use SCIPreleaseExpr() instead
1048- removed SCIPexprFreeShallow()
1049- removed SCIPexprAdd(), SCIPexprMulConstant()
1050- removed SCIPexprCreateLinear(), use SCIPcreateExprSum() instead
1051- replaced SCIPexprAddToLinear() by SCIPappendExprSumExpr()
1052- replaced SCIPexprCreateQuadratic() by SCIPcreateExprQuadratic()
1053- removed SCIPexprSortQuadElems()
1054- removed SCIPexprCreatePolynomial(), SCIPexprAddMonomials(), SCIPexprChgPolynomialConstant(), SCIPexprMultiplyPolynomialByConstant(), SCIPexprMultiplyPolynomialByMonomial(), SCIPexprMultiplyPolynomialByPolynomial(), SCIPexprPolynomialPower()
1055- removed SCIPexprMergeMonomials(), SCIPexprFreeMonomial(), SCIPexprSortMonomialFactors(), SCIPexprFindMonomialFactor(), SCIPexprAreMonomialsEqual(), SCIPexprAddMonomialFactors(), SCIPexprChgMonomialCoef(), SCIPexprMultiplyMonomialByMonomial(), SCIPexprMonomialPower(), SCIPexprMergeMonomialFactors(), SCIPexprSortMonomials()
1056- replaced SCIPexprCreateMonomial() by SCIPcreateExprMonomial()
1057- removed SCIPexprCreateUser(), use SCIPincludeExprhdlr() instead
1058- removed SCIPexprHasParam(), SCIPexprGetMaxDegree(), SCIPexprGetVarsUsage()
1059- replaced SCIPexprAreEqual() by SCIPcompareExpr()
1060- replaced SCIPexprSimplify() by SCIPsimplifyExpr()
1061- replaced SCIPexprEvalShallow() by SCIPcallExprEval()
1062- replaced SCIPexprEval() by SCIPevalExpr()
1063- replaced SCIPexprEvalIntShallow() by SCIPcallExprInteval()
1064- replaced SCIPexprEvalInt() by SCIPevalExprActivity()
1065- removed SCIPexprEvalUser(), SCIPexprEvalIntUser(), SCIPexprEstimateUser()
1066- replaced SCIPexprCheckCurvature() by SCIPcomputeExprCurvature()
1067- removed SCIPexprSubstituteVars(), use SCIPcopyExpr() instead
1068- removed SCIPexprReindexVars(), SCIPexprReindexParams()
1069- replaced SCIPexprPrint() by SCIPprintExpr()
1070- replaced SCIPexprParse() by SCIPparseExpr()
1073- removed SCIPexprtreeGetVars(), SCIPexprtreeSetVars(), SCIPexprtreeAddVars(), SCIPexprtreePrintWithNames(), SCIPexprtreeFindVar()
1074- removed SCIPexprtreeGetRoot(), SCIPexprtreeGetNVars(), SCIPexprtreeGetNParams(), SCIPexprtreeGetParamVals(), SCIPexprtreeSetParamVal(), SCIPexprtreeHasParam()
1075- removed SCIPexprtreeGetInterpreterData(), SCIPexprtreeSetInterpreterData(), SCIPexprtreeFreeInterpreterData()
1076- removed SCIPexprtreeGetMaxDegree()
1077- removed SCIPexprtreeEval(), use SCIPevalExpr() instead
1078- removed SCIPexprtreeEvalInt(), use SCIPevalExprActivity() instead
1079- removed SCIPexprtreePrint(), use SCIPprintExpr() instead
1080- removed SCIPexprtreeCreate()
1081- removed SCIPexprtreeCopy(), use SCIPduplicateExpr() instead
1082- removed SCIPexprtreeFree(), use SCIPreleaseExpr() instead
1083- removed SCIPexprtreeSetParams(), SCIPexprtreeGetVarsUsage()
1084- removed SCIPexprtreeSimplify(), use SCIPsimplifyExpr() instead
1085- removed SCIPexprtreeAddExpr()
1086- removed SCIPexprtreeCheckCurvature(), use SCIPcomputeExprCurvature() instead
1087- removed SCIPexprtreeSubstituteVars(), use SCIPcopyExpr() instead
1088- removed SCIPquadelemSort(), SCIPquadelemSortedFind(), SCIPquadelemSqueeze()
1091- removed SCIPexprgraphCaptureNode(), use SCIPcaptureExpr() instead
1092- removed SCIPexprgraphIsNodeEnabled()
1093- removed SCIPexprgraphGetNodeNChildren(), use SCIPexprGetNChildren() instead
1094- removed SCIPexprgraphGetNodeChildren(), use SCIPexprGetChildren() instead
1095- removed SCIPexprgraphGetNodeNParents(), SCIPexprgraphGetNodeParents(), SCIPexprgraphGetNodeDepth(), SCIPexprgraphGetNodePosition()
1096- removed SCIPexprgraphGetNodeOperator(), use SCIPexprGetHdlr() instead
1097- removed SCIPexprgraphGetNodeOperatorIndex(), SCIPexprgraphGetNodeOperatorReal(), use SCIPexprGetData() instead
1098- removed SCIPexprgraphGetNodeVar(), use SCIPgetVarExprVar() instead
1099- removed SCIPexprgraphGetNodeRealPowerExponent(), SCIPexprgraphGetNodeIntPowerExponent(), SCIPexprgraphGetNodeSignPowerExponent(), use SCIPgetExponentExprPow() instead
1100- removed SCIPexprgraphGetNodeLinearCoefs(), SCIPexprgraphGetNodeLinearConstant(), use SCIPgetCoefsExprSum(), SCIPgetConstantExprSum() instead
1101- removed SCIPexprgraphGetNodeQuadraticConstant(), SCIPexprgraphGetNodeQuadraticLinearCoefs(), SCIPexprgraphGetNodeQuadraticQuadElements(), SCIPexprgraphGetNodeQuadraticNQuadElements(), use SCIPexprGetQuadraticData(), SCIPexprGetQuadraticQuadTerm(), SCIPexprGetQuadraticBilinTerm() instead
1102- removed SCIPexprgraphGetNodePolynomialMonomials(), SCIPexprgraphGetNodePolynomialNMonomials(), SCIPexprgraphGetNodePolynomialConstant(), SCIPexprgraphGetNodePolynomialMonomialCurvature()
1103- removed SCIPexprgraphGetNodeUserData(), SCIPexprgraphHasNodeUserEstimator()
1104- removed SCIPexprgraphGetNodeBounds(), use SCIPexprGetActivity() instead
1105- removed SCIPexprgraphGetNodeVal(), use SCIPexprGetEvalValue() instead
1106- removed SCIPexprgraphGetNodeCurvature(), use SCIPexprGetCurvature() instead
1107- removed SCIPexprgraphCreateNode()
1108- removed SCIPexprgraphCreateNodeLinear(), use SCIPcreateExprSum() instead
1109- removed SCIPexprgraphCreateNodeQuadratic(), use SCIPcreateExprQuadratic() instead
1110- removed SCIPexprgraphCreateNodePolynomial(), SCIPexprgraphNodePolynomialAddMonomials()
1111- removed SCIPexprgraphCreateNodeUser(), removed SCIPexprgraphNodeSplitOffLinear(), SCIPexprgraphMoveNodeParents()
1112- removed SCIPexprgraphReleaseNode(), use SCIPreleaseExpr() instead
1113- removed SCIPexprgraphFreeNode(), use SCIPreleaseExpr() instead
1114- removed SCIPexprgraphEnableNode(), SCIPexprgraphDisableNode()
1115- removed SCIPexprgraphHasNodeSibling(), SCIPexprgraphAreAllNodeChildrenVars(), SCIPexprgraphHasNodeNonlinearAncestor()
1116- removed SCIPexprgraphPrintNode(), SCIPprintExpr() instead
1117- removed SCIPexprgraphTightenNodeBounds()
1118- removed SCIPexprgraphUpdateNodeBoundsCurvature(), use SCIPevalExprActivity() and SCIPcomputeExprCurvature() instead
1119- removed SCIPexprgraphGetDepth(), SCIPexprgraphGetNNodes(), SCIPexprgraphGetNodes(), SCIPexprgraphGetNVars(), SCIPexprgraphGetVars()
1120- removed SCIPexprgraphGetVarNodes(), SCIPexprgraphSetVarNodeValue(), SCIPexprgraphSetVarsBounds(), SCIPexprgraphSetVarBounds(), SCIPexprgraphSetVarNodeBounds(), SCIPexprgraphSetVarNodeLb(), SCIPexprgraphSetVarNodeUb(), SCIPexprgraphGetVarsBounds()
1121- removed SCIPexprgraphCreate(), SCIPexprgraphFree()
1122- removed SCIPexprgraphAddNode(), SCIPexprgraphAddVars(), SCIPexprgraphAddConst(), SCIPexprgraphAddExprtreeSum()
1123- removed SCIPexprgraphReplaceVarByLinearSum(), SCIPexprgraphFindVarNode(), SCIPexprgraphFindConstNode()
1124- replaced SCIPexprgraphPrintDot() by SCIPprintExprDotInit[2](), SCIPprintExprDot(), SCIPprintExprDotFinal()
1125- removed SCIPexprgraphEval(), use SCIPevalExpr() instead
1126- removed SCIPexprgraphPropagateVarBounds(), SCIPexprgraphPropagateNodeBounds()
1127- removed SCIPexprgraphCheckCurvature(), use SCIPcomputeExprCurvature() instead
1128- removed SCIPexprgraphSimplify(), use SCIPsimplifyExpr() instead
1129- removed SCIPexprgraphGetTree(), SCIPexprgraphGetSeparableTrees(), SCIPexprgraphGetSubtreeVarsUsage(), SCIPexprgraphGetSumTreesNSummands(), SCIPexprgraphGetSumTrees()
1131Constraint handlers for NLP:
1132- removed SCIPincludeConshdlrAbspower()
1133- deprecated SCIPcreateConsAbspower() and SCIPcreateConsBasicAbspower(), use SCIPcreateConsBasicSignpowerNonlinear() instead
1134- deprecated SCIPgetNlRowAbspower(), use SCIPgetNlRowNonlinear() instead
1135- removed SCIPgetNonlinearVarAbspower(), SCIPgetLinearVarAbspower(), SCIPgetExponentAbspower(), SCIPgetOffsetAbspower(), SCIPgetCoefLinearAbspower(), SCIPgetLhsAbspower(), SCIPgetRhsAbspower()
1136- removed SCIPgetViolationAbspower(), use SCIPgetAbsViolationNonlinear() instead
1137- removed SCIPisConvexAbspower(), use SCIPhasExprCurvature() instead
1138- removed SCIPincludeConshdlrBivariate(), SCIPcreateConsBivariate(), SCIPcreateConsBasicBivariate()
1139- removed SCIPgetLinearVarBivariate(), SCIPgetLinearCoefBivariate(), SCIPgetExprtreeBivariate(), SCIPgetLhsBivariate(), SCIPgetRhsBivariate()
1140- removed SCIPincludeConshdlrQuadratic(), use SCIPincludeNlhdlrQuadratic() instead
1141- removed SCIPincludeQuadconsUpgrade()
1142- removed SCIPcreateConsQuadratic2(), SCIPcreateConsBasicQuadratic2()
1143- deprecated SCIPcreateConsBasicQuadratic(), use SCIPcreateConsBasicQuadraticNonlinear() instead
1144- deprecated SCIPcreateConsBasicQuadratic(), use SCIPcreateConsQuadraticNonlinear() instead
1145- deprecated SCIPaddConstantQuadratic(), use SCIPgetLhsNonlinear() and SCIPgetRhsNonlinear() instead
1146- deprecated SCIPaddLinearVarQuadratic(), use SCIPaddLinearVarNonlinear() instead
1147- deprecated SCIPaddQuadVarQuadratic(), use SCIPaddLinearVarNonlinear() and SCIPaddExprNonlinear() instead
1148- deprecated SCIPaddQuadVarLinearCoefQuadratic(), use SCIPaddLinearVarNonlinear() instead
1149- deprecated SCIPaddSquareCoefQuadratic(), use SCIPaddExprNonlinear() instead
1150- deprecated SCIPaddBilinTermQuadratic(), use SCIPaddExprNonlinear() instead
1151- deprecated SCIPchgLhsQuadratic(), use SCIPgetLhsNonlinear() instead
1152- deprecated SCIPchgRhsQuadratic(), use SCIPgetRhsNonlinear() instead
1153- deprecated SCIPgetNlRowQuadratic(), use SCIPgetNlRowNonlinear() instead
1154- removed SCIPgetNLinearVarsQuadratic(), SCIPgetLinearVarsQuadratic(), SCIPgetCoefsLinearVarsQuadratic(), SCIPgetNQuadVarTermsQuadratic(), SCIPgetQuadVarTermsQuadratic(), SCIPsortQuadVarTermsQuadratic(), SCIPfindQuadVarTermQuadratic(), SCIPgetNBilinTermsQuadratic(), SCIPgetBilinTermsQuadratic(), SCIPgetLhsQuadratic(), SCIPgetRhsQuadratic()
1155- removed SCIPgetLinvarMayDecreaseQuadratic(), SCIPgetLinvarMayIncreaseQuadratic()
1156- removed SCIPcheckCurvatureQuadratic() and SCIPisConvexConsQuadratic(), use SCIPcomputeExprQuadraticCurvature() instead
1157- removed SCIPisConvexQuadratic(), SCIPisConcaveQuadratic()
1158- removed SCIPgetViolationQuadratic() and SCIPgetFeasibilityQuadratic(), use SCIPgetAbsViolationNonlinear() instead
1159- removed SCIPisLinearLocalQuadratic(), SCIPaddToNlpiProblemQuadratic()
1160- removed SCIPchgLinearCoefQuadratic(), SCIPchgSquareCoefQuadratic(), SCIPchgBilinCoefQuadratic()
1161- renamed SCIPgetNAllBilinearTermsQuadratic() to SCIPgetNBilinTermsNonlinear() and changed argument from SCIP* to SCIP_CONSHDLR*
1162- renamed SCIPgetAllBilinearTermsQuadratic() to SCIPgetBilinTermsNonlinear() and replaced arguments by SCIP_CONSHDLR* and changed return type to SCIP_CONSNONLINEAR_BILINTERM*
1163- removed SCIPaddBilinearIneqQuadratic(), use SCIPinsertBilinearTermImplicitNonlinear() instead
1164- renamed SCIPcreateConsQuadratic() to SCIPcreateConsQuadraticNonlinear() and removed argument stickingatnode
1165- removed SCIPincludeConshdlrSOC()
1166- replaced SCIPcreateConsBasicSOC() by SCIPcreateConsBasicSOCNonlinear()
1167- deprecated SCIPcreateConsSOC(), use SCIPcreateConsBasicSOCNonlinear() instead
1168- deprecated SCIPgetNlRowSOC(), use SCIPgetNlRowNonlinear() instead
1169- removed SCIPgetNLhsVarsSOC(), SCIPgetLhsVarsSOC(), SCIPgetLhsCoefsSOC(), SCIPgetLhsOffsetsSOC(), SCIPgetLhsConstantSOC(), SCIPgetRhsVarSOC(), SCIPgetRhsCoefSOC(), SCIPgetRhsOffsetSOC(), use SCIPisSOCNonlinear() instead
1170- removed SCIPaddToNlpiProblemSOC()
1171- renamed SCIPincludeNonlinconsUpgrade() to SCIPincludeConsUpgradeNonlinear() and removed nodereform argument
1172- removed arguments nlinvars, linvars, lincoefs, nexprtrees, exprtrees, nonlincoefs, stickingatnode from SCIPcreateConsNonlinear() and added SCIP_EXPR* argument
1173- removed arguments nlinvars, linvars, lincoefs, nexprtrees, exprtrees, nonlincoefs from SCIPcreateConsBasicNonlinear() and added SCIP_EXPR* argument
1174- removed SCIPcreateConsNonlinear2(), SCIPcreateConsBasicNonlinear2()
1175- removed SCIPsetExprtreesNonlinear(), use SCIPchgExprNonlinear() instead
1176- removed SCIPaddExprtreesNonlinear()
1177- removed SCIPgetNLinearVarsNonlinear(), SCIPgetLinearVarsNonlinear(), SCIPgetLinearCoefsNonlinear()
1178- removed SCIPgetNExprtreesNonlinear(), SCIPgetExprtreesNonlinear(), SCIPgetExprtreeCoefsNonlinear(), SCIPgetExprgraphNodeNonlinear(), use SCIPgetExprNonlinear() instead
1179- removed argument scip from SCIPgetLhsNonlinear() and SCIPgetRhsNonlinear()
1180- removed SCIPcheckCurvatureNonlinear(), SCIPgetCurvatureNonlinear(), and SCIPgetExprtreeCurvaturesNonlinear(), use SCIPhasExprCurvature() instead
1181- renamed SCIPgetViolationNonlinear() to SCIPgetAbsViolationNonlinear()
1182- added arguments var and coef to SCIPgetLinvarMayDecreaseNonlinear() and SCIPgetLinvarMayIncreaseNonlinear() and changed return type to void
1183- removed SCIPgetExprgraphNonlinear()
1184- removed SCIPcomputeHyperplaneThreePoints(), use SCIPcomputeFacetVertexPolyhedralNonlinear() instead
1186### New API functions
1188- added SCIPallocClearMemory() and SCIPallocClearBlockMemory() to allocate a chunk of (block) memory
1189 that is initialized to zeros
1190- New internal functions for changing the default values of parameters:
1191 SCIPparamsetSetDefaultLongint(), SCIPparamsetSetDefaultReal(), SCIPparamsetSetDefaultChar(),
1192 SCIPparamsetSetDefaultString() and
1193 SCIPparamSetDefaultLongint(), SCIPparamSetDefaultReal(), SCIPparamSetDefaultChar(),
1194 SCIPparamSetDefaultString()
1195- new internal function SCIPisPackingPartitioningOrbitope() to check whether an orbitope is of
1196 packing or partitioning type
1197- new internal function SCIPcomputeOrbitVar() to compute the symmetry orbit of a variable
1198- added SCIPcalcFibHash(SCIP_Real) to hash a floating-point value to an unsigned integer
1199- added SCIPcomputeArraysIntersectionPtr() to compute intersection of two sorted arrays of pointers
1200- new function SCIPinterruptLP() (intended to be called from a different thread) that interrupts ongoing lp solve
1201- added SCIPcreateConsIndicatorGeneric() and SCIPcreateConsIndicatorGenericLinCons()
1202 which copy the interface of SCIPcreateConsIndicator() and SCIPcreateConsIndicatorLinCons() and
1203 add an activeone argument to specify whether the indicator constraint should be activated on 0 or 1.
1204 SCIPcreateConsIndicator() also adds a lessthanineq flag to choose whether the linear constraint is a less-than or greater-than inequality.
1205- added SCIPmarkDoNotAggrVar() to mark that a variable should not be aggregated
1206- added SCIPdoNotAggrVar() to query whether a variable should not be aggregated
1207- added SCIPdecompGetNBorderVars() and SCIPdecompGetNBorderConss() to get number of border variables/constraints
1208- added SCIPdecompGetVarsSize() and SCIPdecompGetConssSize() to get variable/constraint size for each block of a decomposition
1209- added SCIPincludeDialogDefaultBasic()
1210- added SCIPintervalAreDisjointEps(), SCIPintervalIntersectEps()
1211- added SCIPintervalEntropy()
1212- added SCIPintervalPropagateWeightedSum()
1213- added SCIPcalcRootNewton()
1214- added SCIPvarGetImplicVarBounds()
1215- added SCIPcreateRowprep(), SCIPfreeRowprep(), SCIPcopyRowprep(),
1216 SCIProwprepGetNVars(), SCIProwprepGetVars(), SCIProwprepGetCoefs(), SCIProwprepGetSide(), SCIProwprepGetSidetype(), SCIProwprepIsLocal(), SCIProwprepGetName(), SCIProwprepGetNModifiedVars(), SCIProwprepGetModifiedVars(),
1217 SCIProwprepReset(), SCIProwprepAddSide(), SCIProwprepAddConstant(), SCIProwprepSetSidetype(), SCIProwprepSetLocal(), SCIProwprepRecordModifications(),
1218 SCIPprintRowprep(), SCIPprintRowprepSol(), SCIPensureRowprepSize(), SCIPaddRowprepTerm(), SCIPaddRowprepTerms(), SCIPgetRowprepViolation(), SCIPisRowprepViolationReliable(),
1219 SCIPmergeRowprepTerms(), SCIPcleanupRowprep(), SCIPcleanupRowprep2(), SCIPscaleupRowprep(), SCIPscaleRowprep(),
1220 SCIPgetRowprepRowConshdlr(), SCIPgetRowprepRowCons(), SCIPgetRowprepRowSepa()
1221- added SCIPsetClockEnabled()
1222- added SCIPisSolveInterrupted() to check whether SCIPinterruptSolve() has been called
1223- added SCIPgetNPresolRounds()
1224- added SCIPgetNUnfixedLPCols()
1225- moved SCIPhistoryGetInferenceSum() and SCIPhistoryGetAvgConflictlength() from internal to public API
1228- added SCIPincludeExprhdlr(), SCIPgetExprhdlrs(), SCIPgetNExprhdlrs(), SCIPfindExprhdlr()
1229- added SCIPgetExprhdlrVar(), SCIPgetExprhdlrValue(), SCIPgetExprhdlrSum(), SCIPgetExprhdlrProduct(), SCIPgetExprhdlrPower()
1230- added SCIPexprhdlrSetCopyFreeHdlr(), SCIPexprhdlrSetCopyFreeData(), SCIPexprhdlrSetPrint(), SCIPexprhdlrSetParse(), SCIPexprhdlrSetCurvature(), SCIPexprhdlrSetMonotonicity(), SCIPexprhdlrSetIntegrality(), SCIPexprhdlrSetHash(), SCIPexprhdlrSetCompare(), SCIPexprhdlrSetDiff(), SCIPexprhdlrSetIntEval(), SCIPexprhdlrSetSimplify(), SCIPexprhdlrSetReverseProp(), SCIPexprhdlrSetEstimate()
1231- added SCIPexprhdlrGetName(), SCIPexprhdlrGetDescription(), SCIPexprhdlrGetPrecedence(), SCIPexprhdlrGetData(), SCIPexprhdlrHasPrint(), SCIPexprhdlrHasBwdiff(), SCIPexprhdlrHasFwdiff(), SCIPexprhdlrHasIntEval(), SCIPexprhdlrHasEstimate(), SCIPexprhdlrHasInitEstimates(), SCIPexprhdlrHasSimplify(), SCIPexprhdlrHasCurvature(), SCIPexprhdlrHasMonotonicity(), SCIPexprhdlrHasReverseProp()
1232- added SCIPexprhdlrComp()
1233- added SCIPexprhdlrGetNIntevalCalls(), SCIPexprhdlrGetIntevalTime(), SCIPexprhdlrGetNReversepropCalls(), SCIPexprhdlrGetReversepropTime(), SCIPexprhdlrGetNCutoffs(), SCIPexprhdlrGetNDomainReductions(), SCIPexprhdlrIncrementNDomainReductions(), SCIPexprhdlrGetNEstimateCalls(), SCIPexprhdlrGetEstimateTime(), SCIPexprhdlrGetNBranchings(), SCIPexprhdlrIncrementNBranchings(), SCIPexprhdlrGetNSimplifyCalls(), SCIPexprhdlrGetSimplifyTime(), SCIPexprhdlrGetNSimplifications()
1234- added SCIPprintExpressionHandlerStatistics()
1235- added SCIPincludeExprhdlrEntropy(), SCIPcreateExprEntropy(), SCIPisExprEntropy()
1236- added SCIPincludeExprhdlrErf(), SCIPcreateExprErf(), SCIPisExprErf()
1237- added SCIPcreateExprAbs(), SCIPincludeExprhdlrAbs(), SCIPisExprAbs()
1238- added SCIPcreateExprExp(), SCIPincludeExprhdlrExp(), SCIPisExprExp()
1239- added SCIPcreateExprLog(), SCIPincludeExprhdlrLog(), SCIPisExprLog()
1240- added SCIPcreateExprPow(), SCIPcreateExprSignpower(), SCIPincludeExprhdlrPow(), SCIPincludeExprhdlrSignpower(), SCIPisExprSignpower(), SCIPgetExponentExprPow(), SCIPisExprPower()
1241- added SCIPincludeExprhdlrProduct(), SCIPcreateExprProduct(), SCIPgetCoefExprProduct(), SCIPisExprProduct()
1242- added SCIPincludeExprhdlrSum(), SCIPcreateExprSum(), SCIPsetConstantExprSum(), SCIPappendExprSumExpr(), SCIPmultiplyByConstantExprSum(), SCIPgetCoefsExprSum(), SCIPgetConstantExprSum(), SCIPisExprSum()
1243- added SCIPincludeExprhdlrSin(), SCIPcreateExprSin(), SCIPincludeExprhdlrCos(), SCIPcreateExprCos(), SCIPisExprSin(), SCIPisExprCos()
1244- added SCIPincludeExprhdlrValue(), SCIPcreateExprValue(), SCIPgetValueExprValue(), SCIPisExprValue()
1245- added SCIPincludeExprhdlrVar(), SCIPcreateExprVar(), SCIPgetVarExprVar(), SCIPisExprVar()
1246- added SCIPincludeExprhdlrVaridx(), SCIPcreateExprVaridx(), SCIPisExprVaridx(), SCIPgetIndexExprVaridx(), SCIPsetIndexExprVaridx()
1249- added SCIPcaptureExpr(), SCIPreleaseExpr(), SCIPexprGetNUses()
1250- added SCIPexprGetHdlr(), SCIPexprGetData(), SCIPexprSetData(), SCIPexprGetOwnerData()
1251- added SCIPevalExpr(), SCIPgetExprNewSoltag(), SCIPexprGetEvalValue(), SCIPexprGetEvalTag()
1252- added SCIPevalExprGradient(), SCIPevalExprHessianDir(), SCIPexprGetDerivative(), SCIPexprGetDot(), SCIPexprGetBardot(), SCIPexprGetDiffTag()
1253- added SCIPevalExprActivity(), SCIPexprGetActivity(), SCIPexprGetActivityTag(), SCIPexprSetActivity()
1254- added SCIPcomputeExprCurvature(), SCIPexprGetCurvature(), SCIPexprSetCurvature()
1255- added SCIPcomputeExprIntegrality(), SCIPexprIsIntegral(), SCIPexprSetIntegrality()
1256- added SCIPcheckExprQuadratic(), SCIPfreeExprQuadratic(), SCIPevalExprQuadratic(), SCIPprintExprQuadratic(), SCIPcomputeExprQuadraticCurvature()
1257- added SCIPexprGetQuadraticData(), SCIPexprGetQuadraticQuadTerm(), SCIPexprGetQuadraticBilinTerm(), SCIPexprAreQuadraticExprsVariables()
1258- added SCIPcreateExpr(), SCIPcreateExpr2(), SCIPcreateExprQuadratic(), SCIPcreateExprMonomial()
1259- added SCIPappendExprChild(), SCIPreplaceExprChild(), SCIPremoveExprChildren()
1260- added SCIPduplicateExpr(), SCIPduplicateExprShallow(), SCIPcopyExpr()
1261- added SCIPparseExpr()
1262- added SCIPprintExpr(), SCIPdismantleExpr()
1263- added SCIPprintExprDotInit(), SCIPprintExprDotInit2(), SCIPprintExprDot(), SCIPprintExprDotFinal(), SCIPshowExpr()
1264- added SCIPcompareExpr(), SCIPhashExpr()
1265- added SCIPsimplifyExpr(), SCIPreplaceCommonSubexpressions()
1266- added SCIPgetExprNVars(), SCIPgetExprVarExprs()
1267- added SCIPcallExprPrint(), SCIPcallExprCurvature(), SCIPcallExprMonotonicity(), SCIPcallExprEval(), SCIPcallExprEvalFwdiff(), SCIPcallExprInteval(), SCIPcallExprEstimate(), SCIPcallExprInitestimates(), SCIPcallExprSimplify(), SCIPcallExprReverseprop()
1268- added SCIPexprcurvPowerInv(), SCIPexprcurvMonomialInv()
1271- added SCIPcreateExpriter(), SCIPfreeExpriter()
1272- added SCIPexpriterIsInit(), SCIPexpriterInit()
1273- added SCIPexpriterRestartDFS(), SCIPexpriterSetStagesDFS(), SCIPexpriterGetCurrent(), SCIPexpriterGetStageDFS(), SCIPexpriterGetChildIdxDFS(), SCIPexpriterGetChildExprDFS(), SCIPexpriterGetParentDFS()
1274- added SCIPexpriterGetCurrentUserData(), SCIPexpriterGetChildUserDataDFS(), SCIPexpriterGetExprUserData(), SCIPexpriterSetCurrentUserData(), SCIPexpriterSetExprUserData(), SCIPexpriterSetChildUserData()
1275- added SCIPexpriterGetNext(), SCIPexpriterSkipDFS(), SCIPexpriterIsEnd()
1276- added SCIPexprintHessianSparsity(), SCIPexprintHessian()
1278Constraint handlers for NLP:
1279- added SCIPgetCurBoundsTagNonlinear(), SCIPgetLastBoundRelaxTagNonlinear(), SCIPincrementCurBoundsTagNonlinear()
1280- added SCIPgetVarExprHashmapNonlinear()
1281- added SCIPprocessRowprepNonlinear()
1282- added SCIPassumeConvexNonlinear()
1283- added SCIPcollectBilinTermsNonlinear(), SCIPgetBilinTermIdxNonlinear(), SCIPgetBilinTermNonlinear(), SCIPevalBilinAuxExprNonlinear(), SCIPinsertBilinearTermExistingNonlinear(), SCIPinsertBilinearTermImplicitNonlinear()
1284- added SCIPcomputeFacetVertexPolyhedralNonlinear()
1285- added SCIPgetExprNonlinear()
1286- added SCIPcheckQuadraticNonlinear(), SCIPchgLhsNonlinear(), SCIPchgRhsNonlinear(), SCIPchgExprNonlinear(), SCIPaddExprNonlinear()
1287- added SCIPgetRelViolationNonlinear()
1288- added SCIPgetExprNLocksPosNonlinear(), SCIPgetExprNLocksNegNonlinear(), SCIPgetExprAuxVarNonlinear(), SCIPgetExprNEnfosNonlinear(), SCIPgetExprEnfoDataNonlinear(), SCIPsetExprEnfoAuxValueNonlinear()
1289- added SCIPgetExprNPropUsesActivityNonlinear(), SCIPgetExprNSepaUsesActivityNonlinear(), SCIPgetExprNAuxvarUsesNonlinear(), SCIPregisterExprUsageNonlinear()
1290- added SCIPgetExprAbsOrigViolationNonlinear(), SCIPgetExprAbsAuxViolationNonlinear(), SCIPgetExprRelAuxViolationNonlinear()
1291- added SCIPgetExprBoundsNonlinear(), SCIPtightenExprIntervalNonlinear(), SCIPmarkExprPropagateNonlinear()
1292- added SCIPaddExprViolScoreNonlinear(), SCIPaddExprsViolScoreNonlinear(), SCIPgetExprViolScoreNonlinear()
1293- added SCIPgetExprPartialDiffNonlinear(), SCIPgetExprPartialDiffGradientDirNonlinear()
1294- added SCIPevalExprQuadraticAuxNonlinear()
1295- added SCIPincludeNlhdlrNonlinear(), SCIPfindNlhdlrNonlinear(), SCIPgetNNlhdlrsNonlinear(), SCIPgetNlhdlrsNonlinear(), SCIPgetNlhdlrExprDataNonlinear()
1296- added SCIPcreateConsQuadraticNonlinear() and SCIPcreateConsBasicQuadraticNonlinear() to create a nonlinear constraint that is quadratic
1297- added SCIPcreateConsBasicSignpowerNonlinear() to create a nonlinear constraint that looks like the former abspower or signpower constraints
1300- added SCIPincludeNlhdlrBilinear(), SCIPgetExprsBilinear(), SCIPgetExprsdataBilinear(), SCIPgetNExprsBilinear(), SCIPaddIneqBilinear()
1301- added SCIPincludeNlhdlrConvex(), SCIPincludeNlhdlrConcave(), SCIPhasExprCurvature()
1302- added SCIPincludeNlhdlrDefault()
1303- added SCIPincludeNlhdlrPerspective()
1304- added SCIPincludeNlhdlrQuadratic()
1305- added SCIPincludeNlhdlrQuotient()
1306- added SCIPincludeNlhdlrSoc(), SCIPisSOCNonlinear(), SCIPfreeSOCArraysNonlinear()
1307- added SCIPnlhdlrSetCopyHdlr(), SCIPnlhdlrSetFreeHdlrData(), SCIPnlhdlrSetFreeExprData(), SCIPnlhdlrSetInitExit(), SCIPnlhdlrSetProp(), SCIPnlhdlrSetSepa()
1308- added SCIPnlhdlrGetName(), SCIPnlhdlrGetDesc(), SCIPnlhdlrGetDetectPriority(), SCIPnlhdlrGetEnfoPriority(), SCIPnlhdlrIsEnabled(), SCIPnlhdlrGetData()
1309- added SCIPnlhdlrHasIntEval(), SCIPnlhdlrHasReverseProp(), SCIPnlhdlrHasInitSepa(), SCIPnlhdlrHasExitSepa(), SCIPnlhdlrHasEnfo(), SCIPnlhdlrHasEstimate()
1310- added SCIPnlhdlrComp()
1313- added SCIPgetNlpiSolverPointer(), SCIPcreateNlpiProblem(), SCIPfreeNlpiProblem(), SCIPgetNlpiProblemPointer(), SCIPaddNlpiVars(), SCIPaddNlpiConstraints(), SCIPsetNlpiObjective(), SCIPchgNlpiVarBounds(), SCIPchgNlpiConsSides(), SCIPdelNlpiVarSet(), SCIPdelNlpiConsSet(), SCIPchgNlpiLinearCoefs(), SCIPchgNlpiExpr(), SCIPchgNlpiObjConstant(), SCIPsetNlpiInitialGuess(), SCIPsolveNlpiParam(), SCIPgetNlpiSolstat(), SCIPgetNlpiTermstat(), SCIPgetNlpiSolution(), SCIPgetNlpiStatistics()
1314- added SCIPincludeNlpSolverAll()
1315- added SCIPincludeNlpSolverFilterSQP(), SCIPgetSolverNameFilterSQP(), SCIPgetSolverDescFilterSQP(), SCIPisFilterSQPAvailableFilterSQP()
1316- added SCIPincludeNlpSolverIpopt()
1317- added SCIPincludeNlpSolverWorhp()
1318- added SCIPnlpiOracleChgExpr()
1319- added SCIPcreateNlpiProblemFromNlRows()
1320- added SCIPnlpiOracleGetObjectiveConstant()
1321- added SCIPnlpiOracleIsVarNonlinear(), SCIPnlpiOracleGetVarCounts(), SCIPnlpiOracleIsConstraintNonlinear()
1322- added SCIPnlpiGetNProblems(), SCIPnlpiGetProblemTime(), SCIPnlpiGetNSolves(), SCIPnlpiGetSolveTime(), SCIPnlpiGetEvalTime(), SCIPnlpiGetNIterations(), SCIPnlpiGetNTermStat(), SCIPnlpiGetNSolStat(), SCIPnlpiMergeStatistics()
1323- added SCIPmergeNLPIStatistics(), SCIPprintNLPIStatistics()
1324- added SCIPnlpiOracleResetEvalTime(), SCIPnlpiOracleGetEvalTime()
1325- added SCIPaddNlpiProblemNlRows()
1328- added SCIPincludeCutsel(), SCIPincludeCutselBasic(), SCIPsetCutselCopy(), SCIPsetCutselFree(), SCIPsetCutselInit(), SCIPsetCutselExit(), SCIPsetCutselInitsol(), SCIPsetCutselExitsol(), SCIPfindCutsel(), SCIPgetCutsels(), SCIPgetNCutsels(), SCIPsetCutselPriority()
1329- added SCIPcutselGetName(), SCIPcutselGetData(), SCIPcutselGetDesc(), SCIPcutselGetPriority(), SCIPcutselSetData(), SCIPcutselIsInitialized(), SCIPcutselGetSetupTime(), SCIPcutselGetTime()
1331### Command line interface
1332### Interfaces to external software
1334- removed GAMS interface (originally in interfaces/gams) and reading capability of gms reader;
1335 the removed interface was a poorly maintained copy of the GAMS/SCIP interface that is available at
1336 https://github.com/coin-or/GAMSlinks
1337- integrated AMPL interface into main SCIP executable, that is, added possibility to use SCIP executable as solver in AMPL
1338 (AMPL calls solver with name of .nl file and -AMPL as arguments; SCIP will then attempt to solve the problem and write an AMPL solution file)
1339- the ZIMPL interface has been updated to support ZIMPL 3.4.1;
1340 the minimal required ZIMPL version is now 3.4.1
1342### Changed parameters
1344- Extended range of parameter "misc/usesymmetry" from [0,3] to [0,7], changed default from 3 to 5
1345- deleted parameter "constraints/orbitope/usedynamicprop"
1346- changed type of parameter "propagating/symmetry/recomputerestart" from SCIP_Bool to int with range [0,2]
1347- deleted parameter "propagating/symmetry/disableofrestart"
1348- parameter "heuristics/padm/original" is now an advanced parameter
1349- removed constraints/nonlinear/linfeasshift, constraints/nonlinear/reformulate, constraints/nonlinear/maxexpansionexponent, constraints/nonlinear/sepanlpmincont
1350- removed constraints/nonlinear/upgrade/abspower
1351- removed constraints/nonlinear/upgrade/and, use constraints/nonlinear/reformbinprodsand instead
1352- removed constraints/nonlinear/upgrade/bivariate
1353- removed constraints/nonlinear/upgrade/quadratic, use nlhdlr/quadratic/enabled instead
1354- changed default of constraints/nonlinear/maxproprounds from 1 to 10
1355- replaced constraints/nonlinear/enfocutsremovable by constraints/nonlinear/rownotremovable
1356- replaced constraints/nonlinear/cutmaxrange by separating/maxcoefratiofacrowprep
1357- removed constraints/quadratic/sepafreq, constraints/quadratic/propfreq, constraints/quadratic/proptiming, constraints/quadratic/eagerfreq, constraints/quadratic/maxprerounds, constraints/quadratic/delaysepa, constraints/quadratic/delayprop, constraints/quadratic/presoltiming
1358- removed constraints/quadratic/replacebinaryprod, use constraints/nonlinear/reformbinprodsfac instead
1359- removed constraints/quadratic/empathy4and, use constraints/nonlinear/reformbinprodsand instead
1360- removed constraints/quadratic/binreforminitial, constraints/quadratic/binreformbinaryonly, constraints/quadratic/binreformmaxcoef
1361- removed constraints/quadratic/cutmaxrange, constraints/quadratic/mincurvcollectbilinterms, constraints/quadratic/linearizeheursol, constraints/quadratic/checkcurvature, constraints/quadratic/checkfactorable, constraints/quadratic/checkquadvarlocks, constraints/quadratic/linfeasshift
1362- removed constraints/quadratic/maxdisaggrsize, constraints/quadratic/disaggrmergemethod, constraints/quadratic/maxproprounds, constraints/quadratic/maxproproundspresolve, constraints/quadratic/enfolplimit, constraints/quadratic/sepanlpmincont, constraints/quadratic/enfocutsremovable
1363- removed constraints/quadratic/gaugecuts, constraints/quadratic/interiorcomputation, constraints/quadratic/projectedcuts, constraints/quadratic/branchscoring, constraints/quadratic/usebilinineqbranch, constraints/quadratic/bilinineqmaxseparounds,
1364- removed constraints/quadratic/minscorebilinterms, use nlhdlr/bilinear/enabled instead
1365- removed constraints/quadratic/upgrade/linear, constraints/quadratic/upgrade/abspower, constraints/quadratic/upgrade/bivariate, constraints/quadratic/upgrade/bounddisjunction
1366- removed constraints/quadratic/upgrade/soc, use nlhdlr/soc/enabled instead
1367- renamed constraints/quadratic/upgrade/setppc to constraints/nonlinear/upgrade/setppc
1368- removed constraints/abspower/sepafreq, constraints/abspower/propfreq, constraints/abspower/proptiming, constraints/abspower/eagerfreq, constraints/abspower/maxprerounds, constraints/abspower/delaysepa, constraints/abspower/delayprop, constraints/abspower/presoltiming
1369- removed constraints/abspower/cutmaxrange, constraints/abspower/projectrefpoint, constraints/abspower/preferzerobranch, constraints/abspower/branchminconverror, constraints/abspower/addvarboundcons, constraints/abspower/linfeasshift, constraints/abspower/dualpresolve, constraints/abspower/sepainboundsonly, constraints/abspower/sepanlpmincont, constraints/abspower/enfocutsremovable
1370- removed constraints/bivariate/sepafreq, constraints/bivariate/propfreq, constraints/bivariate/proptiming, constraints/bivariate/eagerfreq, constraints/bivariate/maxprerounds, constraints/bivariate/delaysepa, constraints/bivariate/delayprop, constraints/bivariate/presoltiming
1371- removed constraints/bivariate/cutmaxrange, constraints/bivariate/linfeasshift, constraints/bivariate/maxproprounds, constraints/bivariate/ninitlprefpoints, constraints/bivariate/enfocutsremovable
1372- removed constraints/soc/sepafreq, constraints/soc/propfreq, constraints/soc/proptiming, constraints/soc/eagerfreq, constraints/soc/maxprerounds, constraints/soc/delaysepa, constraints/soc/delayprop, constraints/soc/presoltiming
1373- removed constraints/soc/projectpoint, constraints/soc/nauxvars, constraints/soc/glineur, constraints/soc/sparsify, constraints/soc/sparsifymaxloss, constraints/soc/sparsifynzgrowth, constraints/soc/linfeasshift, constraints/soc/nlpform, constraints/soc/sepanlpmincont, constraints/soc/enfocutsremovable, constraints/soc/disaggregate
1374- removed constraints/soc/generalsocupgrade, use nlhdlr/soc/compeigenvalues instead
1375- changed default of presolving/qpkktref/maxrounds from -1 to 0
1376- changed default of propagating/obbt/onlynonconvexvars from FALSE to TRUE
1377- changed default of heuristics/subnlp/resolvetolfactor from 0.001 to 1.0
1378- removed heuristics/subnlp/nlpoptfile, use nlpi/ipopt/optfile instead
1379- removed separating/convexproj/nlptimelimit
1380- removed separating/gauge/nlptimelimit
1381- removed heuristics/subnlp/nlptimelimit and heuristics/subnlp/nlpiterlimit
1382- removed heuristics/subnlp/resolvetolfactor and heuristics/subnlp/resolvefromscratch
1383- changed default of heuristics/subnlp/itermin to 20
1384- renamed heuristics/subnlp/iteroffset to heuristics/subnlp/nodesoffset
1385- renamed heuristics/subnlp/iterquotient to heuristics/subnlp/nodesfactor
1386- removed heuristics/subnlp/runalways, use heuristics/subnlp/nodesoffset=INT_MAX and heuristics/subnlp/successrateexp = 0.0 instead
1387- removed heuristics/subnlp/minimprove, heuristics/multistart/nlpminimpr
1388- Removed parameters for strongcg separator: separating/strongcg/..., i.e.,
1389 maxrounds, maxroundsroot, maxsepacutsroot, maxsepacuts, dynamiccuts. One can control the
1390 strongcg behavior throught the parameters of sepa_gomory.
1391- renamed separating/{minortho,minorthoroot,objparalfac,intsupportfac} to cutselection/hybrid/{minortho,minorthoroot,objparalweight,intsupportweight}
1395- It is now possible to add orbitope constraints to handle symmetries even if not all variables
1396 in a component of the symmetry group are binary. This feature can be enabled using the
1397 parameter "propagating/symmetry/onlybinorbitope".
1399- new parameter "propagating/symmetry/sstleaderrule" to select a rule for selecting the
1401- new parameter "propagating/symmetry/ssttiebreakrule" to select a tiebreak rule for selecting the
1403- new parameter "propagating/symmetry/sstleadervartype" to select the possible variable types
1404 for a leader in SST cuts
1405- new parameter "propagating/symmetry/addconflictcuts" to control whether SST cuts are added if
1406 a binary leader variable is in conflict with a variable in its orbit
1407- new parameter "propagating/symmetry/sstaddcuts" to control whether SST cuts are added
1408- new parameter "propagating/symmetry/sstmixedcomponents" to control whether SST cuts are added
1409 if a symmetry component contains variables of different types
1410- new parameter "propagating/symmetry/detectsubgroups" to search for orbitopes defined by subgroups
1411- new parameter "propagating/symmetry/addweaksbcs" to add Schreier Sims cuts for a single
1412 variable orbit in case an orbitope subgroup is detected
1413- new parameter "propagating/symmetry/addstrongsbcs" to add symretope facets for a single
1414 variable orbit on which the symmetry group acts like a symmetric group
1415- new parameter "propagating/symmetry/maxnconsssubgroup" to control up to which number of
1416 constraints subgroups are detected
1417- new parameter "propagating/symmetry/preferlessrows" to control whether orbitopes with
1418 smallest number of rows shall be computed by the subgroup detection heuristic
1419- new parameter "propagating/symmetry/usedynamicprop" to control if rows of full orbitope
1420 shall be ordered dynamically in propagation
1421- new parameter "separating/filtercutpoolrel" to control whether cutpool uses
1422 a dynamic strategy to separate only cuts with high relative efficacy
1423- if run from AMPL: display/statistics to enable printing detailed solve statistics after solve
1424- if run from AMPL: display/logfile to specify name of file to write SCIP log to (additionally to writing to stdout)
1425- constraints/nonlinear/propauxvars, constraints/nonlinear/varboundrelax, constraints/nonlinear/varboundrelaxamount, constraints/nonlinear/conssiderelaxamount
1426- constraints/nonlinear/vpmaxperturb, constraints/nonlinear/vpadjfacetthresh, constraints/nonlinear/vpdualsimplex
1427- constraints/nonlinear/bilinmaxnauxexprs, constraints/nonlinear/forbidmultaggrnlvar, constraints/nonlinear/checkvarlocks, constraints/nonlinear/violscale
1428- constraints/nonlinear/reformbinprods, constraints/nonlinear/reformbinprodsand, constraints/nonlinear/reformbinprodsfac
1429- constraints/nonlinear/tightenlpfeastol, constraints/nonlinear/propinenforce, constraints/nonlinear/weakcutthreshold, constraints/nonlinear/strongcutmaxcoef, constraints/nonlinear/strongcutefficacy, constraints/nonlinear/forcestrongcut, constraints/nonlinear/enfoauxviolfactor, constraints/nonlinear/weakcutminviolfactor
1430- constraints/nonlinear/branching/aux, constraints/nonlinear/branching/external, constraints/nonlinear/branching/highviolfactor, constraints/nonlinear/branching/highscorefactor, constraints/nonlinear/branching/violweight, constraints/nonlinear/branching/dualweight, constraints/nonlinear/branching/pscostweight, constraints/nonlinear/branching/domainweight, constraints/nonlinear/branching/vartypeweight, constraints/nonlinear/branching/scoreagg, constraints/nonlinear/branching/violsplit, constraints/nonlinear/branching/pscostreliable
1431- constraints/nonlinear/linearizeheursol
1432- nlhdlr/default/enabled
1433- nlhdlr/convex/enabled, nlhdlr/convex/detectsum, nlhdlr/convex/extendedform, nlhdlr/convex/cvxquadratic, nlhdlr/convex/cvxsignomial, nlhdlr/convex/cvxprodcomp, nlhdlr/convex/handletrivial
1434- nlhdlr/concave/enabled, nlhdlr/concave/detectsum, nlhdlr/concave/cvxquadratic, nlhdlr/concave/cvxsignomial, nlhdlr/concave/cvxprodcomp, nlhdlr/concave/handletrivial
1435- nlhdlr/bilinear/enabled, nlhdlr/bilinear/useinteval, nlhdlr/bilinear/usereverseprop, nlhdlr/bilinear/maxseparoundsroot, nlhdlr/bilinear/maxseparounds, nlhdlr/bilinear/maxsepadepth
1436- nlhdlr/perspective/enabled, nlhdlr/perspective/maxproprounds, nlhdlr/perspective/mindomreduction, nlhdlr/perspective/minviolprobing, nlhdlr/perspective/probingonlyinsepa, nlhdlr/perspective/probingfreq, nlhdlr/perspective/convexonly, nlhdlr/perspective/tightenbounds, nlhdlr/perspective/adjrefpoint
1437- nlhdlr/quadratic/enabled, nlhdlr/quadratic/useintersectioncuts, nlhdlr/quadratic/usestrengthening, nlhdlr/quadratic/useboundsasrays, nlhdlr/quadratic/ncutslimit, nlhdlr/quadratic/ncutslimitroot, nlhdlr/quadratic/maxrank, nlhdlr/quadratic/mincutviolation, nlhdlr/quadratic/minviolation, nlhdlr/quadratic/atwhichnodes, nlhdlr/quadratic/nstrengthlimit, nlhdlr/quadratic/ignorebadrayrestriction, nlhdlr/quadratic/ignorehighre
1438- nlhdlr/quotient/enabled
1439- nlhdlr/soc/enabled, nlhdlr/soc/mincutefficacy, nlhdlr/soc/compeigenvalues
1440- propagating/obbt/createlincons
1441- propagating/symmetry/onlybinarysymmetry
1442- separating/minor/priority, separating/minor/freq, separating/minor/maxbounddist, separating/minor/delay, separating/minor/expbackoff, separating/minor/maxminorsconst, separating/minor/maxminorsfac, separating/minor/mincutviol, separating/minor/maxrounds, separating/minor/maxroundsroot, separating/minor/ignorepackingconss
1443- separating/rlt/priority, separating/rlt/freq, separating/rlt/maxbounddist, separating/rlt/delay, separating/rlt/expbackoff, separating/rlt/maxncuts, separating/rlt/maxunknownterms, separating/rlt/maxusedvars, separating/rlt/maxrounds, separating/rlt/maxroundsroot, separating/rlt/onlyeqrows, separating/rlt/onlycontrows, separating/rlt/onlyoriginal, separating/rlt/useinsubscip, separating/rlt/useprojection, separating/rlt/detecthidden, separating/rlt/hiddenrlt, separating/rlt/addtopool, separating/rlt/goodscore, separating/rlt/badscore, separating/rlt/objparalweight, separating/rlt/efficacyweight, separating/rlt/dircutoffdistweight, separating/rlt/goodmaxparall, separating/rlt/maxparall
1444- separating/interminor/usestrengthening, separating/interminor/usebounds, separating/interminor/mincutviol, separating/interminor/maxrounds, separating/interminor/maxroundsroot
1445- table/cons_nonlinear/active, table/nlhdlr/active, table/exprhdlr/active, table/nlpi/active, table/nlhdlr_bilinear/active, table/nlhdlr_quadratic/active
1446- expr/log/minzerodistance, expr/pow/minzerodistance
1447- benders/default/maxslackvarcoef to specify maximal coefficient for slack variables; if exceeded, slack variables are fixed to zero
1448- nlpi/ipopt/optfile to specify name of Ipopt options file to use for every solve with Ipopt
1449- nlpi/ipopt/print_level, nlpi/ipopt/hsllib, nlpi/ipopt/pardisolib, nlpi/ipopt/linear_solver, nlpi/ipopt/linear_system_scaling, nlpi/ipopt/nlp_scaling_method, nlpi/ipopt/mu_strategy, nlpi/ipopt/hessian_approximation
1450- nlpi/ipopt/warm_start_push
1452- heuristics/subnlp/iterinit, heuristics/subnlp/ninitsolves, heuristics/subnlp/successrateexp
1453- heuristics/subnlp/expectinfeas, heuristics/subnlp/opttol, heuristics/subnlp/feastolfactor
1454- heuristics/subnlp/presolveemphasis, heuristics/subnlp/setcutoff
1455- new parameters "branching/inference/conflictprio" and "branching/inference/cutoffprio" that allow
1456 using the different score criteria in inference branching hierarchically
1457- new parameters "heuristics/alns/nodesquotmin", "heuristics/alns/maxcallssamesol" and "heuristics/alns/initduringroot"
1458 to control neighborhoods in ALNS
1459- new parameter "benders/default/benderscut/optimality/mir" to control whether mixed-integer rounding procedure is applied to Benders optimality cuts
1460- new parameter "misc/avoidmemout" to try to avoid running into memory limit
1461- cutselection/hybrid/dircutoffdistweight, cutselection/hybrid/efficacyweight, cutselection/hybrid/intsupportweight, cutselection/hybrid/objparalweight, cutselection/hybrid/priority
1462- new parameter "decomposition/disablemeasures" to disable expensive measures in SCIPcomputeDecompStats()
1463- new parameter "presolving/milp/probfilename" filename to write the problem to a file before MILP presolving starts
1467- removed quadratic terms from NLROWs
1468- removed SCIP_NLPPAR_INFINITY from SCIP_NLPPARAM enum
1469- added types SYM_OPTYPE, SYM_CONSTTYPE, SYM_RHSTYPE, SYM_EXPRDATA
1470- removed class SCIPInterval
1471- removed enum SCIP_EXPROP
1472- removed union SCIP_EXPROPDATA, added SCIP_EXPRDATA
1473- removed struct SCIP_EXPRTREE, use SCIP_EXPR instead
1474- removed structs SCIP_QUADELEM, SCIP_EXPRDATA_QUADRATIC, SCIP_EXPRDATA_MONOMIAL, SCIP_EXPRDATA_POLYNOMIAL, SCIP_EXPRDATA_USER
1475- removed structs SCIP_EXPRGRAPHNODE, SCIP_EXPRGRAPH
1476- removed type SCIP_EXPRBOUNDSTATUS
1477- removed struct SCIP_USEREXPRDATA
1478- added enum SCIP_MONOTONE
1479- added structs SCIP_EXPRHDLR, SCIP_EXPRHDLRDATA
1480- added union SCIP_EXPRITER_USERDATA
1481- added enum SCIP_EXPRITER_TYPE
1482- added structs SCIP_EXPRITERDATA, SCIP_EXPRITER
1483- added type SCIP_EXPRPRINT_WHAT, struct SCIP_EXPRPRINTDATA
1484- removed enum SCIP_BIVAR_CONVEXITY
1485- removed structs SCIP_QUADVAREVENTDATA, SCIP_QUADVARTERM, SCIP_BILINTERM
1486- added structs SCIP_CONSNONLINEAR_AUXEXPR, SCIP_CONSNONLINEAR_BILINTERM
1487- added type SCIP_NLHDLR_METHOD
1488- added structs SCIP_NLHDLR, SCIP_NLHDLRDATA, SCIP_NLHDLREXPRDATA
1489- enum SCIP_NLPPARAM has been changed to a struct that holds values of parameters for an NLP solve
1490- removed SCIP_NLPPAR_OPTFILE/optfile from SCIP_NLPPARAM
1491- added SCIP_NLPTERMSTAT_INTERRUPT to SCIP_NLPTERMSTAT enum; returned from NLP solver if SCIPinterruptSolve() has been called
1492- renamed SCIP_NLPTERMSTAT_TILIM to SCIP_NLPTERMSTAT_TIMELIMIT
1493- renamed SCIP_NLPTERMSTAT_ITLIM to SCIP_NLPTERMSTAT_ITERLIMIT
1494- renamed SCIP_NLPTERMSTAT_LOBJLIM to SCIP_NLPTERMSTAT_LOBJLIMIT
1495- renamed SCIP_NLPTERMSTAT_NUMERR to SCIP_NLPTERMSTAT_NUMERICERROR
1496- renamed SCIP_NLPTERMSTAT_EVALERR to SCIP_NLPTERMSTAT_EVALERROR
1497- renamed SCIP_NLPTERMSTAT_MEMERR to SCIP_NLPTERMSTAT_OUTOFMEMORY
1498- renamed SCIP_NLPTERMSTAT_LICERR to SCIP_NLPTERMSTAT_LICENSEERROR
1499- added evaltime to SCIP_NLPSTATISTICS
1500- added structs SCIP_CUTSEL, SCIP_CUTSELDATA
1505- interfaces/gams/∗
1506- interfaces/ampl/∗
1508- src/scip/cons_bivariate.{c,h}
1509- src/scip/pub_misc_nonlinear.h
1510- src/scip/misc_nonlinear.c
1511- src/scip/scip_nonlinear.{c,h}
1512- src/scip/sepa_strongcg.{h|c}
1517- added cons/linear/nonlinupgd.c
1518- added cons/nonlinear/addcons.c
1519- added cons/nonlinear/bilinhash.c
1520- added cons/nonlinear/check.c
1521- added cons/nonlinear/copy.c
1522- added cons/nonlinear/create_nlrow.c
1523- added cons/nonlinear/curvature.c
1524- added cons/nonlinear/glbconss.c
1525- added cons/nonlinear/hessian.c
1526- added cons/nonlinear/locks.c
1527- added cons/nonlinear/nlhdlr.c
1528- added cons/nonlinear/nlhdlr_bilinear.c
1529- added cons/nonlinear/nlhdlr_concave.c
1530- added cons/nonlinear/nlhdlr_convex.c
1531- added cons/nonlinear/nlhdlr_perspective.c
1532- added cons/nonlinear/nlhdlr_quadratic.c
1533- added cons/nonlinear/nlhdlr_quotient.c
1534- added cons/nonlinear/nlhdlr_soc.c
1535- added cons/nonlinear/parse.c
1536- added cons/nonlinear/presolve.c
1537- added cons/nonlinear/propagate.c
1538- added cons/nonlinear/readers.c
1539- added cons/nonlinear/reformbinprods.c
1540- added cons/nonlinear/repair.c
1541- added cons/nonlinear/transform.c
1542- added cons/nonlinear/vertexpolyhedral.c
1543- removed cons/nonlinear/getCoeffsAndConstantFromLinearExpr.c
1544- removed cons/soc/upgrade.c
1545- added expr/abs/estimation.c
1546- added expr/commonsubexprs.c
1547- added expr/compare.c
1549- added expr/cos/cos.c
1550- added expr/cos/estimation.c
1551- added expr/curvature.c
1552- added expr/derivative.c
1553- added expr/entropy/entropy.c
1554- added expr/entropy/estimation.c
1556- added expr/exp/estimation.c
1558- added expr/getvarexprs.c
1560- added expr/hessian.c
1561- added expr/integrality.c
1562- added expr/iterator.c
1563- added expr/log/estimation.c
1564- added expr/monotonicity.c
1566- added expr/pow/estimation.c
1567- added expr/pow/pow.c
1568- added expr/product/estimation.c
1570- added expr/simplify.c
1571- added expr/sin/estimation.c
1572- added expr/sin/sin.c
1573- added expr/sum/estimation.c
1574- added nlpi/exprinterpret.c
1575- speedup test nlpi:solveQP in nlpi/nlpi.c
1576- added test projection:transitivity in prob/obbt.c
1578- added test intervalarith:sincos in scip/intervalarith.c
1580- added sepa/rlt/cuts.c
1581- added sepa/rlt/product_detection.c
1582- added sepa/rlt/separation.c
1583- added tests test_compute_symmetry:expr{1,2,3,4} in symmetry/compute.c
1588- the separate NLPI library has been integrated into the main SCIP library;
1589 uses of NLPILIBFILE or NLPILIBSRC in Makefiles that use make/make.project
1594- replace flag PARASCIP by THREADSAFE
1595- option AMPL is now ON by default
1596- add -D_XOPEN_SOURCE=600 cflag for compilation on systems other than windows
1597- add compile options directly instead of modifying CMAKE_C_FLAGS and CMAKE_CXX_FLAGS
1601- prefix PKG_CONFIG_PATH with Ipopt's pkgconfig dir instead of postfixing
1602- replace flag PARASCIP by THREADSAFE
1603- flag AMPL is now true by default
1604- libscip has been renamed to libscipbase and libscipsolver has been renamed to libscip
1605 in order to have the same library names for makefiles and cmake. For downward
1606 compatibility libscipsolver still exists (as a link).
1611- fixed handling of multi-aggregation in cons_symresack and cons_orbisack
1612- SCIPgetLowerbound() now consistently returns infinity when status is infeasible
1613- improved the likelihood that a solution that satisfies the nonlinear constraints in the transformed (presolved) problem is also feasible for the original problem
1614- worked around a problem with derivatives of pow at 0 with non-integer exponents in CppAD
1615- fixed that setting of feasiblity and optimiality tolerance for NLP relaxation was overwritten with defaults when solving NLP
1616- fixed variance computation in t-value computation in hypothesis testing of reliability branching
1617- fixed potential overflow in cuts.c:evaluateLiftingFunctionKnapsack()
1618- do not transfer dual reductions to main SCIP in sepa_rapidlearning if strong dual reductions are forbidden
1619- fixed a bug in cons_setppc.c:removeDoubleAndSingletonsAndPerformDualpresolve() which led to wrong variable aggregations
1620- added missing redundancy check to coefficient tightening routine in cons_varbound that led to wrong variable locks
1621- added a check of numerics to avoid wrong reductions in cons_linear.c:simplifyInequalities()
1622- fixed a bug in cons_logicor.c regarding fixed variables that were not removed
1623- presol_milp.c handles variable fixings, suggested by PaPILO, more carefully to cover all cases that can appear
1624- fixed several reproducability bugs that led to different solving paths across multiple runs with one SCIP environment
1625- fixed check of limits/absgap, which was incorrectly applied to the scaled objective of the transformed problem
1630- in LP, use absolute instead of relative tolerances to check whether solutions from LP solver are primal feasible
1631- when a restart occurs, SCIP now asserts (during EXITSOLVE) that all relaxation-only variables are unlocked and
1632 only captured by the transformed problem.
1633- Avoid redundant calls to LP solver when LP is already flushed and solved
1634- In SCIPdebugMsg(), SCIPsetDebugMsg(), SCIPstatDebugMsg() strip directory from filename.
1635- Recompute activity of rows when checking LP solutions instead of trusting the value given by the LP solver
1636- The define NPARASCIP has been replaced by SCIP_THREADSAFE
1637- Parameters are not reset to their default values before activating an emphasis setting; this now allows to combine
1638 different emphasis settings.
1639- If a lazy bound is set to a value that is tighter than the current global bound, then the global bound is now tightened accordingly.
1641@page RN70 Release notes for SCIP 7.0
1643@section RN703 SCIP 7.0.3
1644*************************
1649### New API functions
1651- added function SCIPwithDebugSol() to determine whether SCIP was compiled with WITH_DEBUG_SOLUTION
1653- New function SCIPcreateConsBounddisjunctionRedundant() and SCIPcreateConsBasicBounddisjunctionRedundant() that allow
1654 the input to contain redundant literals.
1656### Changed API functions
1658- added __attribute__((format(printf,,,))) to variadic SCIP message printing functions;
1659 this enables warnings about mismatches between format string and variadic function arguments if using GCC.
1661### Interfaces to external software
1663- removed MATLAB interface from interfaces/matlab
1668- Compilation will now also work in a raw tarball of the scip git repository
1672- Make find_package more verbose and require packages to be found. Now enabled packages that are not found result in an error.
1677- Fixed numerical bug by creating and checking the empty solution when problem vanishes in presolving.
1678- Fixed several bugs in reoptimization.
1679- Fixed bug in cons_bounddisjunction in which a constraint leads to a cutoff.
1680- Fixed bug in reoptimization by avoiding redundant literals for bound disjunctions.
1681- Replace wrong usage of CMAKE_BINARY_DIR by PROJECT_BINARY_DIR in CMake system
1682- Fixed lpi_glop to use absl flag instead of GFlags
1683- Fixed invalid initialization of limits/softtime parameter in cons_components
1684- Fixed MIN macro not defined in some cases.
1685- Safeguard some API methods for querying solving statistics against segmentation faults after SCIPpresolve()
1686- Fixed unfreed solution in concurrent solving
1687- Make sure that logicor constraints are enforced/separated if genlogicor is true in cons_indicator.
1688 Thus, do not change constraints/logicor/sepafreq anymore, but output warning.
1689- Fixed assert that assumed infeasibility cannot occur in presol_boundshift.
1690- Fixed sign bug during creation of conflict constraints with almost zero left-hand side.
1691- Disabled call of conflict handler for conflict sets that contain relaxation-only variables.
1692- Fixed bug in cons_symresack by initializing all constraint data in constrans
1693- Avoid allowing the upgrade of linear constraints corresponding to indicators in propagation of nodes.
1694- Fixed bug in computing lex. min/max faces in dynamic orbitope propagation.
1695- Limit vbounds propagator to one sweep through all bounds per call in order to avoid an infinite loop.
1696- Fixed mismatches between formatter strings and arguments in calls to SCIP message printing functions.
1701- To avoid performance variablity during reoptimization, the active constraints are now stored in the same order as in the
1703- Added workaround for bug in MSVS 2019 when compiling CppAD source.
1704- The original order of variables is now only restored after presolve if `randomization/permutevars` is set to FALSE.
1706@section RN702 SCIP 7.0.2
1707*************************
1712- Extended check for valid variable and constraint names in PIP writer.
1713- Indicator constraints now write the name of the linear constraint in CIP format. This avoids a complicated
1714 name matching during parsing. The old format is still supported.
1715- The objective scale and offset are now taken into account when reading/writing problems in lp/mps/fzn/pip format.
1716 This often changes the behavior when writing transformed problems.
1718Performance improvements
1719------------------------
1721Examples and applications
1722-------------------------
1724- Add c++ Sudoku example
1729### Deleted and changed API methods
1731- deprecated SCIPsetParam(); use SCIPsetIntParam(), SCIPsetRealParam(), etc, instead
1733### New API functions
1735- new function SCIPcolGetVarProbindex() for accessing the probindex of a variable corresponding to a column
1736- added new sorting functions SCIPsortPtrRealRealBoolBool()
1741- Fixed a sign bug occuring for some cases in the computation of the directed cutoff distance
1742- Fixed overflow in inference information of cumulative constraint handler
1743- Fixed problem with propfreq == 0 in cons_linear.c
1744- Fixed aggregation heuristic in sepa_aggregation.c to not use local rows when that is requested nor modifiable rows
1745- Fixed problem with incompatibility of symmetry handling in Benders decomposition
1746- Fixed parsing of small number in CIP format of nonlinear constraint
1747- Fixed problem in upgrading full orbitopes to partitioning orbitopes
1748- Fixed treatment of negated variables in parsing orbitope constraints
1749- Fixed potential indexing error in prop_vbounds.c
1750- Fixed bug in writing fzn format
1751- Revert to old parameter value when parameter change is rejected in PARAMCHGD callback
1752- Fixed order of linker flags when building AMPL interface with cmake system.
1753- Fixed bug with ofsymcomptiming == 0: now symmetry is actually computed
1754- Improved separation for SOC constraint with multiaggregated variable on right-hand-side.
1755- Fixed bug in presol_boundshift: do not shift non-active variables
1756- Fixed bug in domain propagation for SOC constraints with negative coefficient for variable on right-hand-side.
1757- Fixed bug with multi-aggregated integer variables in cons_xor.
1758- Fixed bug with changed number of variables in storing relaxation solution in probing/diving.
1759- Fixed issues with scip statistics
1760- Fixed issue with multi-aggregated variables
1761- Fixed issue in with buffer memory in cons_cumulative
1763@section RN701 SCIP 7.0.1
1764*************************
1771- Fixed cmake module for Ipopt to support Ipopt 3.13
1772- Added cmake variable BLISS_LIBRARY_DIR to pass a bliss library
1773- Added warning to require minimal GCC version 4.8
1774- Renamed FindCriterion cmake findmodule to FindCRITERION
1778- Updated make/make.project for macOS
1779- Add SANITZERFLAGS (only OPT=dbg) to LDFLAGS also if SHARED=true (and rename SANITZERFLAGS to SANITIZERFLAGS)
1780- Fixed GCC version check in make/make.linux.gnu.dbg
1785- Fixed handling of constant term in quadratic objective of pip-reader
1786- Fixed incorrect value string for parameter estimation/completiontype
1787- Fixed initialization of first LP which led to wrong output about LPs not resolved correctly
1788- Fixed bug in SCIPcutpoolClear() function not clearing internal datastructures properly
1789- Fixed inability to set a value in a solution if it was within epsilon to the current value
1790- Fixed problems for linking optimized code with debug library of SCIP (and vice versa) by moving debug-only members
1791 to end of SCIP structs
1796- Variables that are marked as relaxation-only are no longer checked against debug solutions if
1797 they are captured by the transformed problem only.
1799@section RN700 SCIP 7.0.0
1800*************************
1805- Using the parameter "propagating/symmetry/recomputerestart" one can now decide to recompute symmetries after a
1806 restart or not. Previously one could just turn off symmetry computation after a restart. If orbital fixing
1807 has found a reduction before the restart occured, symmetries have to be updated to ensure correctness.
1808 To this end, the user can decide via "propagating/symmetry/disableofrestart" whether orbital fixing is disabled or
1809 whether symmetries are recomputed.
1811- extended relaxators statistics in solve statistics about information on number of cutoffs, improved bounds, etc.
1813- extends SMPS file reader for the stochastic information, the sto files, to read a lower bound for the discrete
1814 scenarios. The lower bound is used when creating the auxiliary variables for Benders' decomposition.
1816- extended Benders framework to solve NLPs and generate optimality and feasibility cuts from their solution
1817 when the subproblem is convex nonlinear.
1819- extended Benders framework to create copies of Benders decompositions that can be used in a multithreading environment
1821- additional functionality has been added to enable the transfer of Benders' decomposition cuts between different SCIP
1822 instances, e.g., when used in UG
1824- LP rows (SCIP_ROW) can now store pointer to a constraint from which the row originates
1826- Trust region, a new LNS heuristic, has been added to SCIP as both a standalone primal heuristic heur_trustregion.c
1827 and as a neighborhood inside of Adaptive Large Neighborhood Search (heur_alns.c). This heuristic is designed to improve the
1828 heuristic performance of the Benders' decomposition algorithm. It builds upon the successful trust region approaches
1829 applied to Benders' decomposition.
1831- Modularity of symmetry handling has been increased. It is now possible to use orbitopes (i.e., polyhedral symmetry
1832 handling techniques) and orbital fixing on the same instance.
1834- cut strengthening enabled within the Benders' decomposition framework. This uses a mix of the Improved Magnanti-Wong
1835 method and Kelly's method. The cut strengthening is enabled by setting the paramemter
1836 "benders/<bendersname>/cutstrengthenenabled" to TRUE. The parameters "cutstrengthenmult", "noimprovelimit" and
1837 "corepointperturb" control the behavior of the cut strengthening method. Additionally, the parameter
1838 "cutstrengthenintpoint" allows the user to specify the solution that is used to initialize the core point. The options
1839 are the first LP solution, the first integer feasible solution, a relative interior point, a solution vector of all
1840 ones and a solution vector of all zeros. Also, the core point can be reinitialized after each update to the incumbent
1843- added option to adjust weights of different scores in relpscost (hybrid) branching rule based on degeneracy information
1844 and skip strong branching for very high degeneracy rates
1846- added new SCIP_DECOMP* object to store user decompositions. The user can specify one or several decompositions by assigning variable
1847 and/or constraint labels either through the API or by reading a file in DEC format (which is one of the formats that GCG writes).
1848 This format specifies constraint labels, variable labels are inferred from that. The decomposition is transformed after presolving.
1849- statistics regarding the number of blocks, the largest and smallest blocks, the border, and the constraint graph are printed for the original decomposition,
1850 and for each decomposition after presolving.
1851- the decomposition can be used as initial decomposition for the Benders functionality of SCIP.
1852- new subsection "How to provide a problem decomposition" in the SCIP documentation
1854- GINS heuristic can make use of a user-provided decomposition labels in two ways:
1855 1. by selecting a block of variables that maximizes the potential, and randomly selecting a start variable for the neighborhood and/or
1856 2. by selecting an interval of consecutive blocks as neighborhood, until fixing rate is reached. In this case, no variable is randomly selected.
1858- extend potential parameter of GINS to allow computation based on local LP solution, as well
1860- new primal heuristic Adaptive Diving, which registers all publicly available dive sets from other diving heuristics.
1861 At each call, it selects one of the available dive sets based on the user's score type choice (heuristics/adaptivediving/scoretype).
1862 During the solution process, the heuristics learns online which divesets reach the best score, and executes them more frequently.
1863 The statistic output for Diving heuristics has been extended to incorporate the statistics of each dive set within Adaptive diving.
1865- Added new penalty alternating direction method (PADM) primal heuristic that splits the problem into several sub-SCIPs
1866 according to a user-provided decomposition. The sub-SCIPs are solved on an alternating basis until a feasible solution of
1867 the original problem is found.
1869- Symmetry handling constraints (cons_orbisack, cons_orbitope, cons_symresack) now have an additional parameter to encode
1870 whether they are model constraints, i.e., define the problem, or whether they are only present to handle symmetries.
1872- The symmetry code has been completely restructured. The presolvers presol_symbreak and presol_symmetry as well as the propagator
1873 prop_orbitalfixing have been merged into the single propagator prop_symmetry to avoid storing the same information
1874 multiple times. This propagator is now responsible for adding symmetry handling constraints as well as activating orbital
1875 fixing. Moreover, the new file symmetry.c contains general functions for symmetry computations like orbit computations.
1877- Variables can now be marked as "relaxation-only". This flag should be used to introduce new variables that are required
1878 to define a relaxation, but that are not part of any checked constraints. Essentially, these variables should only be used
1879 in the current SCIP solve and disregarded after a restart or in SCIP copies. Hence, these variables are not copied by SCIPcopy and
1880 SCIPgetVarCopy, they are currently not used in conflict constraints, and cuts involving them are not upgraded to linear constraints.
1881 Relaxation-only variables cannot appear in the objective function.
1883- The OSiL reader now supports nonlinear expressions of type "signpower".
1885- Expressions of form abs(x)^p * x in a nonlinear constraint are now sometimes recognized and handled by abspower constraints.
1887- If polyhedral symmetry handling methods are used (cons_orbisack, cons_orbitope, cons_symresack), it is now possible to
1888 recompute symmetries if a restart occured.
1890- upgrade some more quadratic constraints to second-order cone constraints, that is,
1891 handle linear binary variables as if squared in simple upgrade and
1892 do not require bounds for variables that have a zero entry in the computed eigenvectors in the non-simple upgrade
1894- new variable event when changing the variable type
1896- It is no longer necessary to provide a SCIP pointer for the subproblem in SCIPaddBendersSubproblem if custom solving
1897 methods are defined. A NULL pointer can be supplied to SCIPaddBendersSubproblem. In this case, no internal Benders'
1898 cut generation methods can be used.
1900- Using the parameter "constraints/symresack/checkmonotonicity" one can now decide to upgrade to packing/partitioning
1901 symresacks even if the underlying permutation is not monotone.
1903- New branching rule `vanillafullstrong`, mostly for scientific purpose, with the following features:
1904 1) no cutoff or domain reduction: only branching;
1905 2) idempotent (optional): leave SCIP, as much as possible, in the same state before / after the strong branching calls
1906 - basically, do not update any statistic;
1907 3) donotbranch (optional): do no perform branching. So that the brancher can be called as an oracle only
1908 (on which variable would you branch ? But do not branch please);
1909 4) scoreall (optional): keep scoring variables, even if infeasibility is detected;
1910 5) collectscores (optional): store the candidate scores from the last call, which can then be retrieved by calling SCIPgetVanillafullstrongData();
1911 6) integralcands (optional): consider integral candidates for branching,
1912 i.e., get candidates from SCIPgetPseudoBranchCands() instead of SCIPgetLPBranchCands().
1914- If a reference value (misc/referencevalue) is given, the primal-reference and reference-dual integrals are calculated automatically and printed within the SCIP statistics.
1916- Locally valid cuts / rows are now considered for dual proof analysis when `conflict/uselocalrows` is set to TRUE.
1918- Linking variables in the linking constraint handler (cons_linking.{ch}) can now be integer or continuous. The coefficients of the binary variables are therefore now stored as SCIP_Real.
1920- To save memory, it is now possible to remove all variables from the internal symmetry data structures that are
1921 not affected by any symmetry.
1923- Allow to filter first variables from orbits and transfer pseudo cost information to variables in orbit
1925- Add integration of external MILP presolve library as a SCIP presolver plugin that runs on MILP problems
1927- Parallelisation can be used when applying Benders' decomposition. There are two different forms of parallelisation
1928 available. The first is applying Benders' decomposition within a parallel branch-and-bound. This is achieved through
1929 the integration with the UG framework. The second is the use of shared memory parallelisation for solving the Benders'
1930 decomposition subproblems. A priority queue has been added to help with load balancing.
1932- The Benders' decomposition framework can handle MINLPs. If a convex relaxation of the MINLP exists, then this is
1933 solved to generate optimality and feasibility cuts. The extensions to the framework are:
1934 - New generic solving methods to solve convex NLP subproblems.
1935 - Modification to benderscut_opt and benderscut_feas to enable the generation of cuts from convex NLPs.
1936 - Addition of benderscut_feasalt to generate feasibility cuts from an alternative subproblem that minimises the
1937 violation of infeasible problems.
1938 - Better handling of subproblem solution results
1940- Adds a feasibility phase to the Benders' decomposition subproblem solving methods. The feasibility phase adds slack
1941 variables to each of the constraints to ensure feasibility of the subproblem. A large coefficient is given to these
1942 slack variables in the objective function to penalise constraint violations. The coefficients are progressively
1943 increased until all slack variables take the value 0.0.
1945- Improved convexity check for Benders' decomposition subproblems. The constraints of the subproblem are now checked for
1946 convexity in the initialisation of the Benders' decomposition algorithm. This enables the solving of convex NLPs as
1947 Benders' decomposition subproblems.
1949- Benders' decomposition can be applied using decomposition supplied in the DEC format. To apply Benders' decomposition
1950 the parameters decomposition/benderslabels and decomposition/applybenders must be set to TRUE.
1952- new event handler event_estim.c/h that approximates search tree completion and estimates tree size
1953 to trigger restarts; many approximations of search tree completion and estimation, including WBE, SSG, and tree profile method
1954- new display column that reports approx. search tree completion during the search, and an overview in the statistics table
1955- added resources (script, tutorial, test data) to adapt tree size estimation to user instances.
1957- Orbital Fixing uses a list of variables that have been fixed globally since the computation of symmetries to filter
1958 symmetries. Previously, some plugins were disabled, which is not necessary anymore.
1960- A new presolver "dualsparsify" was added. It tries to combine columns (i.e. variables) to cancel nonzero coefficients in the constraint matrix.
1962- The presolver "tworowbnd" was implemented with better performance.
1964- To be able to calculate better bounds for the dual variables, the presolver "dualinfer" was extended by the ability to perform convex combinations of continuous columns.
1966- allow disabling of pricers during solving process
1968- added emphasis setting for numerically challenging instances
1970Performance improvements
1971------------------------
1973- Extended cut presolving by removing variables that been fixed at their bounds
1975- Improved branching point selection when branching on externals branching candidates. Instead of using exactly the
1976 LP solution, a point closer to the middle of the variables domain is chosen.
1978- Matrix presolvers that do not work on incomplete matrices now skip matrix creation if unsupported constraint types are detected.
1980- consLockBenders callback implemented to add down locks on the Benders' decomposition auxiliary variables and
1981 up and down locks per subproblem for all master problem variables. This allows the use of presolving and propagation
1982 with Benders' decomposition.
1984- improved performance of orbital fixing in several ways:
1985 store permutations in transposed form to improve cache efficency;
1986 reverse order to speed up filtering of permutations;
1987 handle variables globally fixed to 1 in list;
1988 use event handler to catch global fixings;
1989 speed up orbit computations;
1990 change handling of restarts;
1991 use only permutations that can contribute to a variable's orbit;
1993- allow rapid learning at local nodes
1995- allow to recompute cut without using fractional values for sepa_cgmip
1997- restrict the number of the clique table nonzeros relative to the number of problem nonzeros, which could be a performance bottleneck.
1999- variable fixings of LP face heuristic are now computed earlier; subproblem creation is skipped if not enough variables are fixed.
2001- Improved domcol presolver to not require a complete representation of all constraints in the matrix
2003- performance improvement of adaptive large neighborhood search heuristic on merely continuous problems. The heuristic
2004 stops if presolving in the sub-SCIP fixes less than 50 % of the current target fixing rate over all variables
2005 (including continuous).
2007- reduce memory usage in symmetry detection by a staggered allocation with decreasing overhead for larger instances
2009- improved full orbitope propagation using a static implementation or a dynamic reordering of orbitope rows by a global rank function
2011- improved detection of packing/partitioning orbitopes
2013- enable an in-tree restart if after a reasonable initialization, the estimated size of the remaining tree is large.
2016Examples and applications
2017-------------------------
2019- added methods to set and get hmin and hmax for optcumulative constraints
2024### New and changed callbacks
2026- new optional callback `SCIP_DECL_DIVESETAVAILABLE` to check preconditions for this dive set, e.g., if an incumbent solution is available,
2027 which is passed as new argument to SCIPcreateDiveset(). SCIPcreateDiveset() has another new parameter "ispublic".
2029- new callback `SCIP_DECL_CONSHDLRCOPY` and `SCIP_DECL_CONSCOPY` in cons_orbisack and cons_symresack
2031- new `idempotent` argument to SCIPgetVarStrongbranchInt() and SCIPgetVarStrongbranchFrac(),
2032 so that statistics are not updated during the call. Likewise, new `updatecol` and `updatestat` arguments to SCIPcolGetStrongbranch().
2034- callback `SCIP_DECL_CONSHDLRENFOLP` can now also return SCIP_SOLVELP as *result, which indicates to the SCIP core that the LP relaxation
2035 should be solved again because the primal feasibility tolerance of the LP has been tightened (using SCIPsetLPFeastol())
2037- extension of SCIP_PQUEUE by a new callback SCIP_DECL_PQUEUEELEMCHGPOS to catch swaps as well as functionality to delete arbitrary elements from the priority queue.
2039### Deleted and changed API methods
2042 + now for all lp interfaces consistent requirements on SCIP_LPPAR:
2043 LPITLIM and BARRIERCONVTOL positive or zero; FEASTOL, DUALFEASTOL, LPTILIM strictly positive
2044 + now projecting SCIP_LPPAR values on feasible values for each lp interface
2045 + add interface to Glop
2046 + fixed mapping between scaling parameter values in Gurobi LPI lpi_grb
2048 + removed method SCIPseparateCoversOrbisack() in cons_orbisack.h since the orbitope constraint
2049 handler has its own implementation of this routine with advanced features now
2050 + renamed SCIPgetGeneratorsSymmetry() to SCIPgetSymmetry() and removed two arguments
2051 + extended method SCIPgetSymmetry(): It is possible to access both the original and
2052 transposed permutations matrix as well as the (independent symmetry) components of a permutation group now.
2053 + arguments of functions SCIPcreateConsOrbisack(), SCIPcreateConsBasicOrbisack(), SCIPcreateConsOrbitope(),
2054 SCIPcreateConsBasicOrbitope(), SCIPcreateConsSymresack(), SCIPcreateConsBasicSymresack(), and SCIPcreateSymbreakCons() extended
2055 by "ismodelcons" to encode whether the constraints are model constraints or not
2056 + the function SCIPgetSymmetry() no longer accepts the parameter recompute, but has parameter permvarmap as new input
2057 + removed SCIPgetPermvarsObjSymmetry(), SCIPsetSymmetryComponentblocked(), SCIPgetSymmetryComponentblocked(),
2058 SCIPgetSyminfoGloballyFixedVars(), SCIPcomputeGroupOrbitsSymbreak, SCIPincludePresolSymmetry(),SCIPincludePresolSymbreak(),
2059 and SCIPincludePropOrbitalfixing()
2060 + add function SCIPcomputeOrbitsComponentsSym() to compute orbits without filtering permutations and indices of orbits for each variable
2061- SCIPallowObjProp() and SCIPallowDualReds() are deprecated and replaced by SCIPallowWeakDualReds() and SCIPallowStrongDualReds(), respectively
2062- Benders' decomposition
2063 + changed SCIPstoreBenderscutCut() in scip_benders.c to SCIPstoreBendersCut(). Where this function used to take a
2064 SCIP_BENDERSCUT pointer, it now accepts a SCIP_BENDERS pointer.
2065 + the functions SCIPsolveBendersSubproblem() no longer accepts the parameter type. The type is not a necessary
2066 argument for the subproblem solving method.
2067 + arguments of functions SCIPbendersSolveSubproblemLP(), SCIPbendersSolveSubproblemCIP(), and SCIPbendersOnlyCheckConvexRelax() changed
2068 - removed SCIPbenderscutGetNAddedCuts() and SCIPbenderscutGetAddedCutData()
2071### New API functions
2073- new argument "onlyifcomplete" in SCIPmatrixCreate() to skip matrix creation right after detecting unsupported constraint types
2074 and new arguments to count statistics when doing a clean-up of inactive variables in the constraints before building the matrix
2076- new argument "threadsafe" in SCIPcopy(), SCIPcopyConsCompression(), SCIPcopyOrig(), SCIPcopyOrigConsCompression and
2077 SCIPcopyBenders(). This argument must only be set to TRUE if the source and target SCIP instances are to be solved in
2078 parallel. Setting this argument to TRUE has a performance cost.
2080- new argument "append" in SCIPsetModifiedDefaultSettingsIpopt()
2081- functions SCIPclearRelaxSolVals(), SCIPsetRelaxSolVal(), SCIPsetRelaxSolVals(), SCIPsetRelaxSolValsSol(), and SCIPmarkRelaxSolValid()
2082 receive an additional argument "relax" to store the relaxation handler as creator of the relaxation solution.
2085 - SCIProwGetOriginCons() now returns a SCIP_CONS* instead of a SCIP_CONSHDLR*, use SCIProwGetOriginConshdlr() for the previous behavior
2086 - SCIPcreateRowCons() and SCIPcreateEmptyRowCons() now expect a SCIP_CONS* instead of a SCIP_CONSHDLR*,
2087 use SCIPcreateRowConshdlr() and SCIPcreateEmptyRowConshdlr(), respectively, for the previous behavior
2088 - deprecated SCIPlpfeastol() and SCIPchgLpfeastol(), use SCIPgetLPFeastol() and SCIPsetLPFeastol()
2090- new parameter "divecontext" for every method that queries statistics for a diveset. The context can be used to distinguish between the dive set
2091 as single (standalone) heuristic or within Adaptive Diving.
2092- new parameters "divecontext" and "iterlim" to SCIPperformGenericDivingAlgorithm() to control in which context (single,adaptive) statistics are updated.
2094- SCIPcopyVars, SCIPcopy, SCIPcopyConsCompression, and SCIPgetVarCopy do not copy variables that are marked as relaxation-only,
2095 thus it cannot be assumed anymore that each active variable from the master SCIP also has a counterpart in the copy.
2096 SCIPcopy, SCIPcopyConsCompression, and SCIPcopyConss can now return *valid=TRUE if some non-checked and non-enforced constraints were not copied, e.g.,
2097 because they involved relaxation-only variables. Thus, a copy is already regarded as valid if all checked or enforced constraints were copied successfully.
2099- linking constraint handler:
2100 - changed type of vals argument from int* to SCIP_Real* in SCIPcreateConsLinking() and SCIPcreateConsBasicLinking()
2101 - SCIPgetIntvarLinking() has been renamed to SCIPgetLinkvarLinking().
2102 - changed return value of SCIPgetValsLinking() from int* to SCIP_Real*.
2103 - new method SCIPgetBinvarsDataLinking().
2105- SCIPbendersCheckSubproblemOptimality() now returns a boolean indicating whether the subproblem is optimal or not.
2106 Previously this result was returned through a parameter. The change was required to facilitate the integration with
2109- deleted SCIPcombineTwoInt(), SCIPcombineThreeInt(), SCIPcombineFourInt(); use the appropriate SCIPhashTwo(), ..., SCIPhashSeven() method instead
2111- SCIPsetupBendersSubproblem takes a parameter of the enforcement type.
2113- SCIPcreateNlpiProb takes a hashmap to store the map between the nlrows and the index in the nlrow array.
2115### New API functions
2117- SCIPallowWeakDualReds() and SCIPallowStrongDualReds() replace the deprecated SCIPallowObjProp() and SCIPallowDualReds(), respectively
2118- methods have been added to facilitate the transfer of Benders' decomposition cuts between solvers in UG. These include
2119 SCIPapplyBendersStoredCuts(), SCIPbendersGetNStoredCuts(), SCIPbendersGetStoredCutData() and
2120 SCIPbendersGetStoredCutOrigData().
2121- added SCIPisConvexAbspower()
2122- new functions SCIPsolGetType(), SCIPsolGetRelax(), SCIPsolSetRelax(), SCIPsolSetLPRelaxation(), SCIPsolSetStrongbranch(),
2123 SCIPsolSetPseudo to set or query the new type attribute of a primal solution. The type attribute gives information
2124 about the origin of the solution, ie, whether it was created by a relaxation handler,
2125 by the LP relaxation, by strong branching, by the current pseudo solution, or by a primal heuristic.
2126 The meaning of the argument 'heur' in all creation methods for primal solutions such as SCIPcreateSol() stays unchanged.
2127- added SCIProwGetOriginConshdlr(), SCIPcreateRowConshdlr(), SCIPcreateEmptyRowConshdlr()
2128- new API functions SCIPsetCommonSubscipParams(), SCIPtranslateSubSol(), and SCIPtranslateSubSols() shared by several Large Neighborhood Search heuristics.
2129- new API function SCIPgetLPDualDegeneracy() to get two measures for the dual degeneracy of the current LP
2130- new API functions SCIPdivesetIsAvailable() to check preconditions of a dive set and SCIPdivesetIsPublic() to check if the dive set can be used
2131 by other primal heuristics.
2132- new API functions SCIPcomputeOrbitsSym(), SCIPcomputeOrbitsFilterSym(), SCIPgetPropertiesPerm(), SCIPdetermineBinvarAffectedSym(),
2133 SCIPdetermineNVarsAffectedSym(), SCIPcomputeComponentsSym(), and SCIPextendSubOrbitope(), SCIPgenerateOrbitopeVarsMatrix() for symmetry computations
2134- new API functions SCIPvarIsRelaxationOnly() and SCIPvarMarkRelaxationOnly() to query and set, resp., whether a variable is marked as relaxation-only
2135- new API functions SCIPconshdlrGetNUpdateConss() and SCIPconshdlrGetUpdateConss(), for expert users only
2136- new API function SCIPgetNConflictDualproofsApplied()
2137- new API functions SCIPeventGetOldtype() and SCIPeventGetNewtype() for the new event when changing the variable type
2138- new API function SCIPisConvexConsQuadratic() to check whether a quadratic constraint is convex when a given set of variables would be fixed
2139- new API functions SCIPgetLPFeastol(), SCIPsetLPFeastol(), and SCIPresetLPFeastol() to get, set, and reset (to the default), respectively, the primal
2140 feasibility tolerance for the LP relaxation
2141- new API functions SCIPcleanupConss{Linear,Varbound,Setppc,Logicor,Knapsack}() to clean up inactive variables from those types of linear constraints
2142- new API function SCIPsetBendersSubproblemComp() used to add a custom comparison method for ordering the Benders'
2143 decomposition subproblem solves. The comparison method is used to help with load balancing.
2144- new API function SCIPgetRowObjParallelism to get the objective parallelism of a row
2145- new API function SCIPcolGetAge to get the age of a column
2146- added SCIPhashThree(), SCIPhashFive(), SCIPhashSix(), and SCIPhashSeven() that complement SCIPhashTwo(), SCIPhashFour() to combine 32bit integers to
2148- new API function SCIPgenerateAndApplyBendersOptCut is used to generate a Benders' optimality cut using the dual
2149 solutions. This function can be supplied vectors for the primal and dual solution for generating an optimality cut.
2150 This avoids the need for a SCIP instance to solve the Benders' decomposition subproblem and generating cuts.
2151- new API function SCIPconsAddCoef used for adding a coefficient to a linear-type constraint.
2152- new API functions SCIPconsNonlinearGetRhs, SCIPconsNonlinearGetLhs and SCIPconsNonlinearAddLinearCoef for getting the
2153 RHS and LHS from a nonlinear-type constraint and adding a linear coefficient to the constraint.
2154- new API function SCIPbendersSolSlackVarsActive for checking whether any slack variables from the feasibility phase are
2155 active in the subproblem solution.
2156- new API functions SCIPbendersSetSubproblemType and SCIPbendersGetSubproblemType sets and gets the subproblem type.
2158 - Convex constraints with continuous variables
2159 - Convex constraints with discrete variables
2160 - Non-convex constraints with continuous variables
2161 - Non-convex constraints with discrete variables
2162- new API functions SCIPbendersSetSubproblemIsNonlinear() and SCIPbendersSubproblemIsNonlinear() for setting and
2163 identifying whether the Benders' decomposition subproblems contain nonlinear constraints. Similarly, the functions
2164 SCIPbendersSetMasterIsNonlinear() and SCIPbendersMasterIsNonlinear() sets and identifies whether the Benders'
2165 decomposition master problem contains nonlinear constraints.
2166- new API function SCIPapplyBendersDecomposition for applying Benders' decomposition given a decomposition in the DEC
2168- new API function SCIPwasNodeLastBranchParent to query if a node has been the parent of the most recent branching in the tree
2169- new API functions SCIPtreemodelInit(), SCIPtreemodelFree(), SCIPtreemodelIsEnabled(), SCIPtreemodelSelectCandidate() related to the new
2170 treemodel way of comparing branching candidates. These functions are only currently used for reliability pscost branching, but they can be used
2171 in other parts of the code.
2172- New function SCIPcalcChildEstimateIncrease() to compute the increase in the child estimation
2173- new API functions SCIPisOrbitalfixingEnabled() and SCIPgetSymmetryNGenerators() to check whether orbital fixing is
2174 enabled and to get the number of generators of the current symmetry group, respectively
2175- new API function SCIPdelNlRow() to remove a row from the NLP
2179- new event type SCIP_EVENTTYPE_NODEDELETE to react on nodes that are about to be deleted from the tree
2181### Changed parameters
2183- renamed parameter "propagating/orbitalfixing/enableafterrestart" to ".../symmetry/recomputerestart"
2184- Parameter "misc/allowdualreds" is now called "misc/allowstrongdualreds"
2185- Parameter "misc/allowobjprop" is now called "misc/allowweakdualreds"
2186- changed default values of propagation (new value: 1, old value: 5) and separation frequency (new value: -1, old value: 5) in cons_orbitope.c
2187- all primal heuristics that use sub-SCIPs are disabled within the heuristics fast emphasis setting
2188- deleted parameter heuristics/localbranching/useuct, use heuristics/useuctsubscip instead
2189- changed default value of "presolving/symbreak/detectorbitopes" (new value: TRUE, old value: FALSE)
2190- extended range of "misc/usesymmetry" (new range: [0,3], old range: [0,2])
2191- deleted parameter "constraints/orbisack/checkalwaysfeas"
2192- deleted parameter "constraints/orbitope/checkalwaysfeas"
2193- deleted parameter "constraints/symresack/checkalwaysfeas"
2194- deleted parameter "presolving/symmetry/maxgenerators"
2195- deleted parameter "presolving/symmetry/checksymmetries"
2196- deleted parameter "presolving/symmetry/displaynorbitvars"
2197- deleted parameter "presolving/symbreak/conssaddlp"
2198- deleted parameter "presolving/symbreak/addsymresacks"
2199- deleted parameter "presolving/symbreak/computeorbits"
2200- deleted parameter "presolving/symbreak/detectorbitopes"
2201- deleted parameter "presolving/symbreak/addconsstiming"
2202- deleted parameter "propagating/orbitalfixing/symcomptiming"
2203- deleted parameter "propagating/orbitalfixing/performpresolving"
2204- deleted parameter "propagating/orbitalfixing/recomputerestart"
2205- changed default value of "heuristics/coefdiving/freq" (old: 10, new: -1)
2206- changed default value of "heuristics/conflictdiving/freq" (old: -1, new: 10)
2207- changed default value of "heuristics/conflictdiving/lockweight" (old: 1.0, new: 0.75)
2208- replaced parameter "numerics/lpfeastol" by "numerics/lpfeastolfactor" to specify which factor should be applied to the SCIP feasibility
2209 tolerance to initialize the primal feasibility tolerance of the LP solver
2210- enabling aggressive presolving now activates all available presolving plugins,
2211 and decreases the presolving/restartfac parameter correctly with respect to default.
2212- changed default value of heuristics/rins/nodesquot to 0.3 (was 0.1), to compensate
2213 the removal of a hard coded factor of 3.0 in the code without affecting the default behavior
2214 of the RINS heuristic.
2215- changed default value of "constraints/quadratic/empathy4and" (old: 0, new: 2)
2216- changed default value of "propagating/redcost/useimplics" (old: TRUE, new: FALSE)
2220- the possibility to define the Benders' decomposition auxiliary variables as implicit integer is provided. This
2221 behavior is controlled with an additional parameter in the Benders' decomposition framework.
2222- added parameter benders/<bendersname>/cutcheck to enable the generation of Benders' decomposition cuts during solution
2224- constraints/orbitope/usedynamicprop: the possibility to propagate orbitope constraints by reordering the rows based on the
2225 branching strategy is provided (only possible for non-model constraints)
2227- new parameters heuristics/shiftandpropagate/minfixingratelp and heuristics/locks/minfixingratelp to stop the
2228 heuristics after propagating integer fixings if no sufficient fixing of the all variables (including continuous)
2229 could be achieved. These parameters help to avoid solving LP's that are comparable in hardness to the main root LP.
2231- Added parameters branching/midpull and branching/midpullreldomtrig to control by how much to move
2232 the branching point for an external branching candidate closer to the middle of the candidates domain. The
2233 default of 0.75 and 0.5, respectively, uses a point that is 75*alpha% closer to the middle of the domain, where
2234 alpha is the relative width of the candidates domain (width of local domain divided by width of global domain),
2235 if the latter is below 0.5, and alpha=1.0 otherwise. That is, with the default settings, a branching point is
2236 chosen closer to the middle of the candidates domain if the variables local domain is still similar to its
2237 global domain, but is chosen closer to the LP solution if the local domain is much smaller than the global
2240- Added parameter lp/minmarkowitz to set the Markowitz stability threshold (range 0.0001 to 0.9999).
2241 High values sacrifice performance for stability.
2243- Added parameters benders/<bendersname>/lnsmaxcalls and benders/<bendersname>/lnsmaxcallsroot to the Benders'
2244 decomposition core. These parameters limit the number of Benders' decomposition subproblem checks, for the full
2245 branch-and-bound tree and root node respective, when solving the auxiliary problem of LNS hueristics. These
2246 parameters only have effect if the lnscheck parameter is set to TRUE.
2248- Added parameter cons/linear/maxmultaggrquot to limit the maximum coefficient dynamism of an equation on which
2249 multiaggregation is performed. This replaces a compiler define of the same name.
2250 Default value is 1000, smaller values make multiaggregations numerically more stable.
2251- new global parameter heuristics/useuctsubscip that affects all LNS heuristics using common sub-SCIP parameters
2253- new parameter branching/relpscost/degeneracyaware to switch degeneracy-aware hybrid branching
2255- new parameter separation/rapidlearning/checkexec to check whether rapid learning is allowed to run locally
2256- new parameters separation/rapidlearning/check{degeneracy,dualbound,leaves,nsols,obj} to enable checking the respective feature for local rapid learning
2257- new parameter separation/rapidlearning/maxcalls to limit the number of rapid learning executions
2258- new parameter separation/rapidlearning/nwaitingnodes to set the number of waiting nodes before the dual bound is checked
2259- new parameter separation/rapidlearning/mindegeneracy to set the minimal threshold of degenerate basic-variables
2260- new parameters separation/rapidlearning/minvarconsratio to set the minimal ratio of unfixed variables in relation to basis size
2262- new parameters to control the Benders' decomposition two-phase method.
2263 - constraints/benderslp/depthfreq: after the maxdepth is reached, then the two-phase method will only be called at
2264 nodes at a depth divisible by depthfreq.
2265 - constraints/benderslp/stalllimit: after the maxdepth is reached, if there has been no improvement in the dual bound
2266 for stalllimit number of nodes, then the two-phase method is executed for the next fractional LP solution that is
2268 - constraints/benderslp/iterlimit: after the root node, only iterlimit fractional LP solutions are used at each node
2269 to generate Benders' decomposition cuts.
2271- new parameters for symmetry handling
2272 - new parameter "propagating/symmetry/maxgenerators"
2273 - new parameter "propagating/symmetry/checksymmetries"
2274 - new parameter "propagating/symmetry/displaynorbitvars"
2275 - new parameter "propagating/symmetry/conssaddlp"
2276 - new parameter "propagating/symmetry/addsymresacks"
2277 - new parameter "propagating/symmetry/detectorbitopes"
2278 - new parameter "propagating/symmetry/addconsstiming"
2279 - new parameter "propagating/symmetry/ofsymcomptiming"
2280 - new parameter "propagating/symmetry/performpresolving"
2281 - new parameter "propagating/symmetry/recomputerestart"
2282 - new parameter "constraints/symresack/checkmonotonicity"
2283 - new parameter "propagating/symmetry/compresssymmetries"
2284 - new parameter "propagating/symmetry/compressthreshold"
2285 - new parameter "propagating/symmetry/disableofrestart"
2286 - new parameter "propagating/symmetry/symfixnonbinaryvars"
2288- new parameter for enabling shared memory parallelisation for solving Benders' decomposition subproblems. The parameter
2289 benders/<bendersname>/numthreads sets the number of threads used for parallel subproblem solving.
2291- new parameters to control enhancements for solving MINLPs by Benders' decomposition
2292 - benders/<bendersname>/execfeasphase: enables the feasibility phase for solving the Benders' decomposition
2294 - benders/<bendersname>/slackvarcoef: the initial coefficient of the slack variable for the feasibility phase
2295 - benders/<bendersname>/checkconsconvexity: should the constraints be checked for convexity. This can be set to FALSE
2296 if you are certain that the NLP subproblem is convex.
2298- new parameter presolving/clqtablefac (default value 2.0) as limit on number of entries in clique table relative to number of problem nonzeros
2300- new parameter conflict/uselocalrows (default: TRUE) to incorporate locally valid cuts / rows for dual proof analysis
2302- new return code SCIP_NOTIMPLEMENTED for functions, e.g., in the LPI that have not been implemented (yet)
2304- new parameter separating/cgmip/genprimalsols that allows to generate initial primal solutions from Gomory cuts
2306- new parameter branching/relpscost/filtercandssym to allow filtering from orbits
2308- new parameter branching/relpscost/transsympscost to transfer pseudo cost information to orbit
2310- new parameters for tree size estimation and restarts:
2311 - estimation/restarts/restartpolicy (default value n)
2312 - estimation/method (default value c)
2313 - estimation/restarts/restartlimit (default value 1)
2314 - estimation/restarts/minnodes (default value 1000)
2315 - estimation/restarts/countonlyleaves (default value FALSE)
2316 - estimation/restarts/restartfactor (default value 2)
2317 - estimation/coefmonoprog (default value 0.3667)
2318 - estimation/coefmonossg (default value 0.6333)
2319 - estimation/restarts/hitcounterlim (default value 50)
2320 - estimation/reportfreq (default value -1)
2321 - estimation/regforestfilename (default value "-")
2322 - estimation/completiontype (default value a)
2323 - estimation/treeprofile/enabled (default value FALSE)
2324 - estimation/treeprofile/minnodesperdepth (default value 20)
2325 - estimation/useleafts (default value TRUE)
2326 - estimation/ssg/nmaxsubtrees (default value -1)
2327 - estimation/ssg/nminnodeslastsplit (default value 0)
2329- new parameter constraints/linear/extractcliques to turn clique extraction off
2331- new emphasis setting emphasis/numerics to increase numerical stability of (mostly) presolving operations such as (multi-)aggregations at the cost of performance.
2333- new parameters for treemodel:
2334 - new parameter branching/treemodel/enable to enable the treemodel in reliability pscost branching and possible
2335 future parts of the code where it could be used.
2336 - new parameter branching/treemodel/highrule to specify which branching rule to use when treemodel thinks the node
2337 is high in the tree.
2338 - new parameter branching/treemodel/lowrule to specify which branching rule to use when treemodel thinks the node
2340 - new parameter branching/treemodel/height to specify at which (estimated) height a node is high or low in the tree.
2341 - new parameter branching/treemodel/filterhigh to specify whether to filter dominated candidates in nodes which are
2343 - new parameter branching/treemodel/filterlow to specify whether to filter dominated candidates in nodes which are
2345 - new parameter branching/treemodel/maxfpiter to specify the maximum number of fixed-point iterations to use when
2346 computing the ratio of a variable using the fixed-point method.
2347 - new parameter branching/treemodel/maxsvtsheight to specify the maximum height to compute the SVTS score exactly
2348 before approximating it using the ratio.
2349 - new parameter branching/treemodel/fallbackinf defines the fallback strategy to use when the tree size estimates
2350 obtained by SVTS are infinite.
2351 - new parameter branching/treemodel/fallbacknoprim defines the fallback strategy to use when no primal bound is known
2352 and thus SVTS would not be able to compute a tree size (it would be infinite).
2353 - new parameter branching/treemodel/smallpscost defines the value under which pscosts are considered too small to be
2354 the deciding factor for branching, in which case it may be better not to use the treemodel.
2356- new parameters for symmetry handling constraint handlers to enforce that also non-model constraint are copied:
2357 - new parameter "constraints/orbisack/forceconscopy"
2358 - new parameter "constraints/orbitope/forceconscopy"
2359 - new parameter "constraints/symresack/forceconscopy"
2364- small changes in constants of hash functions
2365- added fast 2-universal hash functions for two to seven 32bit elements with 32bit output
2366- extended SCIPpqueueCreate() by additional callback argument SCIP_DECL_PQUEUEELEMCHGPOS to catch position changes
2367- new methods SCIPpqueueDelPos() to delete elements at a specific position in the priority queue and SCIPpqueueFind() to
2368 find a specific position. It is recommended to track position changes using the new callback SCIP_DECL_PQUEUEELEMCHGPOS.
2369 In contrast, using SCIPpqueueFind() can be slow because it needs to compare the element it searches for
2370 with each slot in the queue.
2374- The default value for DFLAGS in the non-cmake buildsystem has changed from -MM to -MMD. This will break the
2375 generation of depend.* files if that was done by a compiler call that relied on -MM. The new preferred way
2376 to handle compilation dependencies is to additionally use $(DFLAGS) when compiling the object files (.o) and
2377 to include the generated .d files in the Makefile, see also "Build system / Makefile" below.
2381 - new unit test for treemodel.
2386 - fixed an issue that may have lead to wrong status reports in the evaluation scripts
2393- avoid problem with doubly defined object together with CPLEX
2397- Removed static object compilation dependency files (depend.*). If using a GCC compatible compiler, then dependency
2398 files are now dynamically created and updated during build. The new dependency files (*.d) reside next to each object
2399 file (.o) in the corresponding obj subdirectory.
2400- added support for building against Ipopt >= 3.13
2401- unify compiler switches for Intel compiler and avoid problem with doubly defined object together with CPLEX
2406- fix and improve memory handling in symmetry computation
2407- fix shown number of applied conflicts in solving statistics
2408- fix wrongly skipping strong branching call and using old information if LP was solved with 0 iterations
2409- fix minor bug in cut score calculation
2410- fixed several bugs related to rounding locks of variables not being updated correctly
2411- small fix in cons_varbound.c to skip changing bounds of multi-aggregated variables in separation callback
2412- fixed issue in SCIPtightenVar* and SCIPinferVar* that occurs for small bound changes
2413- fixed rejecting minimal boundchange that changed sign of variable, even though SCIPisLb/UbBetter approved it
2414- fixed issue in generateCutNonConvex() which is triggered when adding quadratic constraints during the solving process
2415- fixed bug in freeing the reoptimization data if no problem exists
2416- fixed bug in SCIPreoptReleaseData() when freeing all stored constraints
2417- fixed bug when freeing the transformed problem via interactive shell if reoptimization is enabled
2418- fixed two issues related to (near-)redundant logicor constraints in presolving
2419- fixed counting of aggregations in XOR constraint handler
2420- fixed handling of unbounded solutions
2421- fixed update of LP size information when an LP error occured during probing
2422- handle special case of variable bound constraints during aggregating variables
2423- tighten sides of linear constraints before trying to upgrade them to more specialized constraints (knapsack, logic-or etc.) when calling SCIPupgradeConsLinear()
2424- fixed an issue in repair heuristic in the case of loose (noncolumn) variables
2425- allow user to correctly set heuristics/alns/(un)fixtol
2426- fixed an issue in heur_completesol which is triggered during bound widening of unbounded continuous variables
2427- fixed bug in cons_indicator if addopposite is true
2428- fixed bug in sepa_disjunctive: treat case that conflictgraph is empty
2429- added safety check in conversion to rational number to avoid overflow
2430- fixed bug in interval evaluation with power-operator in certain situations
2431- fixed behavior of SCIPmatrixCreate() regarding memory management and column generation
2432- SCIPmatrixCreate() returns complete=FALSE when locks do not add up
2433- fixed bug in sepa_oddcylce when variables are fixed
2434- fixed numerical issues related to tighter constraint sides in varbound constraint handler
2435- fixed update of watchedvars in logicor constraint handler in case of a restart during the tree
2436- fixed treatment of multi-aggregated variables in logicor constraint handler
2437- handle special case of redundant implications
2438- fixed numerical issue related to almost-0-values in pseudosolution conflict analysis
2439- fixed numerical issue related to very large greatest common dividers in linear constraint handler
2440- avoid using implications on multiaggregated variables when propagating implications
2441- fixed creation of (Lagrangian) variable bounds in the OBBT propagator
2442- fixed sorting of primal solutions
2443- fixed cleaning of clean buffer in conflict analysis
2444- avoid probing on variables with huge bounds in shift and propagate heuristic
2445- fix issue in printing solutions for variables that have been added by the dual sparsify presolver
2446- fix issue related to fixing redundant logic-or constraints after presolving
2447- fixed bug when parsing logic-or and and-constraints
2448- fixed wrong assert in updateLazyBounds()
2449- fixed bug in pricestore, which resulted in too many problem variables being added
2450- fixed bug in cons_knapsack where weight of clique was not reset after an infeasibility was detected
2451- fixed bug in presol_inttobinary which did not take into account that the aggregation could be rejected due to numerics
2452- fixed bug in debug solution mechanism in connection to variables created by presol_inttobinary
2453- fixed wrong indexing while undoing the implications from a redundant variable in SCIPshrinkDisjunctiveVarSet
2454- redundancy checks in SCIPnodeAddBoundinfer now take a possible change to an active variable into account
2455- fixed adding already added quadratic rows to NLP relaxation during solve
2456- fixed issue related to variable locks in the varbound constraint handler
2457- fixed bug in the quadratic constraint handler when changing infinite constraint sides
2458- fixed sorting of variables in linear constraint handler
2459- added additional checks to ensure numerical stability of dual proofs
2460- fixed a case when activities of a linear constraint got unreliable but where still used for reductions
2461- ensure that lhs <= rhs for linear constraints (without tolerances)
2462- make handling of read errors in SCIPfread() consistent between version with and without ZLIB
2463- correctly drop variable events in cons_indicator in restart
2464- fixed bug in cons_orbitope with upgrading of orbitope constraints
2465- additional checks in some presolvers for time limit being exceeded
2466- fixed bug in presolving of cons_varbound with multi-aggregated variables
2467- improve numerics in conflict analysis by using double-double arithmetic
2468- fixed bound acceptance condition to avoid inconsistencies
2469- fixed numerics in pseudoobj propagator by using double-double arithmetic
2474- modified display column for memory usage ("mem"), which reports the memory usage most of the time, but shows the creator name
2475 (heuristic, relaxation handler, LP relaxation, strong branching, pseudo solution) of every new incumbent solution. Together with this change,
2476 heuristic display characters have been unified to represent the type of the heuristic
2477 (diving, Large neighborhood search, propagation, etc.), see also type_heur.h.
2478- added assert that ensures that the locks of a variable have been decreased to 0 when it is freed
2479- added more output for completing a partial solution
2480- checks in debug mode that clean buffer memory is really clean when being freed are now disabled by default
2481- don't compute symmetries if reoptimization is enabled
2482- prefer integral values when fixing an almost-fixed continuous variable in the trivial presolver
2483- changed the name of the variable that is added by the OSiL reader to represent the quadratic or nonlinear parts of the objective function
2484- SCIP_EXPORT is now defined as __attribute__((__visibility__("default"))) if GCC and no SCIP config header is used
2486@page RN60 Release notes for SCIP 6.0
2488@section RN602 SCIP 6.0.2
2489*************************
2494- The abspower constraint handler now passes more accurate convexity
2495 information to the NLP relaxation.
2497Examples and applications
2498-------------------------
2500- added parsing functionality for optcumulative constraints in CIP format
2505### Interfaces to external software
2507- Updated the Mosek LP solver interface to support Mosek 9.0.
2514- new target to 'doc' to build documentation
2515- ctests now fail if parameter file not found
2516- add flag STATIC_GMP and improve GMP find module
2517- remove non-API methods from library (API methods use new macro SCIP_EXPORT)
2518- increase minimal required CMake version to 3.3
2519- correct paths and dependency information when installing SCIP
2523- fixed SCIP-Jack presolving bug that could lead to wrong results for Steiner arborescence problems
2524- fixed wrong unboundedness result in case not all constraints were already in the LP and enforcement was
2525 skipped because an optimal solution was found
2526- fixed wrong enforcement of constraints in the disjunction constraint handler
2527- fixed wrong behavior of concurrent solve ignoring initial solutions
2528- fixed bug in concurrent solve when problem was already solved in presolving
2529- aggregate non-artificial integer variable for XOR constraints with two binary variables and delete constraint
2530- copy the objective offset when copying the original problem
2531- fixed bug in SCIPlpiGetBInvARow in lpi_cpx using wrong size of resulting vector
2532- fixed quadratic runtime behavior in sepa_aggregation
2533- fixed statistics of separators
2534- improve numerical stability in varbound constraint handler by using double-double arithmetic
2535- fixed bug in propagation of dual proofs
2536- fixed bugs that arise for multiaggregated indicator variables by disallowing multiaggregation for them
2537- improve numerical stability in SCIPcomputeBilinEnvelope* by using double-double arithmetic
2538- fixed bug related to releasing pending bound changes in tree.c
2539- set STD FENV_ACCESS pragma to on in code that changes floating-point rounding mode
2540- disable GCC optimizations in main interval arithmetic code to prevent wrong optimizations
2541- fixed wrong assert in cons_xor concerning the variable type
2542- fixed different behavior of SCIPisLbBetter and SCIPisUbBetter between having NDEBUG defined or not
2543- correctly handle bound disjunctions in symmetry detection
2544- fixed issue in reliability branching related to the LP error flag not being reset
2545- fixed treatment of near-infinite bounds in shiftandpropagate's problem transformation
2546- fixed handling of infinite values in SCIPcomputeHyperplaneThreePoints()
2547- fixed comparisons of infinite values in heur_intshifting.c and heur_shifting.c
2548- fixed bug related to updating unprocessed cuts in the cutpool
2549- fixed bug related to enabling quadratic constraints during `CONSINITLP`
2550- add missing SCIP_EXPORT for functions used by GCG
2551- fixed memory leak and wrong initialization for trival cases in cons_symresack.c
2552- fixed bug with upgrading to packing/partitioning orbitopes
2553- fixed bug with the status while upgrading in presol_symbreak.c
2554- fixed wrong stage while clearing the conflict store
2555- fixed behavior of SCIPfixVar() by setting infeasible pointer to TRUE if fixval lies outside variable domain
2556- allow tightenVar() in SCIP_STAGE_PROBLEM stage
2557- fixed bug in cumulative constraint handler when separating the LP solution
2558- fixed issues with integer overflow in cumulative constraint handler
2559- fixed bug where the convexity of Benders' decomposition subproblems was checked even when users defined subproblem
2560 solving methods. Now, as per the documentation, the user must explicitly state whether the subproblem is convex
2561- fixed wrong indexing in heur_dualval
2562- fixed issue with basis status in SoPlex LPi
2567- statistics now output primal/dual bounds if objective limit is reached
2568- memory check in debug mode is now disabled by default
2569- message is now provided to the user to inform that automatic Benders' auxiliary variable lower bound computations are
2570 not activated when user defined subproblem solving methods are present
2571- corrected documentation of the primalgap in SCIP; describe when it will be infinite
2573@section RN601 SCIP 6.0.1
2574*************************
2579- when using a debug solution every (multi-)aggregation will be checked w.r.t. this solution
2581Performance improvements
2582------------------------
2584- try greedy solution first before solving knapsack exactly using dynamic programming in SCIPsolveKnapsackExactly,
2585 compute greedy solution by weighted median selection.
2586- don't consider implied redcost by default in the reduced cost propagator
2591### Deleted and changed API methods and macros
2593- The preprocessor macro NO_CONFIG_HEADER now needs to be defined when
2594 including SCIP header files from a SCIP build or installation that
2595 has been build via the Makefile-only build system.
2597- The following preprocessor macros have been renamed:
2598 WITH_ZLIB to SCIP_WITH_ZLIB, WITH_GMP to SCIP_WITH_GMP, WITH_READLINE
2599 to SCIP_WITH_READLINE, NO_SIGACTION to SCIP_NO_SIGACTION, NO_STRTOK_R
2600 to SCIP_NO_STRTOK_R, ROUNDING_FE to SCIP_ROUNDING_FE, ROUNDING_FP to
2601 SCIP_ROUNDING_FP, ROUNDING_MS to SCIP_ROUNDING_MS. Note, however, that
2602 the names of macros NO_RAND_R and NO_STRERROR_R have not been changed
2605### New API functions
2607- SCIPhashmapInsertInt(), SCIPhashmapSetImageInt(), and SCIPhashmapGetImageInt() to use integer values as images in hashmaps
2609### Command line interface
2611- warn about coefficients in MPS files with absolute value larger than SCIP's value for infinity
2613### Changed parameters
2615- default clock type for timing is now wallclock
2620- added unit tests for exact knapsack solving and (weighted) median selection algorithms
2627- add missing GMP dependency when compiling with SYM=bliss
2628- add DL library when linking to CPLEX to avoid linker errors
2629- new config.h header defining the current build configuration, e.g. SCIP_WITH_GMP
2634- fixed handling of weights in cons_sos1 and cons_sos2 (NULL pointer to weights)
2635- fixed handling of unbounded LPs in SCIP and in several LPIs; added heuristic method to guess solution
2636- the STO reader is capable of handling scenarios defined using lower case "rhs"
2637- fixed OPB reader for instances without explicit plus signs
2638- correct dual solution values for bound constraints
2639- fixed recognition of variable with only one lock in cons_bivariate, cons_quadratic, and cons_nonlinear
2640- fixed update of constraint violations in solution repair in cons_bivariate, cons_quadratic, and cons_nonlinear
2641- print error message and terminate if matrix entries of a column are not consecutive in mps format
2642- fixed incorrect handling of fixed variables when transfer of cuts from LNS heuristic for Benders' decomposition
2643- fix returning local infeasible status by Ipopt interface if Ipopt finds problem locally infeasible
2644- skip attempt to apply fixings in linear constraint handler during solving stage as LP rows cannot change anymore
2645- fixed bug when reading >= indicator constraints in MPS format
2646- fix issue with nodes without domain changes if we ran into solution limit in prop_orbitalfixing
2647- fixed unresolved reference to CppAD's microsoft_timer() function on builds with MS/Intel compilers on Windows
2648- ignore implications added through SCIPaddVarImplication() that are redundant to global bounds also in the
2649 special case of an implication between two binary variables; also, use implications instead of cliques in the case
2650 of a binary implied variable with nonbinary active representative
2651- fixed bug with aggregated variables that are aggregated in propagation of cons_sos1
2652- fixed some special cases in SCIPselect/SCIPselectWeighted methods
2653- relaxed too strict assertion in Zirounding heuristic
2654- fixed the upgrade routine to XOR constraints: aggregate integer variable if its coefficient has the wrong sign
2655- fixed handling of nonartificial parity variables when deleting redundant XOR constraints
2656- earlier deletion of trivial XOR constraints (at most 1 operator left)
2657- fixed wrong hashmap accesses and added sanity check for the correct hashmap type
2658- avoid copying of unbounded solutions from sub-SCIPs as those cannot be checked completely
2659- corrected the output of the first LP value in case of branch-and-price
2660- fixed possible integer overflow, which led to wrong conclusion of infeasibility, in energetic reasoning of cons_cumulative.c
2665- do not scale linear constraints to integral coefficients
2667@section RN600 SCIP 6.0.0
2668*************************
2673- new diving heuristic farkasdiving that dives into the direction of the pseudosolution and tries to construct Farkas-proofs
2674- new diving heuristic conflictdiving that considers locks from conflict constraints
2675- restructuring of timing of symmetry computation that allows to add symmetry handling components within presolving
2676- `lp/checkstability` is properly implemented for SoPlex LPI (spx2)
2677- new branching rule lookahead that evaluates potential child and grandchild nodes to determine a branching decision
2678- limits on the number of presolving rounds a presolver (maxrounds) or propagator/constraint handler (maxprerounds)
2679 participates in are now compared to the number of calls of the particular presolving method, not the number of
2680 presolving rounds in general, anymore
2681- new miscellaneous methods for constraints that have a one-row linear representation in pub_misc_linear.h
2682- a Benders' decomposition framework has been added. This framework provides the functionality for a user to solve a
2683 decomposed problem using Benders' decomposition. The framework includes classical optimality and feasibility cuts,
2684 integer optimality cuts and no-good cuts.
2685- add statistic that presents the number of resolves for instable LPs
2686- new readers for stochastic programming problems in SMPS format (reader_sto.h, reader_smps.h)
2688Performance improvements
2689------------------------
2691- cuts generated from certain quadratic constraints with convex feasible region are now global
2692- performance improvements for Adaptive Large Neighborhood Search heur_alns.c
2693 + all neighborhoods now start conservatively from maximum fixing rate
2694 + new default parameter settings for bandit selection parameters
2695 + no adjustment of minimum improvement by default
2696- improved bound tightening for some quadratic equations
2697- constraint handler checking order for original solutions has been modified to check those with negative check priority
2698 that don't need constraints after all other constraint handlers and constraints have been checked
2699- deactivate gauge cuts
2701Examples and applications
2702-------------------------
2704- new example `brachistochrone` in CallableLibrary examples collection; this example implements a discretized model to
2705 obtain the trajectory associated with the shortest time to go from point A to B for a particle under gravity only
2706- new example `circlepacking` in CallableLibrary examples collection; this example models two problems about packing
2707 circles of given radii into a rectangle
2708- new price-and-branch application for the ringpacking problem
2709- new stochastic capacitated facility location example demonstrating the use of the Benders' decomposition framework
2714### New and changed callbacks
2716- added parameter locktype to `SCIP_DECL_CONSLOCK` callback to indicate the type of variable locks
2718### Deleted and changed API methods
2721 + removed function SCIPgetTimingSymmetry() in presol_symmetry.h since this presolver does not compute symmetries independent
2722 of other components anymore
2723 + additional argument `recompute` to SCIPgetGeneratorsSymmetry() to allow recomputation of symmetries
2726 + the seed of SCIPinitializeRandomSeed() is now an unsigned int
2727 + the seed of SCIPsetInitializeRandomSeed() is now an unsigned int and it returns an unsigned int
2728 + new parameter for SCIPcreateRandom() to specify whether the global random seed shift should be used in the creation of
2729 the random number generator
2732 + additional arguments `preferrecent`, `decayfactor` and `avglim` to SCIPcreateBanditEpsgreedy() to choose between
2733 weights that are simple averages or higher weights for more recent observations (the previous default).
2734 The last two parameters are used for a finer control of the exponential decay.
2735 + functions SCIPintervalSolveUnivariateQuadExpression(), SCIPintervalSolveUnivariateQuadExpressionPositive(), and
2736 SCIPintervalSolveUnivariateQuadExpressionPositiveAllScalar() now take an additional argument to specify already
2737 existing bounds on x, providing an entire interval ([-infinity,infinity]) gives previous behavior
2739### New API functions
2741- SCIPintervalSolveUnivariateQuadExpressionNegative()
2742- SCIPvarGetNLocksDownType() and SCIPvarGetNLocksUpType()
2743- SCIPaddConsLocksType()
2744- SCIPconsIsLockedTypePos(), SCIPconsIsLockedTypeNeg(), SCIPconsIsLockedType(), SCIPconsGetNLocksTypePos() and SCIPconsGetNLocksTypeNeg()
2745- SCIPstrncpy(), a safe version of strncpy()
2747### Changed parameters
2749- Removed parameters:
2750 - `heuristics/alns/stallnodefactor` as the stall nodes are now controlled directly by the target node limit within the heuristic
2751 - `presolving/symmetry/computepresolved` since this presolver does not compute symmetries independent of other components anymore
2752 - `separating/maxincrounds`
2756- `lp/checkfarkas` that enables the check of infeasibility proofs from the LP
2757- `heuristics/alns/unfixtol` to specify tolerance to exceed the target fixing rate before unfixing variables, (default: 0.1)
2758- `propagating/orbitalfixing/symcomptiming` to change the timining of symmetry computation for orbital fixing
2759- `lp/alwaysgetduals` ensure that the dual solutions are always computed from the recent LP solve
2760- `display/relevantstats` indicates whether the small relevant statistics are displayed at the end of solving
2761- `propagating/orbitalfixing/performpresolving` that enables orbital fixing in presolving
2762- `presolving/symbreak/addconsstiming` to change the timining of symmetry computation for symmetry handling inequalities
2763- `propagating/orbitalfixing/enabledafterrestarts` to control whether orbital fixing is enabled after restarts
2764- `benders/∗` new submenu for Benders' decomposition related settings. This includes the settings related to the
2765 included Benders' decompositions and the general Benders' decomposition settings.
2766- `benders/<decompname>/benderscuts/∗` submenu within each included Benders' decomposition to control the Benders'
2767 decomposition cuts. The cuts are added to each decomposition separately, so the setting are unique to each
2772- new enum `SCIP_LOCKTYPE` to distinguish between variable locks implied by model (check) constraints (`SCIP_LOCKYPE_MODEL`)
2773 and variable locks implied by conflict constraints (`SCIP_LOCKYPE_CONFLICT`)
2774- expression interpreter objects are now stored in the block memory
2779- removed presolving plugin presol_implfree
2780- separated scip.c into several smaller implementation files scip_*.c for better code overview; scip.c was removed,
2781 but the central user header scip.h remains, which contains includes of the separated headers
2786- fixed bug in gcd reductions of cons_linear regarding an outdated flag for variable types
2787- fixed bug in heur_dualval regarding fixing routine for integer variables
2788- suppress debug solution warnings during problem creation stage
2789- fixed check for activated debugging solution in components constraint handler
2790- fixed potential bug concerning solution linking to LP in SCIPperformGenericDivingAlgorithm()
2791- fixed reward computation in ALNS on continuous, especially nonlinear, problems
2792- fixed bug in freeing reoptimization data if problem was solved during presolving
2793- fixed check of timing in heur_completesol
2794- fixed wrong propagation in optcumulative constraint handler
2795- fixed non-deterministic behavior in OBBT propagator
2796- don't disable LP presolving when using Xpress as LP solver
2797- fixed possible `NULL` pointer usage in cons_pseudoboolean
2798- ensured that SCIPgetDualbound() returns global dual bound instead of the dual bound of the remaining search tree
2799- fixed rare division-by-zero when solving bivariate quadratic interval equation
2800- use total memory for triggering memory saving mode
2801- fix parsing of version number in the CMake module for Ipopt
2802- fixed handling of implicit integer variables when attempting to solve sub-MIP in nlpdiving heuristic
2803- added workaround for bug when solving certain bivariate quadratic interval equations with unbounded second variable
2804- fixed bug with releasing slack variable and linear constraint in cons_indicator
2805- fixed problem when writing MPS file with indicator constraints with corresponding empty linear constraints
2806- fixed bug in heur_vbound triggered when new variables were added while constructing the LP
2807- fixed bug with unlinked columns in SCIProwGetLPSolCutoffDistance()
2812- updated CppAD to version 20180000.0
2813- remove LEGACY mode, compiler needs to be C++11-compliant
2815@page RN50 Release notes for SCIP 5.0
2817@section RN501 SCIP 5.0.1
2818*************************
2823- SCIP executable handles the `SIGTERM` signal. If the process receives a `SIGTERM`, SCIP terminates the solution process with a
2824 new `SCIP_STATUS` code `SCIP_STATUS_TERMINATE` and displays all relevant statistics before exiting.
2825- add number of conflict constraints found by diving heuristics to statistics
2826- allow output of lower bounds for visualization
2827- added symmetry detection for linking constraints
2829Performance improvements
2830------------------------
2832- disable disaggregation of quadratic constraints by changing the default for `constraints/quadratic/maxdisaggrsize` to 1
2833 (disaggregation can still be very helpful on some instances, but also seems hurtful on others)
2836 - increased threshold when to scale up cuts that are generated by nonlinear constraint handlers
2837 - test additional scaling factors in CMIR cut generation heuristic
2838 - cleaned up implementation of the cut selection procedure and added new cut quality measure
2839 - use random tie-breaking in cut selection
2844### New API functions
2846- new methods SCIPtryTerminate() and SCIPterminated() in scip/interrupt.h for handling of SIGTERM signals.
2847- new method SCIPselectCuts() to run SCIP's cut selection procedure on a given array of cuts
2849### Changed parameters
2851- rename parameter `constraints/orbisack/orbisack/coverseparation` to `constraints/orbisack/coverseparation`
2855- `visual/displb` that enables output of lower bounds for visualization
2856- `presolving/symmetry/displaynorbitvars` (whether we display the number of affected variables in the statistics)
2857- `separating/efficacyfac` to change the weight of the efficacy in cut score calculation
2858- `separating/dircutoffdistfac` to change the weight of the directed cutoff distance in cut score calculation
2862- new `SCIP_STATUS` code `SCIP_STATUS_TERMINATE` in scip/interrupt.h for handling of SIGTERM signals.
2867- expanded unit tests of the lpis
2868- added check to unit tests that problem is not solved after every change
2873- fixed LP status to unsolved when marking LP to be resolved if objective limit has changed
2874- copy parameter settings to sub-SCIPs in SCIPcopyLargeNeighborhoodSearch() also when copying only LP rows
2875- fixed a check for fixed variables in Binpacking example
2876- generate deprecation warnings when using SCIPaddCut
2877- fix bug in sepa_gomory if cut is a bound change
2878- fixed handling of infinite bounds in cons_sos1
2881 - fixed bug while scaling linear constraints
2882 - don't delete conflict constraints that were transformed into model constraints during a restart
2883 - fixed treatment of variable aggregations in knapsack constraint handler that led to wrong propagations
2886 - fixed LPI status after changing objective in lpi_cpx, lpi_grb, lpi_xprs, lpi_msk
2887 - fixed and unified asserts in LPIs
2888 - retrieve interior solution instead of (possibly non-existing) basic solution from mosek after using barrier without crossover in lpi_msk
2889 - fixed bug with `NULL` pointer handling in LPIs
2892 - fixed wrong cast in LP iteration limit computation in proximity search heuristic
2893 - fixed check for time limit in heur_nlpdiving
2894 - improved numerics and fixed stop criterion in zirounding heuristic
2896@section RN500 SCIP 5.0.0
2897*************************
2902- new numerical solution violations get printed when checksol is called
2903- added analysis of the clique table which identifies possible aggregations via the search for
2904 strongly connected components and may detect infeasible assignments on the way
2905- added macros to do computations with a higher precision by using double-double arithmetic
2906- extended conflict analysis by analyzing dual solutions of boundexceeding LPs
2907- revised internal debugging mechanism to check against a user given debug solution (debug.h)
2910 - add new heuristic MPEC that solves a MPEC reformulation of a mixed-binary nonlinear problem by regularized NLP reformulations
2911 - new primal heuristic ALNS that orchestrates eight different LNS heuristics adaptively
2912 using algorithms for the multi-armed bandit problem
2913 - three bandit selection algorithms to face sequential decision problems under uncertainty
2915- Presolving and symmetry:
2916 - added presol_symmetry.c for computing and storing symmetry information of a MIP
2917 - added presol_symbreak.c to detect special symmetry structures and to add symmetry handling constraints
2918 - SCIP can now automatically detect and compute symmetries in MIPs (if a graph automorphism code is linked in)
2919 - added cons_symresack.c to handle permutation symmetries in a binary programs via inequalities and propagation
2920 - added cons_orbisack.c to handle special permutation symmetries in a binary programs via inequalities and propagation
2921 - cons_orbitope.c can now handle full orbitopes as well
2924 - added new propagator orbital fixing
2925 - utilizing linear inequalities to compute stronger linearizations for bilinear terms; the inequalities are computed in
2929 - added API for aggregating rows for generating cuts which uses double-double arithmetic internally
2930 - added filtering of parallel cuts in the cut pool
2933 + added new plugin type `table` for adding user-defined statistics tables
2934 + new presolving plugin presol_sparsify that tries to cancel nonzero coefficients in linear constraints by adding
2935 multiples of linear equalities
2937Performance improvements
2938------------------------
2940- use disjoint set to reduce peak memory usage and time to compute of clique table connectedness information
2941- add and use RESTRICT macro for some pointers
2942- improved the implementation of SCIPvarGetActiveRepresentatives
2943- speed-up reverse propagation
2944- removed bestrelaxsol and directly access relaxation solution instead to decrease overhead when using relaxation handlers
2945- for fast presolving emphasis, disable use of implications in logicor presolving
2946- use limit on the total number of nonzeros added to the clique table during the greedyCliqueAlgorithm of cons_knapsack.c
2947- revised disaggregation of quadratic constraints: the number of created constraints can now be controlled and the
2948 disaggregated constraints are scaled in order to increase numerical accuracy
2949- disabled reformulation of products of a binary variable with a linear term that does not solely involve binary variables
2950- speed up creation of LP in the computation of relative interior points
2951- improved dual ray analysis
2952- drop events of disabled linear constraints to reduce event processing effort
2955 - new implementation of zerohalf separator
2956 - enabled cutting plane separation in the tree
2957 - improved cut selection and management
2958 - improved cut post-processing: apply coefficient tightening, enforce maximal dynamism
2961 - improved selection of rows in CMIR aggregation heuristic
2962 - generate lifted flowcover cuts in CMIR cut generation heuristic
2963 - faster implementation of CMIR cut generation heuristic
2964 - use LP solution polishing during probing and diving mode to activate it during many primal heuristics; remains disabled
2965 during strong branching and OBBT
2966 - improved versions of the clique and variable bound pre-root heuristics that are often able to fix many more variables
2971### New and changed callbacks
2974 - added new abstract selection algorithm `SCIP_BANDIT` together with callbacks
2975 - added new types for symmetry handling
2978 - dropped NLP termination status `SCIP_NLPTERMSTAT_UOBJLIM`
2981 - added parameter `objval` to `SCIP_DECL_NLPIGETSOLUTION` for returning the optimal objective value (can be set to `NULL`)
2983- Separation callbacks:
2984 - added parameter `allowlocal` to `SCIP_DECL_SEPAEXECLP` and `SCIP_DECL_SEPAEXECSOL` to switch generation of locally valid cuts
2985 - added parameter `dstatssize` to `SCIP_DECL_NLPIDELVARSET` and `SCIP_DECL_NLPIDELCONSSET`
2987### Deleted and changed API methods
2990 - removed parameter `allowaddcons` from SCIPselectVarPseudoStrongBranching(), SCIPselectVarStrongBranching(), and
2991 SCIPincludeBranchruleRelpscost()
2993- Constraint Handlers:
2994 - generalized SCIPcreateConsOrbitope() and SCIPcreateConsBasicOrbitope() method to three orbitope types (full, partitioning, packing)
2996- Cutting plane separation methods:
2997 - changed function signature of SCIPcalcMIR()
2998 - changed function signature of SCIPcalcStrongCG()
2999 - new method SCIPaddRow() to replace deprecated SCIPaddCut()
3000 - removed parameter `scaling` from SCIPgetRowprepViolation()
3001 - added parameter `allowlocal` to SCIPseparateSol()
3004 - replaced LP parameters `SCIP_LPPARAM_LOBJLIM` and `SCIP_LPPARAM_UOBJLIM` by `SCIP_LPPARAM_OBJLIM`
3007 - SCIPnlpStatisticsCreate() and SCIPnlpStatisticsFree() now require a pointer to blockmemory as parameter
3008 - added parameter `objval` to SCIPnlpiGetSolution() of NLPIs for returning the optimal objective value (can be set to `NULL`)
3009 - added parameter `varnameslength` to SCIPexprParse()
3010 - added parameter `dstatssize` to SCIPnlpiDelVarSet() and SCIPnlpiDelConsSet()
3011 - added modifier const to `exprtree` parameter of SCIPnlpiChgExprtree()
3014 - SCIPheurPassIndicator() has a new parameter which allows to pass the objective of the solution
3017 - added parameter `includeslp` to SCIPmarkRelaxSolValid(), SCIPsetRelaxSolVals() and SCIPsetRelaxSolValsSol();
3018 - removed parameter `includeslp` from SCIPrelaxCreate() and SCIPincludeRelax()
3019 - removed functions SCIPrelaxIncludesLp() and SCIPrelaxSetIncludesLp()
3020 - replaced method SCIPgetRelaxFeastolFactor() by SCIPrelaxfeastol() and added SCIPchgRelaxfeastol()
3023 - changed return type of SCIPcliqueGetId() from `int` to `unsigned int`
3024 - SCIPsolveParallel() is deprecated; use SCIPsolveConcurrent() instead
3025 - removed SCIPvarGetCliqueComponentIdx(); the connectedness information of the clique table is now stored as a
3026 `SCIP_DISJOINTSET` member of the clique table and cannot be publicly accessed
3027 - added parameter `copytables` to SCIPcopyPlugins()
3028 - SCIPsolveParallel() has been deprecated, use the new method SCIPsolveConcurrent() instead
3029 - allowed SCIPgetNConss() in stage `SCIP_STAGE_INITSOLVE`
3031### New API functions
3033- SCIPaddRow() to replace deprecated SCIPaddCut()
3034- methods to display linear constraint classification types; use SCIPclassifyConstraintTypesLinear()
3035 after reading a problem to classify linear constraint types
3036- public methods SCIPvariableGraphBreadthFirst() and SCIPvariableGraph{Create,Free}() to
3037 perform breadth-first search on the variable constraint graph used by the GINS and ALNS heuristics
3038- SCIPsetProbingLPState() to install given LP state and/or norms at the current probing node
3039- SCIPbranchcandGetLPMaxPrio() and SCIPbranchcandGetExternMaxPrio() to query the maximal branching priority of given
3040 branching candidates; also added SCIPbranchcandGetNPrioLPCands() to access the number of LP candidates with this priority.
3041- SCIPupdateSolIntegralityViolation(), SCIPupdateSolBoundViolation(), SCIPupdateSolLPRowViolation(),
3042 SCIPupdateSolConsViolation() and SCIPupdateSolLPConsViolation() for updating numerical solution violations, as well as
3043 SCIPactivateSolViolationUpdates() and SCIPdeactivateSolViolationUpdates() for activating/deactivating violation updates globally
3044- SCIPsetSubscipDepth() to set the depth of SCIP as a copied subproblem during problem stage
3045- SCIPdivesetGetNSols() to query the number of found solutions from a diveset.
3046- SCIPnextafter() that wraps different nextafter methods to return the next representable value after a given value
3047- SCIPlinConsStats{Create,Free,GetTypeCount,GetSum}() and SCIPprintLinConsStats() to work with linear constraint classification through the C API
3048- SCIPgetRowNumIntCols() that returns the number of integer columns in a row
3049- SCIPsetSlackVarUb() to control upper bound of slack variable in cons_indicator
3052 - methods SCIPrandomCreate() and SCIPrandomFree() are no longer public and should be replaced by SCIPcreateRandom() and
3053 SCIPfreeRandom(), respectively (the new methods respect the global parameter `randomization/randomseedshift` automatically)
3054 - methods SCIPdigraphCreate() and SCIPdigraphCopy() are no longer public and should be replaced by SCIPcreateDigraph() and
3055 SCIPcopyDigraph(), respectively, which receive a SCIP argument and are more robust towards future interface changes
3058 - SCIPgetAllBilinearTermsQuadratic() to access data of all existing bilinear terms in quadratic constraints
3059 - SCIPaddBilinearIneqQuadratic() to propose an inequality with two variables that appear in a bilinear term
3060 - SCIPcomputeBilinEnvelope{1,2}() to compute a linearization of a bilinear term when considering at most two linear inequalities
3063 - SCIPcliqueGetIndex() which returns the unique identifier for the given clique
3064 - SCIPgetNCliquesCreated() which returns the number of cliques created so far
3066- Cutting plane separation methods:
3067 - SCIPisCutNew() that returns whether a cut is already present in the global cut pool
3068 - SCIPgetSepaMinEfficacy() to access separating/minefficacy(root)
3071 - interface methods to create and use bandit algorithms implemented as SCIP core plugins
3072 - interface methods for aggregating rows and computating MIP cuts, see cuts.h
3073 - interface method SCIPsetRandomSeed() to (re)set a random number generator seed
3075### Command line interface
3077- new interactive shell functionality to display linear constraint classification types;
3078 use `display linclass` after reading a problem to classify linear constraint types
3079- new command line parameter `-r` to pass a nonnegative integer as random seed.
3081### Interfaces to external software
3083- added interface to the NLP solver WORHP
3084- added interface to the NLP solver FilterSQP
3085- added interface to graph automorphism algorithms in `src/symmetry/` (initially only to BLISS)
3086- unify handling of objective limit in LPIs by replacing LPI parameters `SCIP_LPPAR_LOBJLIM` and `SCIP_LPPAR_UOBJLIM` by
3088- dropped support for MOSEK < 7.0.0.0
3090### Changed parameters
3092- changed and removed several parameters for zerohalf separator
3093- replaced `constraints/quadratic/disaggregate` by `constraints/quadratic/maxdisaggrsize` to bound
3094 the total number of created constraints when disaggregating a quadratic constraint
3095- new value 3 for parameter `lp/solutionpolishing` to enable LP polishing only during probing and diving mode
3096- parameter `conflict/useboundlp` has new values `d` (only dual solution analysis) and `b` (both, conflict and dual solution analysis)
3099 - fixed typo `heuristics/completesol/maxunkownrate` has changed to `heuristics/completesol/maxunknownrate`
3100 - replaced parameter `heuristics/{clique,vbounds}/minfixingrate` by `heuristics/{clique,vbounds}/minintfixingrate` and
3101 `heuristics/{clique,vbounds}/minmipfixingrate`, which check the fixing rate before LP solving and after sub-MIP presolve
3104 - parameter `separating/maxstallrounds` only applies to nodes in the tree (not the root node, anymore); use the new
3105 parameter `separating/maxstallroundsroot` for the root node
3106 - moved parameters for flowcover and cmir separators to `separating/aggregation`
3108- Removed parameters:
3109 - `constraints/{abspower,bivariate,nonlinear,quadratic,soc}/scaling`
3110 - `constraints/{abspower,bivariate,quadratic,nonlinear}/mincutefficacysepa`
3111 - `constraints/{abspower,bivariate,quadratic,nonlinear}/mincutefficacyenfofac`
3112 - `constraints/soc/minefficacy`
3114 - `conflict/prefermir`
3115 - `heuristics/clique/{multiplier,initseed}`
3116 - `separating/feastolfac`
3117 - `separating/orthofac`
3118 - `separating/cgmip/allowlocal` (use parameter passed to separation callback instead)
3119 - `separating/{gomory,strongcg}/maxweightrange`
3123- `conflict/prefinfproof` (prefer infeasibility proof to boundexceeding proof)
3124- `conflict/sepaaltproofs`
3125- `constraints/indicator/maxsepanonviolated` to stop separation after separation of non violated cuts
3126- `constraints/orbisack/coverseparation` (whether orbisack cover inequalities should be separated)
3127- `constraints/orbisack/orbiSeparation` (whether facet defining inequalities for orbisack should be separated)
3128- `constraints/orbisack/coeffbound` (maximal value of coefficients in orbisack facet inequalities)
3129- `constraints/orbisack/checkpporbisack` (check whether orbisacks can be strengthened by packing/partitioning constraints)
3130- `constraints/orbisack/checkalwaysfeas` (whether conscheck returns always `SCIP_FEASIBLE`)
3131- `constraints/orbitope/checkpporbitope` (check packing/partitioning orbitopes)
3132- `constraints/orbitope/sepafullorbitope` (separate full orbitopes)
3133- `constraints/orbitope/checkalwaysfeas` (whether conscheck returns always `SCIP_FEASIBLE`)
3134- `constraints/quadratic/{usebilinineqbranch,minscorebilinterms,bilinineqmaxseparounds}`
3135- `constraints/quadratic/disaggrmergemethod` to change the strategy of how to merge independent blocks of quadratic constraints
3136- `constraints/quadratic/mincurvcollectbilinterms` to change the minimal curvature of constraints
3137 to be considered when returning bilinear terms to other plugins
3138- `constraints/quadratic/binreformbinaryonly` to disable reformulation of products of binary and non-binary variables
3139- `constraints/symresack/ppsymresack` (check whether symresacks can be strengthend by packing/partitining constraints)
3140- `constraints/symresack/checkalwaysfeas` (whether conscheck returns always `SCIP_FEASIBLE`)
3141- `expbackoff` to all separators which increases the frequency exponentially over the depth in the tree
3142- `heuristics/completesol/{beforepresol,maxlpiter,maxcontvars}`
3143- `heuristics/{clique,vbounds}/maxbacktracks` to limit the number of backtracks in the fix-and-propagate phase
3144- `heuristics/{clique,vbounds}/uselockfixings` to enable fixing of additional variables based on variable locks
3145- `heuristics/vbounds/{feasvariant,tightenvariant}` to specify the fixing variants used by the vbounds heuristic
3146- `lp/refactorinterval` to change the refactorization interval of the LP solver
3147- `misc/debugsol` to specify a debug solution that should be checked during the solve
3148- `misc/usesymmetry` to determine whether symmetry handling should be used
3149- `presolving/symbreak/conssaddlp` (whether symmetry handling inequalities should be added to the LP)
3150- `presolving/symbreak/addsymresacks` (whether symresacks should be used to handle symmetries)
3151- `presolving/symbreak/computeorbits` (whether symmetry orbits should be computed)
3152- `presolving/symbreak/detectorbitopes` (whether it should be checked if some symmetries can be handled by orbitopes)
3153- `presolving/symmetry/computepresolved` (Whether symmetries are computed after presolving)
3154- `presolving/symmetry/maxgenerators` (maximal number of generators generated by symmetry detection)
3155- `presolving/symmetry/checksymmetries` (whether validity of computed symmetries should be verified)
3156- `propagating/obbt/{itlimitfactorbilin,minnonconvexity,createbilinineqs}`
3157- `propagating/vbounds/minnewcliques` to specify the minimum number of new cliques to trigger another clique table analysis
3158- `propagating/vbounds/{maxcliquesmedium,maxcliquesexhaustive}` to limit the number of cliques relative to the
3159 number of binary variable for performing clique table analysis
3160- `separating/maxincrounds`
3161- `separating/maxlocalbounddist`, `separating/maxcoefratio` and `separating/intsupportfac`
3162- if PaPILO >= 2.1: `presolving/milp/maxbadgesizepar` to limit the maximal badge size if PaPILO is called in parallel mode
3163- if PaPILO >= 2.1: `presolving/milp/maxbadgesizeseq` to limit the maximal badge size if PaPILO is called in sequential mode
3167- new type `SCIP_Shortbool` (equal to uint8_t) for storing Boolean values in a more compact manner
3168- new disjoint set data structure `SCIP_DISJOINTSET` to incrementally update connectedness information for a graph on nodes {0,...,n-1}
3169- new red black tree data structure defined in `src/scip/rbtree.{c,h}`
3170- new object `SCIP_LINCONSSTATS`, see type_cons.h, to work with linear constraint classification through the C API
3171- added new type `SCIP_TABLE` together with callbacks to output SCIP statistics
3176- added several tests for the LP interface
3177- added tests that cover nonempty linear constraint classification types
3178- added tests for the double double arithmetic, the new red black tree data structure, the nlpi, obbt, interval arithmetics,
3179 symmetry computation, objective function changes in probing, computing envelopes of bilinear function, relaxation enforcement
3184- added interface to the NLP solver WORHP; set `WORHP=true` in order to link to WORHP
3185- added interface to the NLP solver FilterSQP; set `FILTERSQP=true` in order to link to FilterSQP
3189- added support for sanitizers in debug mode and options SANITIZE_ADDRESS, SANITIZE_MEMORY, SANITIZE_UNDEFINED, SANITIZE_THREAD
3190- added option SYM to specify which graph automorphism package (bliss, none) should be used, if available
3191- disable non-standard compliant floating point optimizations in combination with intel compilers
3192- improve Visual Studio compilation
3193- only accept IPOPT version 3.12.0 or higher
3194- preserve correct rpath in library (e.g. path to libipopt) when installing
3198- new flag `DEBUGSOL={true,false}` to enable checks against a user given debug solution
3199- added flag SYM to specify which graph automorphism package (bliss, none) should be used
3200- default value for ZIMPL in the Makefile is now `false`
3205- fix wrong statistic display of diving leaf solutions
3206- fixed order of SCIPcalcCliquePartition() in corner case where no cliques are available
3207- fix treatment of infinite lower bound in proximity objective cutoff
3208- fixed minor issue in expression graph simplification
3211 - fix linear knapsack relaxation during separation if a binary variable does not have a solution value in [0,1].
3212 - fixed potential ressource leaks in SCIPsolveLinearProb(), expr.c, sepa_eccuts, cons_cumulative.c, cons_nonlinear.c
3213 - fixed bug in cons_orbitope.c, where wrong terminating index in separation of SCIs was used
3214 - fixed wrong mapping of permuted basis indices in gomory separator
3215 - fixed integer objective separator for objective scales < 1
3218 - fixed numerical issues in boundshift presolver when aggregating integer variables
3219 - fixed aggregation of variables in boundshift presolver that contain large variable bounds
3222 - fixed bug in feasibility pump heuristic when switching on the `usefp20` parameter
3223 - fixed handling of LOOSE variables in locks heuristic
3224 - fixed creation of conflicts in clique heuristic for incomplete LPs
3227 - fixed bug in mps reader. Reader now prints `OBJSENSE` section and tries to generate unique names of constraints
3228 - fixed upgrade to a varbound constraint if abspower constraint contains a multi-aggregated variable
3229 - fixed several bugs related to hashing of constraints/rows in cutpool.c and cons_linear.c
3230 - fixed registration of almost fixed nonlinear variables in abspower constraints
3233 - fixed releasing of variables in the genvbounds propagator in case the problem could be solved during presolving of a restart
3234 - fixed numerical issues in bound widening of variable bound constraint handler and vbound propagator during conflict analysis
3236@page RN40 Release notes for SCIP 4.0
3238@section RN401 SCIP 4.0.1
3239*************************
3244- added parsing functionality to cardinality constraint handler for CIP format
3245- allow to relax objective limit in reoptimization in presolved stage
3246- suppress excessive printing about numerical troubles in LP on default verblevel (high)
3248Performance improvements
3249------------------------
3251- only accept passed improving solutions in heur_indicator
3252- add and use RESTRICT macro for some pointers
3253- sorting of parents and children for some expression types is now independent of memory layout
3256 - widened a bottleneck in simplifying long signomial sums in a nonlinear constraint
3257 - unified and extended code that improves numerics of cuts generated by nonlinear constraint handlers
3260 - stop separation in cons_indicator after maxsepanonviolated many non violated separated cuts
3261 - improve choice of variable to enter support in separation of cons_indicator
3266### New API functions
3268- SCIPvalidateSolve() to compare solving result with an external primal and dual reference value
3269- SCIPisObjChangedProbing() to check whether the objective function has changed during probing mode
3270- SCIPgetDualSolVal() to get the dual solution value of a constraint
3271- SCIPisLPPrimalReliable() and SCIPisLPDualReliable() to check whether the current primal / dual LP solution
3272 were successfully checked for feasibility
3274### Command line interface
3276- New option in the interactive shell to validate the solution against an external primal and dual reference value
3277- added command line option `-o` and command `validatesolve` in interactive shell
3278 to validate the solution against an external primal and dual reference value.
3280### Interfaces to external software
3282- Updated and new interfaces to Mosek 8.1, GAMS and Gurobi
3283- new LP interface to Glop (Google OR tools); CMake only
3285### Changed parameters
3287- renamed parameter `heuristics/completesol/maxunkownrate` to `heuristics/completesol/maxunknownrate`
3292- add options to make test target (see Makefile section)
3299- New CMake build system alongside the usual Makefile setup
3303- added make options for specifying EXECUTABLE and OUTPUTDIR variables for the make test target
3308- fixed unintended behavior of interrupt signal handler inside SCIP copies
3309- fixed uninitialized values in SCIP's digraph data structure after calling SCIPdigraphResize()
3310- fixed issue related to SCIPcreateFiniteSolCopy() not being able to remove all infinite fixings
3311- fixed issue in SCIPcopyLimits() w.r.t. soft time limit
3312- fixed bug in dynamic resizing of hashtables and hashmaps
3313- added workaround for bug in primal simplex of cplex 12.7.1.0 occuring when attempting to solve LPs without rows without presolving
3314- fixed bug in binpacking example that might have led to doing the same branching several times
3315- fixed memory issue in binpacking example
3316- in GAMS writer, forbid also various parenthesis characters in gams symbol names
3317- added missing definition of `SCIP_UNUSED` in memory.h if def.h is not included
3318- treat reopt bugs: Avoid numerical problems with changing objective; fix check for changed objective
3319- fixed reading issue in mps reader: integer variables fixed to 0 or 1 are treated as binaries now,
3320 allowing to use them as indicator variables
3321- afternode heuristics are now called even if the node limit was reached and the solving process will be stopped
3322 after the current node
3323- fixed bug when activating probing mode with a non-empty separation storage
3326 - fixed guard against using old Gurobi versions in lpi_grb.c: Gurobi 7.5 was not permitted
3327 - fixed wrong handling of unboundedness status in lpi_grb.c
3328 - fixed wrong handling of row basis status in lpi_grb.c
3331 - fixed bug in shift and propagate--variable information with a negation transformation is correctly reset after backtracking
3332 - fixed bug in genvbounds propagator when applying a restart after the root node
3335 - fixed bug in varbound coefficient tightening: if a varbound constraint only contained one variable afterwards,
3336 it may have been deleted without applying the induced bound, if the change was too small, this is now forced
3337 - fixed potential wrong locks update after a varbound constraint became redundant in coefficient tightening
3338 - fixed potentially wrong cleanup of fixed variables in nonlinear constraint handler
3339 - fixed memory leak in OSiL reader when using SOS constraints
3342 - improved handling of infinite values in a primal solution in quadratic and nonlinear constraints
3343 - fixed bug in computing violation and cut for certain nonlinear constraints when LP solution is slightly out of bounds
3344 - fixed debug solution check that appeared in probing mode when the objective function has changed
3345 - relaxed a too strong assert concerning solutions close to the objective limit
3347@section RN400 SCIP 4.0.0
3348*************************
3353- Introduced support for partial or infeasible user solutions, which SCIP tries to complete/repair heuristically
3354- implemented linear time methods for (weighted) median selection for joint arrays of various types
3355- added adaptive solving behavior of SCIP based on solving phases and heuristic transitions, if enabled via `solvingphases/enabled`
3356- can now solve relaxations within probing
3357- in case of multiple relaxators the best solution is saved instead of the last one
3358- added write callback for reader_bnd
3359- added possibility to use a reference value for advanced analysis of the tree search. If a finite reference value
3360 (an objective value in original objective space) is passed via misc/referencevalue, SCIP keeps track of the
3361 number of nodes exceeding the reference value and the number of early backtracks -- path switches in the tree when
3362 a child node with lower bound smaller than the reference value was available.
3363- added reading capabilities for partial solutions with extension *.mst
3364- new global shift off all random seeds (randomization/randomseedshift) and unification of all existing random seeds
3365- use new macros SCIPdebugMsg(), SCIPsetDebugMsg(), SCIPstatDebugMsg() at all places where it makes sense
3366- new random number generator in pub_misc.h
3367- add check whether variables have been released when freeing SCIP
3368- a print callback can now be specified for user expressions
3371 - will now enforce relaxation solution instead of lp or pseudosolution if lowerbound is better and the whole lp is included in the relaxation
3372 - new feature solution polishing to improve integrality of LP solutions
3375 - new constraint handler for cardinality constraints
3376 - added interval-evaluation of sine and cosine
3377 - allow to create constraints of constraint handlers that don't need constraints
3378 - New constraint handlers cardinality and components
3381 - implement a storage for conflicts to have more control over active conflicts
3382 - Improved conflict analysis through central conflict pool and dual ray analysis for primal infeasible LPs; can now analyze dual
3383 unbounded rays of primal infeasible LPs
3386 - New presolvers that disaggregate SOC constraints and reformulate QP's by adding KKT conditions
3387 - new presolving step for variables contained in a single quadratic constraint with proper square coefficients
3388 - add new presolving step to disaggregate second order cone constraints
3389 - new presolving method presol_qpkktref to add the KKT conditions of a QP
3390 - implemented and extended stuffing presolving in linear constraint handler
3391 - new components constraint handler which replaces the components presolver; it searches for independent subproblems
3392 and solves small ones as sub-SCIPs during presolve, larger ones are solved alternatingly during the main solving process
3393 - new presolving timing FINAL: presolving methods with this timing are only called once after all other presolvers with timings
3394 FAST, MEDIUM and EXHAUSTIVE are finished; during this timing only reductions are allowed that are self-contained, e.g.,
3395 fixing all variables and deleting all constraints of an independent component; note that reductions found in this timing
3396 do not trigger a new presolving round
3398- Separation and Cuts:
3399 - can now separate perspective cuts for indicator constraints
3400 - add sepa_convexproj, a separator which projects onto convex relaxation and build gradient cuts at the projection
3401 - add sepa_gauge, a separator which computes an interior point of a convex relaxation and performs a binary search in the segment joining
3402 the interior point and the point to separate until it finds a point in the boundary of the feasible region where to build a gradient cut
3403 - changed handling of coupling constraints in cons_indicator; the cuts will not be added to the pool, but are separated by default
3404 - concurrent solving mode that allows to run multiple SCIP instances, that share solutions and global variable bounds, in parallel
3405 - Revised pseudo random number generation and introduced central random seed for all plugins
3408 - new Graph induced neighborhood search (GINS) primal heuristic that uses neighborhoods
3409 based on distances in the variable constraint connectivity graph.
3410 In addition, the heuristic supports a rolling horizon-like procedure to solve auxiliary problems
3411 for neighborhoods with increasing distance from the starting neighborhood.
3412 - new primal heuristic LP face that tries to find an integer solution inside the optimal LP face.
3413 - new heuristic that tries to complete partial solutions
3414 - the subnlp heuristic now gives ownership of a found solution to the heuristic that constructed the starting point, if any;
3415 as a consequence, MIP heuristics may now be shown more frequently for having found a solution when solving MINLPs, even
3416 though the solutions required an additional NLP solve
3417 - new multistart heuristic for NLPs
3420 - add prop_nlobbt, a nonlinear optimization-based bound propagator solving two convex NLP relaxations for each variable
3421 - nodes can now be postponed; currently, this can only be triggered by BEFORELP propagation callbacks
3424 + Extended statistic output displayable via the interactive shell
3425 + new statistic computed: `Root LP Estimate` that shows the root LP best-estimate with every pseudo-cost update
3426 + added leaf statistics about LP objective limit|feasible|infeasible leaves to the statistics output and
3427 to the callable library: SCIPgetNObjlimLeaves(), SCIPgetNFeasibleLeaves(), SCIPgetNInfeasibleLeaves()
3428 + next to the number of found solution, also the number of new best solutions is now printed for each heuristic
3429 (and relaxation solutions) in the statistics in the `Primal Heuristic` section.
3431Performance improvements
3432------------------------
3434- Extended the presolving timings by an additional timing FINAL for self-contained reductions
3435- Randomized tie-breaking in different parts of the code to reduce performance variability
3436- use connectedness information of the clique table to speed up the clique partitioning algorithm
3437- knapsack approximation algorithms use linear-time weighted median selection instead of sorting
3438- improved greedy solution in SCIPsolveKnapsackApproximatelyLT() for the flow cover separation
3439- reduce performance variability by using random numbers as tie-breaker for external branching candidates
3442 - adjusted most Large Neighborhood Search heuristics such that they collect their variable fixings first in an array,
3443 and only create and populate a sub-SCIP if enough variables will be fixed.
3444 - reduce performance variability by using a small perturbation in the undercover heuristic
3445 - 1-opt heuristic can now be repeatedly executed as long as new incumbents are found
3448 - Improved and extended stuffing inside of linear constraint handler
3449 - Changed handling of coupling constraints in cons_indicator
3450 - SCIP supports constraint compression for problem copies; constraint compression denotes the immediate
3451 removal of fixed variables from constraint data at creation time to reduce memory requirements.
3454 - rewrote the propagate-and-cut-and-price loop so that successful propagations with DURINGLPLOOP timing, bound changes found by separation,
3455 and new primal solutions now trigger a new round of node solving, starting with propagation; improved tuning of propagation and heuristic timings
3456 - tuned propagation methods of several constraint handlers
3457 - make more use of SCIPmarkConsPropagate() to mark constraints for propagation and improved the internal handling of marked constraints
3458 - improve propagation of absolute-value expression in the case that the sign of the argument is fixed
3463### New and changed callbacks
3466 - extended interface to support concurrent solving mode
3468- Constraint Handlers:
3469 - new optional callback `CONSENFORELAX` to enforce a relaxation solution, see \ref CONS
3470 - `CONSINITLP` callback now has a new parameter `infeasible`, which is a pointer to store whether infeasibility
3471 was detected while building the initial LP relaxation
3473### Deleted and changed API methods
3475- setting a parameter to a non-valid value now produces an error message instead of a warning
3476- bound reader uses angle bracket around variable names
3477- the parameters of SCIPlpiChgObj(), SCIPlpiSetBase(), SCIPlpiSetState(), SCIPlpiSetNorms() have been declared as const
3478- SCIPapplyHeurSubNlp() can now return the solution found by the sub-NLP heuristic
3481 - methods SCIPrandomGetInt() substitutes SCIPgetRandomInt() (marked to be deprecated)
3482 - methods SCIPrandomGetReal() substitutes SCIPgetRandomReal() (marked to be deprecated)
3483 - methods SCIPrandomPermuteArray() substitutes SCIPpermuteRandomArray() (marked to be deprecated)
3484 - methods SCIPrandomPermuteIntArray() substitutes SCIPpermuteRandomIntArray() (marked to be deprecated)
3485 - method SCIPrandomGetSubset() substitutes SCIPgetRandomSubset() (marked to be deprecated)
3488 - added parameters `conftype` and `iscutoffinvolved` to SCIPinitConflictAnalysis()
3489 that indicate the type of the conflict and whether the current cutoff bound is used or not
3491- Constraint Handlers:
3492 - added parameter `infeasible` to SCIPinitlpCons()
3495 - added parameters `fixedvars`, `fixedvals`, `nfixedvars` to SCIPcopyVars()
3496 - added parameters `fixedvars`, `fixedvals`, `nfixedvars` to SCIPcopyOrigVars()
3497 - renamed parameter `success` to `valid` in SCIPgetConsCopy()
3499- Hashmap and Hashtable:
3500 - removed function SCIPcalcHashtableSize() since not required anymore for `SCIP_HASHTABLE` and `SCIP_HASHMAP`
3501 - based on the initial size `SCIP_HASHTABLE` and `SCIP_HASHMAP` choose an appropriate size internally to allow insertion of that
3502 many elements without resizing
3503 - `SCIP_MULTIHASH` behaves like the old `SCIP_HASHTABLE` and SCIPcalcMultihashSize() should be used as replacement for
3504 SCIPcalcHashtableSize()
3506- Nonlinear Relaxation:
3507 - added parameter `curvature` to SCIPcreateNlRow()
3510 - the following new methods return a bool indicating whether the given value is valid for the parameter instead of printing a warning
3511 message and returning an error code if the value is invalid
3512 - renamed method SCIPcheckBoolParam() to SCIPisBoolParamValid()
3513 - renamed method SCIPcheckLongintParam() to SCIPisLongintParamValid()
3514 - renamed method SCIPcheckCharParam() to SCIPisCharParamValid()
3515 - renamed method SCIPcheckStringParam() to SCIPisStringParamValid()
3516 - renamed method SCIPcheckRealParam() to SCIPisRealParamValid()
3517 - in param.c/h: the new methods return a bool whether the given value is valid for the parameter instead of printing a warning message
3518 and returning an error code if the value is invalid
3519 - rename SCIPparamCheckBool() to SCIPparamIsValidBool()
3520 - rename SCIPparamCheckString() to SCIPparamIsValidString()
3521 - rename SCIPparamCheckChar() to SCIPparamIsValidChar()
3522 - rename SCIPparamCheckLongint() to SCIPparamIsValidLongint()
3525 - added parameter `initialseed` to SCIPcreateDiveset()
3526 - introduced new type `SCIP_HEURTIMING` for primal heuristic timing masks
3527 - changed type of parameter `timingmask` from unsigned int to `SCIP_HEURTIMING` in SCIPincludeHeur(), SCIPincludeHeurBasic()
3530 - new parameter `includeslp` for SCIPincludeRelax() and SCIPincludeRelaxBasic()
3531 to indicate whether relaxation includes all linear rows and can be enforced
3534 - rename method SCIPgetReopSolsRun() to SCIPgetReoptSolsRun()
3537 - added parameter `completely` to SCIPtrySol(), SCIPtrySolFree(), SCIPcheckSol() to check all constraints when
3541 - removed SCIPvarGetLbAtIndex() and added SCIPgetVarLbAtIndex()
3542 - removed SCIPvarGetUbAtIndex() and added SCIPgetVarUbAtIndex()
3543 - removed SCIPVarGetBdAtIndex() and added SCIPgetVarBdAtIndex()
3544 - removed SCIPvarWasFixedAtIndex() and added SCIPgetVarWasFixedAtIndex()
3545 - Removed method SCIPvarGetNBinImpls()
3547### New API functions
3549- added functions for concurrent solving mode (see concurrent.h, concsolver.h)
3550- SCIPcreateNlpiProb(), SCIPupdateNlpiProb() and SCIPaddNlpiProbRows() to create and update a nonlinear relaxation
3551- SCIPgetNObjlimLeaves(), SCIPgetNFeasibleLeaves(), SCIPgetNInfeasibleLeaves() for statistics output
3552 about LP objective leaves
3553- SCIPcheckCopyLimits() which can be used to check that enough time and memory is left to run a sub-SCIP after
3554 subtracting time and memory used by the main-SCIP and SCIPcopyLimits() which copies these limits accordingly and disables
3555 all other limits (need to be set by the plugin, if needed)
3556- SCIPcopyLargeNeighborhoodSearch() in heuristics.h that supports compressed copying and two kinds of problem copy: the MIP-relaxation or
3557 a 1-1 problem copy (by copying the constraints and not the LP relaxation)
3558- SCIPsolveProbingRelax() to solve a relaxation within probing
3559- SCIPgetLastStrongbranchingLPSolstat() to query the LP statuses after strong branching on a variable
3560- SCIPinitializeRandomSeed()
3561- SCIPswapReals() to swap two real values
3562- SCIPgetNNZs() to get the number of active non-zeros in the transformed/presolved problem
3565 - SCIPprintDebugMessage(), SCIPsetPrintDebugMessage(), SCIPstatPrintDebugMessage() that output debug messages and also print the
3566 subscip depth; the first two output via the message handler; also added macros SCIPdebugMsg(), SCIPsetDebugMsg(), SCIPstatDebugMsg()
3567 - SCIPdebugMsgPrint()/SCIPsetDebugMsgPrint() that output a message without `[debug]` prefix via the message handler (compare SCIPdebugPrintf())
3570 - SCIPisDualSolAvailable() to query the dual solution availability
3571 - SCIPlpiSetIntegralityInformation() to improve SoPlex' solution polishing
3574 - library methods SCIPcopyConsCompression(), SCIPcopyOrigConsCompression() that accept an array of variables that are immediately
3575 fixed in the copy. Alternatively, local instead of global bounds can be used for compression.
3576 - library methods SCIPenableConsCompression(), SCIPisConsCompressionEnabled(), SCIPcopyConsCompression(), SCIPcopyOrigConsCompression()
3577 - SCIPgetIntVarXor() to access integer variable of XOR constraints
3578 - SCIPcreateConsCardinality() to create a cardinality constraint
3579 - SCIPcreateConsBasicCardinality() to create a basic cardinality constraint
3580 - SCIPchgCardvalCardinality() to changes cardinality value of cardinality constraint (i.e., right hand side of cardinality constraint)
3581 - SCIPaddVarCardinality() to add a variable to a cardinality constraint
3582 - SCIPappendVarCardinality() to append a variable to a cardinality constraint
3583 - SCIPgetNVarsCardinality() to get the number of variables in a cardinality constraint
3584 - SCIPgetVarsCardinality() to get the array of variables in a cardinality constraint
3585 - SCIPgetCardvalCardinality() to get the cardinality value of a cardinality constraint (i.e., right hand side of cardinality constraint)
3586 - SCIPgetWeightsCardinality() to get the array of weights of a cardinality constraint
3587 - SCIPgetLinvarMay{Decrease,Increase}Quadratic() to get index of a variable in linear term of quadratic constraint that may be decreased
3588 without making any other constraint infeasible
3591 - add SCIPparamIsValidInt() and SCIPparamIsValidReal() to param.c/h
3592 - add missing functions SCIPisIntParamValid() and SCIPisRealParamValid() to scip.c/h
3594### Command line interface
3596- new command line parameter `-v` to print detailed build options
3598### Interfaces to external software
3600- Interfaces for Python and Java are, among others, now available via http://www.github.com/scip-interfaces
3601- Revised documentation of the SCIP C-API to group methods more comprehensively by topics
3602- dropped support for Ipopt < 3.11
3603- Additional I/O-functionalities for debugging and logging in SCIP and in the AMPL interface
3604- updated CppAD to 20160000
3605- for users of the ampl interface, the display/logfile option has been added to set the name of a
3606 file to write the SCIP log to (additionally to stdout)
3609 - SCIP uses the lpi_spx2 interface by default
3610 - Improved Gurobi interface that can handle ranged rows (requires Gurobi >= 7.0.2)
3611 - the CPLEX LPI now also compiles with CPLEX 12.7.0.0
3613### Changed parameters
3615- setting a value for a fixed parameter will no longer return with an error, if the new value equals the one to which the parameter is fixed
3616- changed value of parameter `separating/clique/cliquedensity` to 0.0 such that the separator always constructs a dense clique table
3617 which proved to be faster on the benchmarks MMM and stableset.
3618- parameters `misc/permutationseed`, `misc/permuteconss` and `misc/permutevars` changed to `randomization/permutationseed`,
3619 `randomization/permuteconss` and `randomization/permutevars`
3620- parameters `conflict/useinflp` and `conflict/useboundlp` are now of type char (before bool)
3621- all parameters of the components presolver (starting with `presolving/components/`) are now parameters of the components
3622 constraint handler (starting with `constraints/components/`)
3626- class randomization
3627- `branching/sumadjustweight` to adjust branching scores by adding a sum epsilon in order to keep score differences
3628 near zero, which are otherwise completely disregarded (they are adjusted to at least sum epsilon)
3629- `concurrent/∗ ` and `parallel/∗ ` for configuring the concurrent solving mode
3630- `constraints/cardinality/branchbalanced` to decide whether to use a balanced branching scheme in the enforcing of cardinality
3632- `constraints/cardinality/balanceddepth` to set the maximal depth until balanced branching is turned off
3633- `constraints/cardinality/balancedcutoff` to determine that balanced branching is only used if the branching cut off value
3634 w.r.t. the current LP solution is greater than a given value
3635- `constraints/indicator/sepaperspective` to turn on separation of perspective cuts for indicator constraints
3636- `constraints/indicator/sepapersplocal` to decide whether local cuts can be used for perspective cuts for indicator constraints
3637- `constraints/quadratic/projectedcuts` to enable convex quadratics to generate gradients cuts at the
3638 projection of the point onto the region described by the constraint, which is supporting
3639- `lp/solutionpolishing` to enable LP polishing only at the root LP or always
3640- `misc/referencevalue` to pass a reference value for further analysis of the tree search, see also in `features`
3641- `presolving/qpkktref/addkktbinary` to allow the presence of binary variables for the KKT update
3642- `presolving/qpkktref/updatequadbounded` to add the KKT conditions to QPs only if all variables are bounded
3643- `presolving/qpkktref/updatequadindef` to add the KKT conditions to QPs only if the quadratic matrix is indefinite
3644- `randomization/lpseed` to set the initial seed of the LP solver
3645- `solvingphases/enabled` to activate adaptive behavior during the solution process; several further parameters
3646 in the solvingphases-section to control how to switch the parameters and whether a restart should be performed between the phases.
3650- new `SCIP_REGRESSION` data structure in pub_misc.h to incrementally compute a best-fit line through pairs of observations
3651- add maximum branch-and-bound tree depth constant `SCIP_MAXTREEDEPTH` (replaces SCIPgetDepthLimit() and SCIPtreeGetDepthLimit())
3652- new files heuristics.c/heuristics.h to collect methods that are frequently used by heuristics
3653- merged dive.c/pub_dive.h with heuristics.c/heuristics.h, removed dive.c/pub_dive.h
3654- separated header pub_misc.h from repeated methods for sorting and (weighted) median selection;
3655 those are also available in separate headers pub_misc_sort.h
3656 and pub_misc_select.h, but included into pub_misc.h
3661- New unit testing system built on the Criterion framework
3668- All makefiles in `examples/` and `applications/` have been updated.
3669- `make.project` defines a variable `SCIP_VERSION` containing the SCIP version number
3670- revise sub-makefiles for MSVC on MinGW
3671- make shared libraries aware of their dependencies
3672- sub-makefile for CrayXC systems added
3675 - All objective files are now placed in `obj/static` or `obj/shared`, depending on `SHARED=false` or `SHARED=true`, respectively.
3676 - All internal and external libraries are placed in `lib/static` and `lib/shared`, the include files are in `lib/include`.
3677 - The binaries now contain an rpath to the SCIP directory, such that shared libraries are found.
3680 - link binary to shared libs when compiling with `SHARED=true`
3681 - External projects (including make.project) can use the makefile variable LINKCXXSCIPALL or LINKCCSCIPALL to link all SCIP libraries.
3682 - Building with `SHARED=true` automatically generates the combined library libscipsolver.so for easier linking
3685 - Running `make help` lists all makefile options.
3686 - `make install` copies now all header files
3687 - new target `dll` to build Windows dlls with MSVC
3688 - rename `dll` target to `windowslib`
3693- fixed bug in event system: bound change events of the new focus node must be processed, even if the bound
3694 is the same as at the last focus node
3695- avoid numerically unstable (multi-)aggregations
3696- fixed bug in XML reader concerning comments
3697- the AMPL interface now writes a solve status (solve_result_num) into the .sol file
3698- in the cmpres.awk (allcmpres.sh) output, the counts in the time column are now with respect to the
3699 whole set of processed instances (as with fail and solv), while before it was with respect to the
3700 set of instances where no solver failed (eval set); thus, now proc = fail + time + solv.
3701- writing of solutions or parameters to a file now works also with the message handler set to quiet
3702- ignore lower and upper bound tightenigs beyond +/-infinity during solving
3703- time limit of SCIP-infinity is converted to LPI-infinity when setting it
3704- fix LP activity of a row that has been modified
3707 - fixed possible segmentation fault in genvbounds propagator
3708 - fixed bug with sorting of propagators in presolving: the order can be changed by calling probing; thus, there is a copy of the
3709 propagators, which is sorted by presolving priority
3710 - added missing capturing and releasing mechanism in genvbounds propagator
3711 - fix wrong propagation of product expressions
3714 - fixed wrong representation of SOC constraints in NLP
3715 - fixed a few issues within redundant constraint detection of (specialized) linear constraint handlers
3716 - fixed issue in reader_opb concerning writing of fixed variables contained in no constraints
3719 - fixed memory bug in `SCIP_DIGRAPH`
3720 - improved counting of memory consumption by using more block memory and counting all allocated memory
3721 - fix memory leaks in TSP example
3722 - return `SCIP_ERROR` when a memory exception is caught in SoPlex (was `SCIP_LPERROR`)
3723 - fixed memory leak in OSiL reader
3726 - fixed bug while changing the objective value of an original value after transforming the problem
3727 - fixed bug with solutions from previous runs not satisfying an objective limit
3728 - SCIPisObjIntegral() now works correctly in `SCIP_STAGE_PROBLEM`
3731 - fixed two bugs in heur_indicator: use improvesols parameter now and update pointer to indicator constraint handler
3732 - fix wrong NLP representation of logic-or constraints in the dual value heuristic
3733 - correct handling of implicit integer variables with fractional solution value in simplerounding heuristic
3734 - fixed bug in heur_octane with uninitialized ray direction
3736@page RN32 Release notes for SCIP 3.2
3738@section RN321 SCIP 3.2.1
3739*************************
3744- new `force` parameter in (root)redcost propagator to run the propagator also with active pricers
3746Performance improvements
3747------------------------
3749- do not transfer solutions to original space, if SCIP is being freed
3750- modified implication graph analysis of SOS1 constraint handler; a new component allows to deduce zero fixings of variables
3751- made SOS1 constraint handler specific diving selection rule faster for the case that the SOS1 constraints do not overlap
3752- improved disjunctive cuts by the `monoidal cut strengthening` procedure of Balas and Jeroslow
3754Examples and applications
3755-------------------------
3757- several improvements of SCIP-Jack (STP application): extended presolving for STP variants, STP-specific branching
3758 rule, dual heuristic to generate initial LP relaxation
3759 SCIP-Jack is now competitive with problem specific state-of-the-art solvers on several well-known STP variants,
3760 e.g., the (rooted) prize-collecting Steiner tree problem.
3761- MultiObjective application renamed to PolySCIP; several improvements: better command line argument processing,
3762 overhaul of much of the source code, installation via CMake
3767- made debug solution functionality thread safe (see debug.h for further information)
3769### Deleted and changed API methods
3771- add SCIPcomputeHyperplaneThreePoints() to compute a hyperplane containing three given 3-dimensional points
3772- SCIPsolveLinearProb() now uses a 1-dimensional matrix representation
3774### Command line interface
3776- added interactive shell command `display finitesolution` to print solution with infinite fixings removed,
3777 added reference to that method to `display solution` output if there are infinite fixings
3778- new interactive shell command `write history` to write the command line history (only when compiled with Readline)
3780### Interfaces to external software
3782- significantly improved Python interface to support user callbacks as well as linear and quadratic expressions
3786- `constraints/sos1/branchingrule` to decide whether to use neighborhood, bipartite, or SOS1 branching (this parameter
3787 replaces the old parameters `constraints/sos1/neighbranch`, `constraints/sos1/bipbranch`, and `constraints/sos1/sos1branch`)
3788- `constraints/sos1/depthimplanalysis` to limit the number of recursive calls of implication graph analysis
3789- `constraints/sos1/perfimplanalysis` to perform an implication graph analysis to deduce variable fixings and
3790 additional SOS1 constraints (this parameter replaces the old parameter `constraints/sos1/updateconflpresol`)
3791- `misc/transsolorig` for transfering transformed solutions to the original space (default: true)
3792- `propagating/rootredcost/onlybinary` to propagate root reduced costs of binary variables only
3796- renamed MIP matrix structure to `SCIP_MATRIX`
3797- changed the numeric values for `PRESOLTIMING` flags
3804- new target `dll` to build Windows dlls with MSVC
3805- add new compiling flag OPENSOURCE to allow/forbid the usage of third party software
3810- fixed wrong objective sense when copying the original problem
3811- fixed a bug in merge step of cliques during clean up phase; method did not correctly handle infeasibility in the case of multiple
3812 variable-negation pairs
3813- fixed a previously untreated case in the linear cons simplification where coefficients only differ by slightly more than an epsilon
3814- fixed bug in parsing emphasis parameters which formerly led to completely wrong results
3815- fixed bug in the computation of the Wilcoxon test
3816- do not use the relative and absolute gap limit if no primal solution has been found so far
3817- fixed bug in conflict.c with wrong reset of bounds used
3818- fixed bug with transferring solutions to new runs (need to recompute objective before checking)
3819- fixed issue with infinite values when checking cuts for redundancy
3820- fixed library problems on Windows operating systems
3823 - fixed wrong check when computing cuts for factorable quadratic functions bound tightening of a single variable
3824 - fixed wrong handling of loose variables in OBBT
3825 - fixed freeing of hash for binary variables
3826 - fixed bug during the computation of branching points for continuous variables which are almost fixed to +/- SCIPinfinity()
3827 - treated the case of integer variables as intermediate variables in the process of obtaining the active variable for a
3828 given binary variable
3831 - fixed a bug in dive.c that occurred when lpsolvefreq was set to 1; after a cutoff, the solution values of the
3832 linked LP solution might have become invalid
3833 - do not analyse an infeasible LP for conflicts during diving mode when LHS/RHS of rows were changed
3834 - use LPi infinity when reverting bound changes in conflict analysis
3837 - fixed bug in heur_simplerounding in connection with relaxators
3838 - fixed bug in feaspump heuristic where last solution candidates were not updated correctly
3839 - fixed bug with infinite shift values in heur_shifting
3840 - fixed bug in shiftandpropagate heuristic: the heuristic did not correctly handle intermediate, global bound changes of the selected variable
3841 after its tentative fixing led to a cutoff.
3844 - (root) reduced cost propagators are not run anymore when doing branch-and-price,
3845 since they may install upper bounds on variables which might interfere with the
3846 pricing (they may be enabled again by their force parameters)
3847 - fixed too hard assertion in pseudoobj propagator
3848 - fixed a bug in shiftandpropagate where column positions after sorting are now correctly linked to their variables after sorting
3849 - fixed potential memory leak in genvbound propagator
3852 - fixed inconsistency in knapsack constraint handler data during presolving
3853 - fixed some problem with reoptimization when the problems are infeasible or have been solved in presolving
3854 - fixed endless loop in knapsack constraint handler when continuous variables change their types to binary during presolving
3855 - squares of binary variables might not have been replaced by the binary variable itself in presolve,
3856 if the variable was originally general integer and only became binary during presolve (due to bound tightening)
3857 - fixed bug in dive.c avoiding a check of constraints in the presence of indicator constraints
3860 - fixed numerical problems in computation of cuts for bivariate functions in quadratic constraint handler
3861 - fixed bug in quadratic constraint handler when computing lifted-tangent inequalities
3862 - fixed bug in nonlinear constraint handler when replacing a violated nonlinear constraint leads to an infinite
3863 - fixed bug in SOS1 constraint handler with inconsistent data structure after restart
3864 - fixed wrong handling of negated variables in bound tightening procedure of SOS1 constraint handler
3865 - fixed bug in simple fixing heuristic of SOS1 constraint handler
3866 - fixed two bugs in pseudoboolean constraint handler with wrong sorting of and constraints
3867 - fixed issue: constraints being parallel to objective function (after restart) sometimes led to wrongly stating infeasible
3868 - fixed bug during coefficient tightening in varbound constraint handler
3869 - handle cutoffs in cons_indicator detected by infeasible inequalities
3870 - fixed late change of type of slack variables in cons_indicator, if the bounds are not integral
3871 - fixed initsol and exitsol of cons_indicator, if problem has already been solved
3872 - fixed bug in cons_indicator with changing type of slackvariable
3874@section RN320 SCIP 3.2.0
3875*************************
3880- added reoptimization feature for optimization problems with changed objective function or tighter feasible region
3881- the original problem can now be permuted directly after reading (if `misc/permutationseed` has value >= 0)
3882- added methods to compute strongly connected components with Tarjan's Algorithm
3883- added method to propagate implications of SOS1 variables
3884- convex quadratic contraints can now generate gradient cuts which are supporting to the feasible region
3885- SoPlex interface can now (re)store dual steepest edge weights
3886- extended expression parsing to support power, realpower and signpower operators; started support for user-defined operators
3887 in expression trees/graphs
3888- possibility to set a soft time limit which becomes active only after the first primal solution was found
3889- added matrix module for getting access to the internal mixed inter linear problem matrix
3890- better handling of large values returned by the LP solver
3891- added more checks to SCIP{alloc,realloc,duplicate}BufferArray() to handle overflows properly
3892- new plugin for reoptimizing a sequence of optimization problem that differ in the objective function, e.g., sequences arising from
3894- new plugin `compr` for rearranging the search tree, currently this only works on the reoptimization tree
3895- moved assertions in comparison methods from scip.c to set.c
3898 - we can now upgrade quadratic constraints with one bilinear term to SOC constraints
3899 - we can also upgrade general quadratic constraints with a single negative eigenvalue to SOC constraints
3902 - tighter reliability notions introduced for reliability branching, based on pseudo-cost relative errors
3903 and comparing candidates with the best pseudo-candidate using a 2-sample student-T test. These methods
3904 are used in disjunction with the existing reliability notion that uses a fixed number as reliability
3905 threshold for every variable before turning off strong-branching. This means, the classical method
3906 must be turned off by setting parameters minreliable and maxreliable to 0. The behavior is
3907 controlled through several parameters.
3908 - new distribution branching rule to base decisions on row activity (normal) distribution over domain space
3909 - can now output information for BAK: Branch-and-bound Analysis Kit
3910 - new score in hybrid reliability pseudocost branching that prefers nonlinear variables when solving MINLPs
3911 - new branching rule multaggr which allows to branch on general disjunctions defined by fractional multi-aggregated variables
3912 - new branching rules for SOS1 constraints for branching on a neighborhood or a complete bipartite subgraph of
3913 the conflict graph. In addition to variable domain fixings, it is sometimes also possible to add complementarity
3914 constraints to the branching nodes. This results in a nonstatic conflict graph, which may change dynamically
3915 with every branching node.
3916 - new branching rule nodereopt to reconstruct the tree after changing the objective function
3919 - the MPS reader can now read semi-integer variables, they are handled by creating bound disjunction constraints
3920 - the MPS reader can now handle objective constants given as (the negation of) the RHS of the objective row
3923 - obbt propagator applies now additional separation and propagation in order to learn stronger and more bound tightenings
3924 - extended probing mode to allow separation and objective coefficient changes
3925 - improved separation procedure of SOS1 constraint handler, including bound (clique) cuts and implied bound cuts
3926 - new disjunctive cut separator for SOS1 constraints
3927 - new edge-concave cut separator for quadratic constraints
3930 - Improved coordination of presolvers. There are three timings for presolvers now, FAST, MEDIUM and EXHAUSTIVE.
3931 Each presolving callback can specify one or more of these timings in which it will be called later.
3932 Within a presolving method, the current timing can be checked and the algorithms to be performed selected based on
3933 the timing. In one presolving round, first all presolving methods with timing FAST are called, sorted by priority.
3934 If they found enough reductions, a new round is started, otherwise, all presolving methods with timing MEDIUM are
3935 called. Again, with enough reductions, a new presolving round is started, too few reductions lead to running
3936 the EXHAUSTIVE presolvers. Similar to the delay concept used before, we are not neccessarily running all EXHAUSTIVE
3937 presolvers but stop as soon as one of them found enough reductions, starting a new presolving round immediately.
3938 - new presolving components for SOS1 constraints, including bound tightening and clique extension
3939 - new presolver tworowbnd for improving variable bounds and detecting redundant constraints added
3940 - new presolver dualagg for aggregating single up-/downlocked variables by a binary variable added
3941 - new presolver implfree for aggregating implied free variables added
3942 - new presolver redvub which can detect redundant variable upper bound constraints added
3943 - new presolver stuffing for fixing of singleton continuous variables added
3946 - improved clique and variable bound heuristics
3947 - new heuristic distribution diving that bases its score function on the changes regarding solution density
3948 - variable histories can be transferred between sub-SCIPs solved by LNS heuristics and the component presolver
3949 and the main SCIP to reuse this information.
3950 - new heuristic heur_indicator that tries to make partial solutions with indicator constraints feasible. It also
3951 tries to improve them (or external solutions) by a one-opt local search.
3952 - new heuristic (heur_bound) which fixes all integer variables to their lower/upper bounds and solves the remaining LP
3953 - modified diving heuristics to handle SOS1 constraints
3954 - new primal heuristic for reoptimization 'ofins': objective function induced neighborhood heuristic
3955 - new heuristic for reoptimization which constructs solutions based in the changes between the objective function and the optimal
3956 solution before changing the objective function
3959 - extended variable branching statistics in the interactive shell by sample variance of unit gains
3960 - extended statistic output of interactive shell by more information on diving heuristic behavior
3962Performance improvements
3963------------------------
3965- improved treatment of nonlinearities in hybrid reliability pseudo cost branching
3966- using sparsity information of the SoPlex LP
3969 - improved vartype upgradability from continuous to implicit variables in cons_linear.c, depending on their objective coefficients
3970 - improved propagation of SOS1 constraint handler using the information from a conflict
3973 - zi rounding heuristic uses buffer data structures, thereby decreasing total memory usage of SCIP
3974 - adjusted (hard) diving heuristics to solve fewer LPs. LP's are resolved only if a parameter-defined
3975 percentage of the variable bounds changed through domain propagation or at a predefined frequency.
3976 - some of the diving heuristics additionally consider indicator variables and SOS1 variables as candidate variables and try to
3977 make these constraint types feasible before passing a rounded solution to SCIPtrySol()
3980 - new presolving/propagation algorithm using the gcd for ranged rows and equations in cons_linear
3981 - added presolving levels (FAST, MEDIUM and EXHAUSTIVE) to allow better balancing of presolvers
3984 - improved separation procedure of SOS1 constraint handler
3985 - improved separation procedure for convex quadratic constraints
3987Examples and applications
3988-------------------------
3990- two new applications for multi-objective optimization (PolySCIP) and the Steiner Tree Problem in Graphs
3991- new application for solving Steiner tree problems: SCIP-Jack can handle both the classical Steiner tree problem in graphs
3992 and 10 of its variants
3997### New and changed callbacks
3999- new callback function `SCIP_DECL_CONSGETDIVEBDCHGS` to provide
4000 constraint handler method to suggest dive bound changes during the generic diving algorithm, see type_cons.h for details
4001- new callback `SCIP_DECL_DIVESETGETSCORE` to implement scoring function to guide diving
4003### Deleted and changed API methods
4005- avoid potential comparisons of different infinity values by adjusting the LP solution value
4006- SCIPintervalSign(), SCIPintervalAbs(), SCIPintervalMax(), SCIPintervalMin(), SCIPexprgraphGetNodePolynomialMonomialCurvature(),
4007 and SCIPexprgraphTightenNodeBounds() need an infinity value to decide whether an interval is empty or not
4008- SCIPgetFeasibilityQuadratic() and SCIPgetActivityQuadratic() returns now a `SCIP_RETCODE` and needs an additional `SCIP_Real*` to
4010- methods which support statistical tests in pub_misc.h, SCIPstudentTGetCriticalValue(), SCIPcomputeTwoSampleTTestValue() etc.
4011- SCIPsolveLinearProb() solves a linear problem of the form Ax=b for a regular square matrix A
4012- Added parameter `freesubscip` to SCIPapplyProximity()
4015 - Renamed method SCIPdigraphGetSuccessorsDatas() to SCIPdigraphGetSuccessorsData()
4016 - Renamed method SCIPdigraphGetNodeDatas() to SCIPdigraphGetNodeData()
4017 - Renamed method SCIPdigraphSetNodeDatas() to SCIPdigraphSetNodeData()
4019- Constraint Handlers:
4020 - Renamed method SCIPconshdlrGetPropTimingmask() to SCIPconshdlrGetPropTiming()
4021 - new method SCIPconshdlrSetPropTiming()
4022 - Removed method SCIPconshdlrIsPresolvingDelayed()
4023 - Removed method SCIPconshdlrWasPresolvingDelayed()
4024 - SCIPmakeSOS1sFeasible() based on solution values, fixes variables to zero to turn all SOS1 constraints feasible
4025 - removed `delay(presol)` parameter from SCIPinclude{Conshdlr,Presol,Prop}() and added `(presol)timing` parameter
4026 - new parameter `presoltiming` for method SCIPpresolCons()
4027 - SCIPvarIsSOS1() returns whether some variable is involved in an SOS1 constraint
4028 - SCIPgetConflictgraphSOS1() gets conflict graph of SOS1 constraints
4029 - Added parameter `presoltiming` to SCIPpropCumulativeCondition()
4030 - Removed parameter `delaypos` from SCIPsetConshdlrPresol()
4031 - Added parameter `presoltiming` to SCIPsetConshdlrPresol()
4032 - Removed parameter `delaypos` from SCIPincludeConshdlr()
4033 - Added parameter `presoltiming` to SCIPincludeConshdlr()
4034 - Added parameter `consgetdivebdchgs` to SCIPincludeConshdlr() to provide a divebdchg-callback for the constraint handler
4038 - Added parameter `forcestrongbranch` to SCIPselectVarStrongBranching()
4039 - Added parameter `executebranching` SCIPexecRelpscostBranching()
4040 - Added parameters `ndomredsdown` and `ndomredsup` to SCIPgetVarStrongbranchWithPropagation()
4042- LP and Cutting Planes:
4043 - Added parameters `inds` and `ninds` to SCIPgetLPBInvRow(), SCIPgetLPBInvCol(), SCIPgetLPBInvARow(), SCIPgetLPBInvACol(), and
4045 - Added parameters `maxweight`, `weightinds`, `nweightinds`, and `rowlensum` to SCIPcalcMIR()
4048 - SCIPvarGetNodeSOS1() returns node of SOS1 variable in the conflict graph
4049 - SCIPnodeGetVarSOS1() returns SOS1 variable associated to some given node in the conflict graph
4050 - Removed method SCIPvarGetNBinImpls()
4053 - Removed parameter `delaypos` from SCIPincludePresolBasic()
4054 - Added parameter `presoltiming` to SCIPincludePresolBasic()
4055 - Removed parameter `delaypos` from SCIPincludePresol()
4056 - Added parameter `presoltiming` to SCIPincludePresol()
4057 - Removed parameters `presoldelay` and `presoltiming` from SCIPincludePresol()
4058 - Removed parameters `presoldelay` and `presoltiming` from SCIPsetPropPresol()
4061 - Added parameter `isequation` to SCIPaddClique()
4062 - Removed parameter `writeimplications` from SCIPwriteCliqueGraph()
4063 - Removed method SCIPallocBufferSize()
4064 - Removed method SCIPduplicateBufferSize()
4065 - Removed method SCIPreallocBufferSize()
4066 - Removed method SCIPfreeBufferSize()
4067 - Removed method callback SCIPdialogExecConflictgraph()
4069### New API functions
4071- started support for user-defined operators in expression trees/graphs (see SCIPexprCreateUser()),
4072 interface will likely change again in future SCIP versions
4073- new methods for mixed inter linear matrix access (see pub_matrix.h) added
4074- SCIPcomputeArraysIntersection() to compute the set intersection of two ordered arrays
4075- SCIPcomputeArraysSetminus() to compute the set difference of two ordered arrays
4076- SCIPcutGetLPActivityQuot() in pub_cutpool.h to get the potion of LP's where this cut was sharp in an optimal basis.
4077- SCIPpresolGetTiming(), SCIPpresolSetTiming(), SCIP{conshdlr,prop}GetPresolTiming(), and SCIP{conshdlr,prop}SetPresolTiming()
4078- SCIPdigraphSetNSuccessors() sets the number of successors of some digraph node to a given value
4081 - SCIPcreateDiveset() to add a diveset to a heuristic. Heuristics may have multiple divesets under different names
4082 - SCIPperformGenericDivingAlgorithm() that performs diving with periodic LP resolve according to the diveset argument.
4085 - new setter function SCIPsetConshdlrGetDiveBdChgs() in scip.h to set dive bound change callback for this constraint handler
4086 - SCIPaddDiveBoundChange() to add a diving bound change to the diving bound change storage of SCIP together with the information if this is a
4087 bound change for the preferred direction or not, to be used by constraint handlers inside the getDiveBdChgs-callback
4088 - SCIPchgCoefLinear() and SCIPdelCoefLinear() to modify linear constraint during problem creation
4091 - BMSallocClearBlockMemoryArray()/SCIPallocClearBlockMemoryArray() and
4092 BMSallocClearBufferMemoryArray(), SCIPallocClearBufferArray() to allocate arrays that are initialized to 0
4093 - SCIPbuffermem() to get buffer memory;
4096 - added new sorting functions SCIPsortRealRealRealBoolBoolPtr(), SCIPsortDownRealRealRealBoolBoolPtr()
4097 - added new sorting functions SCIPsortIntIntIntReal(), SCIPsortDownIntIntIntReal(), SCIPsortRealIntInt(), SCIPsortDownRealIntInt()
4100 - SCIPwriteParam() to write a single parameter to a file
4101 - SCIPcheckParam{Bool,Char,...}() to check whether a parameter value is within the feasible domain
4104 - SCIPchgLhsQuadratic(), SCIPchgRhsQuadratic(), SCIPchgLinearCoefQuadratic(), SCIPchgSquareCoefQuadratic(),
4105 and SCIPchgBilinCoefQuadratic() to modify quadratic constraints during problem creation
4106 - SCIPgetFeasibilityQuadratic() and SCIPgetActivityQuadratic() to get the feasibility and activity of a quadratic constraint in a given solution
4107 - SCIPaddSquareLinearization(), SCIPaddSquareSecant(), SCIPaddBilinLinearization() and SCIPaddBilinMcCormick()
4108 in cons_quadratic.h to compute linear under- and overestimation for bilinear and quadratic terms
4110### Command line interface
4112- extended variable branching statistics and statistic output in the interactive shell (see Statistic section)
4113- submenu for setting `vbc` settings renamed to `visual`
4114- at the end of a command line run the best solution can now be output in the orignal space
4116### Interfaces to external software
4118- in the AMPL interface, variable and constraint attributes (flags) can now be set via suffixes, where 0 (unset) stands
4119 for the default, 1 for TRUE and other values for FALSE; see SCIPcreateVar() and SCIPcreateCons() for their meaning;
4120 for variables, `initial` and `removable` are recognized;
4121 for constraints, `initial`, `separate`, `enforce`, `check`, `propagate`, `dynamic` and `removable` are recognized
4122- the AMPL interface now passes an initial guess, if specified, as a solution (that will be checked for feasibility) to SCIP
4124### Changed parameters
4126- rowrepswitch set to 2.0, so row representation is activated if LP has at least 2 times more rows than columns
4127- one can now set emphasis parameters at the beginning of a settings file; it should start with `emphasis:` and
4128 the contain the emphasis string, e.g., `emphasis: feasibility` or `emphasis: heuristics off`.
4130- Renamed parameters:
4131 - `vbc/filename` to `visual/vbcfilename`
4132 - `vbc/realtime` to `visual/realtime`
4133 - `vbc/dispsols` to `visual/dispsols`
4137- added parameter to switch pseudo cost update in diving heuristics (enabled by default)
4138- `branching/relpscost/confidencelevel` to set the confidence level to be used by statistical tests
4139- `branching/relpscost/higherrortol` to define the highest reliability threshold for relative error based reliability
4140- `branching/relpscost/lowerrortol` to define a lower reliability threshold for relative error based reliability
4141- `branching/relpscost/nlscoreweight` for weight of nonlinear score when branching on MINLPs
4142- `branching/relpscost/usedynamicconfidence` to use a dynamic confidence level based on the amount of
4143 strong-branching simplex-iterations compared to the overall simplex iterations (default is FALSE)
4144- `branching/relpscost/usehyptestforreliability` to enable strong branching decisions based on a 2-sample student-T test of all prior
4145 pseudo-cost observations between the best pseudo-candidate and the candidate for which to decide whether strong-branching should be applied
4146- `branching/relpscost/userelerrorreliability` to enable relative error based reliability
4147- `branching/relpscost/skipbadinitcands` for skipping strong-branching candidates whose estimated gain
4148 is significantly worse than the one of the locally best (sb or pseudo) candidate
4149- `constraints/linear/multaggrremove` to perform multi-aggregations in linear constraint handler only if the constraint can be removed afterwards
4150- `constraints/linear/rangedrowpropagation` to disabled newly implemented propagtion algorithm for ranged rows and equations
4151- `constraints/quadratic/advanced/interiorcomputation` to select the way of computing and interior point for gauge cuts
4152- `constraints/quadratic/gaugecuts` to enable convex quadratics to generate gradients cuts which are supporting
4153- `constraints/soc/generalsocupgrade` to allow general quadratics to be upgraded to soc
4154- `constraints/SOS1/addcomps` to add local complementarity constraints to the branching nodes (can be used in combination
4155 with neighborhood or bipartite branching)
4156- `constraints/SOS1/addbdsfeas` to define a minimal feasibility value for local bound (clique) inequalities in order to be
4157 added to the branching node
4158- `constraints/SOS1/addcompsdepth` to define the maximal depth for adding complementarity constraints
4159- `constraints/SOS1/addcompsfeas` to define a minimal feasibility value for local complementarity constraints in order to be
4160 added to the branching node
4161- `constraints/SOS1/autocutsfromsos1` to automatically switch to separating bound cuts from SOS1 constraints if the SOS1
4162 constraints do not overlap
4163- `constraints/SOS1/autosos1branch` to switch to SOS1 branching if the SOS1 constraints do not overlap
4164- `constraints/SOS1/conflictprop` to define whether to use conflict graph propagation
4165- `constraints/SOS1/bipbranch` to branch on a complete bipartite subgraph of the conflict graph
4166- `constraints/SOS1/boundcutsdepth` to define the node depth of separating bound (clique) cuts
4167- `constraints/SOS1/boundcutsfreq` to define the frequency for separating bound (clique) cuts
4168- `constraints/SOS1/boundcutsfromgraph` to define whether to separate bound (clique) inequalities from the conflict graph
4169- `constraints/SOS1/boundcutsfromsos1` to define whether to separate bound (clique) inequalities from SOS1 constraints
4170- `constraints/SOS1/fixnonzero`: If neighborhood branching is used, then fix the branching variable (if positive in sign)
4171 to the value of the feasibility tolerance
4172- `constraints/SOS1/implcutsdepth` to define the node depth of separating implied bound cuts
4173- `constraints/SOS1/implcutsfreq` to define the frequency for separating implied bound cuts
4174- `constraints/SOS1/implprop` to define whether to use implication graph propagation
4175- `constraints/SOS1/maxaddcomps` to define the maximal number of complementarity constraints added per branching node
4176- `constraints/SOS1/maxboundcuts` to define the maximal number of bound (clique) cuts separated per branching node
4177- `constraints/SOS1/maxboundcutsroot` to define the maximal number of bound (clique) cuts separated per iteration in the root node
4178- `constraints/SOS1/maximplcuts` to define the maximal number of implied bound cuts separated per branching node
4179- `constraints/SOS1/maximplcutsroot` to define the maximal number of implied bound cuts separated per iteration in the root node
4180- `constraints/SOS1/maxextensions` to define maximal number of extensions that will be computed for each SOS1 constraint in presolving
4181- `constraints/SOS1/maxsosadjacency` to define that the adjacency matrix of the conflict graph is not created in presolving if
4182 the number of SOS1 variables is too large
4183- `constraints/SOS1/maxtightenbds` to define the maximal number of bound tightening rounds per presolving round
4184- `constraints/SOS1/neighbranch` to branch on a neighborhood of the conflict graph
4185- `constraints/SOS1/nstrongiter` to define the maximal number LP iterations to perform for each strong branching round
4186- `constraints/SOS1/nstrongrounds` to define the maximal number of strong branching rounds to perform for each node (only
4187 available for neighborhood and bipartite branching)
4188- `constraints/SOS1/sos1branch` to branch on a single SOS1 constraint, i.e., a clique of the conflict graph
4189- `constraints/SOS1/sosconsprop` to define whether to use SOS1 constraint propagation
4190- `constraints/SOS1/strthenboundcuts` to define whether to strengthen bound (clique) cuts in case bound variables are available
4191- `constraints/SOS1/updateconflpresol` to update the conflict graph during the presolving procedure
4192- `display/allviols` to print all violated constraints of the best solution during checksol in the scip shell
4193- `heuristics/indicator/improvesols` that turns on the improvement of external solutions by one-opt
4194- `heuristics/∗diving/lpresolvedomchgquot` to determine the percentage of changed domains since previous LP to trigger
4195 an LP resolve [default: 0.15] (* stands for eight diving heuristics to support this feature)
4196- `heuristics/∗diving/lpsolvefreq` to determine the frequency for resolving LP's during the execution of
4197 this heuristic [default: 1, use 0 for a dynamic setting based on the number of domain reductions]
4198 (* stands for eight diving heuristics to support this feature)
4199- `heuristics/shiftandpropagate/binlocksfirst` to set if binaries without locks should be preferred in ordering
4200- `heuristics/shiftandpropagate/maxcutoffquot` to select a maximum percentage of allowed cutoffs before stopping the heuristic (default is 0.0)
4201- `heuristics/shiftandpropagate/selectbest` to trigger if shiftandpropagate should select the best candidate in every round
4202 (set to FALSE for static order) (default is FALSE)
4203- `limits/autororestart` for triggering an automatic restart after this many nodes, or -1 for no auto restart [default is -1]
4204- `limits/softtime` to set a soft time limit (active only after first primal solution was found)
4205- `misc/allowobjprop` to allow objective function propagation
4206- `misc/allowdualreds` to allow dual reductions
4207- `misc/outputorigsol` to control whether at the end of a command line run the solution should be output in the orignal space
4208- `numerics/checkfeastolfac` to scale feasibility tolerance when checking the feasibility of best found solution
4209 after the solving process finished (e.g., checksol in scip shell)
4210- `separating/cutselrestart` for cut selection during restart copy process (`a`ge, activity `q`uotient) [default is `a`]
4211- `separating/cutselsubscip` for cut selection for sub SCIPs (`a`ge, activity `q`uotient) [default is `a`]
4212- `separating/disjunctive/maxconsdelay` to delay separation of disjunctive cuts if number of SOS1 constraints is larger than predefined value
4213- `separating/disjunctive/maxdepth` to define the node depth of separating disjunctive cuts
4214- `separating/disjunctive/maxinvcuts` to define the maximal number of disjunctive cuts investigated per iteration in a branching node
4215- `separating/disjunctive/maxinvcutsroot` to define the maximal number of disjunctive cuts investigated per iteration in the root node
4216- `separating/disjunctive/maxrank` to define the maximal permissible rank of a disjunctive cut that could not be scaled to integral coefficients
4217- `separating/disjunctive/maxrankintegral` to define the maximal permissible rank of a disjunctive cut that could be scaled
4218 to integral coefficients
4219- `separating/disjunctive/maxrounds` to define the maximal number of separation rounds of disjunctive cuts in a branching node
4220- `separating/disjunctive/maxweightrange` to define the maximal valid range of simplex tableau row weights
4224- new enum `SCIP_CONFIDENCE_LEVEL` for different levels of confidence for statistical tests.
4225- new struct `SCIP_DIVESET` that bundles options for SCIP's diving heuristics; all hard diving heuristics (those
4226 without `obj` at the beginning) include diveset and implement only the scoring callback.
4227- rename all file `*_vbc.?` to the more generic `*_visual.?`
4228- moved buffer memory handling to blockmemory/memory.?;
4229 remove files type_buffer.h, struct_buffer.h buffer.h buffer.c;
4230 removed functions SCIP*buffer*() from scip.? and replaced them by macros;
4231 redesigned buffer interface to be similar to block memory; added checks for strange sizes
4236- added scripts and targets for testing with xpress (see Makefile section)
4243- new parameter `DELHEADERS` for `uninstall`-target: scip headers are only removed when invoking `make uninstall DELHEADERS=true`
4244- added scripts check_xpress.awk, check_xpress.sh, evalcheck_xpress.sh and check_cluster_xpress.sh and target
4245 `testclusterxpress` and `testxpress`
4250- fixed bug in primal.c and tree.c by using SCIPinfinity() as a cutoffbound to delete child nodes
4251- fixed bug in lp.c which leads to wrong primal and dual feasibility
4252- fixed wrong handling of infinite activities and primal values in sepastore.c and lp.c
4253- fixed bug that led to an erroneous warning about the clock type
4254- fix behavior of `make install` which now sets symbolic links and short links to binaries and libraries
4255- fix bug which lead to wrong global bound tightenings in prop_genvbounds.c
4256- fix call to random generator for Windows operating systems in misc.c
4257- fixed again a bug in backward propagation of linear expressions in expression graph
4258- fixed bug in prop_symmetry.c, where an incorrect weak symmetry handling constraint got added.
4261 - fixed bug in heur_nlpdiving.c: wrong counting of fix variables
4262 - fix wrong handling of `SCIP_NLPSOLSTAT_LOCALINFEASIBLE` solution status in nlp.c
4263 - fix characterization of logic or constraints in SCIP's NLP relaxation
4266 - fixed wrong comparison when executing branching rule for external branching candidates
4267 - fix spatial branching on implicit integer variables
4268 - fix wrong comparisons of values larger/less than +/- SCIPinfinity() in branch.c, lp.c and sol.c
4269 - fixed problem with lpisrelax flag in probing mode when doing branch-and-price
4271- Constraint Handlers:
4272 - try to handle fixings of multi-aggregated variable in cons_sos1 presolving and avoid error
4273 - fixed bug in pseudoboolean constraint handler about negated variables
4274 - fixed assert in cons_soc.c: now soc with 1 lhs variable are allowed
4275 - fixed wrong assert in cons_indicator (slack variables might be replaced by active variables that have nonzero objective)
4276 - fix late creation of auxiliary LP in cons_nonlinear.c, which lead to a segmentation fault with lpi_spx2.cpp
4277 - fixed bug in cons_abspower.c: do not generate cuts with infinity right-hand-side anymore
4278 - fixed setting of enforcement flag for constraints created by reformulation in nonlinear constraint handlers
4279 - fixed bug in cons_indicator with handling local bounds
4282 - fix potential memory leak in SoPlex LP interfaces when setting invalid basis
4283 - fix potential memory leak in method SCIPgetConsCopy()
4284 - fix potential memory leak in method detectRedundantConstraints() of the knapsack constraint handler
4286- Interval arithmetic:
4287 - fix handling of infinite intervals in SCIPintervalIsEmpty()
4288 - fixed bug in intervalarith.c: bivariate quadratic equations may have been solved wrongly if second variable is unbounded
4290- Quadratic Constraints:
4291 - fix wrong sorting of bilinear terms in cons_quadratic
4292 - fix potentially tightening of LB/UB of a variable to +/- infinity in cons_quadratic
4293 - fixed bug in cons_quadratic.c which leads to an overflow when SCIP allocates memory for a dense matrix
4294 - fixed bug in cons_quadratic.c: do not generate linearization cuts for disabled constraints
4295 - fix missing clean phase of bilinear terms with zero coefficient in cons_quadratic.c
4297@page RN31 Release notes for SCIP 3.1
4299@section RN311 SCIP 3.1.1
4300*************************
4305- use clock average to reduce number of system calls via `timing/rareclockcheck` parameter
4306- added copy mechanism for conjunction constraints
4307- added revised lpi_xprs for using XPRESS as LP solver
4309Performance improvements
4310------------------------
4312- improved solving of LPs in OBBT propagator
4313- improved activity-delta computation and thereby propagation for linear constraints
4314- improved memory management of proximity heuristic
4315- disabled statistic timing in all subscips via new parameter `timing/statistictiming`
4320### New and changed callbacks
4322- rename array arcdatas in digraph to arcdata
4323- changes in clock type are now transferred to SoPlex
4324- corrected wrong primal bound in statistics for unbounded problems
4325- forbid to call SCIPfixVar() in `SCIP_STAGE_PRESOLVED` stage, which is not allowed since it calls SCIPchgVarLb/Ub()
4327### Deleted and changed API methods
4329- rename SCIPdigraphGetNodeDatas() to SCIPdigraphGetNodeData();
4330- rename SCIPdigraphSetNodeDatas() to SCIPdigraphSetNodeData()
4331- SCIPapplyProximity() has an additional parameter freesubscip, which causes the method to free
4332 the created subscip automatically at the end.
4334### New API functions
4336- SCIPhasPerformedPresolve() to check, e.g., whether LP duals are accessible
4337- SCIPconvertRealTo[Long]Int() to convert reals that represent integers to [long] ints.
4338- SCIPisDualfeasEQ() and related to perform checks w.r.t. to the dual feasibility tolerance
4339- SCIPdeleteSubproblemProximity() to free proximity subproblem manually as external caller
4341### Command line interface
4343- added dialog for writing the finite solution (calling SCIPcreateFiniteSolCopy() before writing)
4345### Interfaces to external software
4347- AMPL interface now returns dual multipliers if problem is an LP and presolving was turned off
4349### Changed parameters
4351- changed default value of parameter `heuristics/proximity/minimprove` to 0.02; previous value was 0.25
4352- changed default value of parameter `heuristics/proximity/usefinallp` to FALSE
4356- `timing/rareclockcheck` to call the system time less frequently, based on the current average time interval
4357 between two calls to SCIPsolveIsStopped(); the default value is FALSE
4358- `timing/statistictiming` to enable/disable all timers for statistic output of SCIP; the default value is TRUE
4362- renamed MIP matrix structure to `SCIP_MATRIX`
4363- changed the numeric values for `PRESOLTIMING` flags
4370- added Makefile support for cygwin 64 Bit
4371- allow to turn off block and buffer memory by the makefile parameters NOBLKMEM, NOBUFMEM, NOBLKBUFMEM;
4372 also remove the now superfluous makefiles for noblkmem, nobufmem, noblkbufmem
4377- fixed wrong conversion of reals representing negative integer values
4378- in debug mode, SCIP checks that no NaN's are introduced in SCIPsolSetVal()
4379- fixed bug 697 (and 699), calling SCIPsolve() after the problem was already solved and SCIPfreeSolve() was called now
4380 does nothing anymore
4381- added support for character `#` in variable names in old non-linear CIP format (i.e., names without `<` and `>`)
4382- fixed bug 702, removed too hard assert when casting too big values into `SCIP_Longint`
4383- branching for continuous variables with unbounded intervals now takes `branching/clamp` into account
4384- forbid aggregations with scalar smaller feastol or larger 1/feastol
4385- fixed bug 683, not recognizing errors/segfaults especially in free stage of SCIP by improving the check scripts
4386- fixed bug where quieting a message handler also disabled writing to files other than stdout
4387- fixed bug 708, special case of implications led to a fixing
4388- fixed bug, variable bounds detected wrong infeasibility
4389- another bug fix when computing the original variable sum of a given variable in SCIPvarGetOrigvarSum()
4390- fixed setting solution value of multi-aggregated var in xml-solution case
4391- fixed bug changing the variable type of an negated variable
4392- fixed numerical troubles in SCIPcreateFiniteSolCopy()
4393- fixed bug in SCIPpermuteProb(): if called before transforming the problem, data structures were not initialized yet
4394- fixed bug in aggregation procedure if two variables were of non-binary type but for one of the variables
4395 SCIPvarIsBinary() returned true
4396- treat activities of pseudo solutions as invalid when containing positive and negative infinity contributions
4397- fixed bug in GMI example: fractionality of slack variable is now computed correctly
4398- fixed LP interface of CPLEX: functions getBInv* return the correct sign of the coefficients.
4399- fixed bug in SCIPpermuteProb(), when called in transformed stage and non-active constraints exist
4402 - use dual feasibility tolerance for comparisons regarding reduced costs
4403 - fixed bug in prop_dualfixing: don't fix variables to infinite values during solving
4404 - fixed sign of the dual multipliers returned by AMPL interfaces for maximization
4406- Objective and Time Limit:
4407 - fixed wrong output of status when an objective limit was imposed but not reached yet
4408 - fixed the rare case that branching was performed even though strong branching found global bound changes leading to
4409 an infeasible/objlimit LP
4410 - fixed bug that objective limit was not reset correctly during SCIPfreeTransform() for maximization problems
4411 - fixed bug that hitting the time limit while solving a pure LP and then continuing the solving process lead to
4412 not solving the LP, but always creating a single child node until maximum depth is reached
4415 - fixed bug leading to an incorrect dual bound when solving probing LPs within a DURINGPRICINGLOOP heuristic
4416 - fixed bug in proximity heuristic which attempted to enter diving mode even at nodes without a constructed LP
4417 - fixed wrong pseudo cost updates during diving heuristic execution after backtracking
4418 - fixed bug in heur_oneopt: avoid bound violations if shift value is negative due to infeasibilities
4419 - fixed bug that reaching a solution limit by beforenode heuristics lead to disregarding the current node if the
4420 optimization process was restarted later
4421 - fixed bug in trysol heuristic not saving the best solution in maximization problems
4424 - fixed bug in presolving of abspower constraints that lead to wrong variable locks
4425 - allow to call SCIPmarkConsPropagate() in INITPRESOLVE stage
4426 - fixed bug in components presolver with handling of dual fixable variables: unboundedness was not detected,
4427 better handle components with single variables by dual fixing propagator
4428 - issues in component solving by presol_components do not lead to stopping the overall process, anymore, the component
4432 - fixed bug with freeing problem: need to reset objective limit
4433 - fixed memory leaks in case of erroneous parsing of constraints, e.g., non-linear constraints
4434 - fixed missing memory allocation for node data in digraphs
4437 - fixed bug in cons_quadratic which leads to wrong min/max activities
4438 - removed wrong break in cons_pseudoboolean
4439 - fixed bug in cons_varbound.c using the wrong constraint side for updating an upper bound
4440 - fixed bug in presolve of cons_nonlinear: wrong constraint upgrades may have been performed due to outdated bound
4441 information in expression graph
4442 - fixed bug in cons_setppc, wrongly aggregating variables if dual-presolving was disabled
4443 - fixed bug in cons_sos1: locks and events were not initialized if constraint was added to transformed problem
4444 - fixed bug in cons_setppc with dual presolving disabled
4445 - corrected copy of disjunction constraints
4448 - allow to read numbers like `42856.` in lp-format
4449 - fixed bug(?) in reader_mps: variables are now written in columns section even of they occur in no constraint
4450 and have an objective coefficient of 0 (otherwise, CPLEX and Gurobi cannot read the file)
4451 - fixed bug with reading `>=1` indicator constraints in LP-files
4452 - fixed bug in reader_lp which created two indicator constraints with the same name to trigger an equality
4453 - fixed bug when reading indicator constraints for linear constraints (equations/ranged rows) from MPS files
4455@section RN310 SCIP 3.1.0
4456*************************
4461- added breadth first search node selection
4462- new node selection rule UCT which balances exploration and exploitation by considering node visits
4463- added possibility to not set a cutoff bound in the LP solver (can be enabled by setting `lp/disablecutoff` to TRUE)
4464- added missing debugging solution check for cliques
4465- added a data pointer to each node of the `SCIP_DIGRAPH`
4466- SCIPgetVarCopy() will now copy the original bounds when called for an original variable
4467- added upgrade of continuous variables to implicit variables for linear equations even if the coefficient is
4469- probing supports implicit binary variables
4470- added scaling to computation of relative interior point in SCIPcomputeLPRelIntPoint()
4473 - added two methods to iterate over a sparse solution (`SCIP_SPARSESOLUTION`), see pub_misc.h
4474 - it is now possible to add an offset for the original problem instance, all original solutions will be initialized with
4475 this value and updated, when the offset is changed
4476 - extended and corrected dual feasibility checks for LP solution (controlled by parameter `lp/checkdualfeas`)
4478- Cuts and Separation:
4479 - the rank of cuts is now stored and taken into account to improve numerical stability
4480 - added possibility to separate a cutpool w.r.t. a given solution (instead of LP-solution)
4483 - new branching rule `cloud branching` that considers several alternative LP optima
4484 - additional vbc output added: branching information is printed earlier and also for nodes which were cut off
4485 - added support for strong branching with domain propagation in full strong and reliability pseudo cost branching
4486 - added strong branching with domain propagation support: in SCIPstartStrongbranch(), support for propagation can
4487 be enabled (uses the probing mode, some overhead compared to standard strong branching), after that
4488 SCIPgetVarStrongbranchWithPropagation() can be used to perform strong branching on a variable with previous domain
4489 propagation; similar to probing, valid bounds for variables are collected
4490 - strong branching with propagation can be enabled in fullstrong and relpscost branching rule
4491 - added possibility to store pricing norms of the LP solver (in addition to basis information) to speed up LP solving
4492 after a backtrack, e.g. in probing or strong branching with domain propagation
4493 - a pricer can now return that no further pricing should be done but rather early branching, even if it added variables
4496 - SoPlex (>= 1.7.0.5) can compute condition number of current basis matrix via LP interface
4497 - LPI files (lpi*.[h|c]) all moved from src/scip to src/lpi
4500 - added propagation method to cons_xor relying on Gaussian elimination, which can also produce feasible solutions
4501 - added first implication detection in cons_linear
4502 - cons_indicator can now try to construct feasible solutions from a cover
4503 - added possibility to forbid upgrading of linear constraints
4504 - new initial constraints are now added to the LP before solving a probing LP
4505 - first implementation of parsing for nonlinear constraints in CIP format
4506 - added upgrade from varbound constraints to set-packing constraints
4507 - added upgrade from bounddisjunction constraints to set-packing/logicor constraints
4508 - cumulative constraint handler adds disjunctive constraints (cumulative with capacity 1) for all jobs which cannot
4509 be processed in parallel
4510 - added new clique extraction algorithm for linear constraints
4511 - the slack variables of indicator constraints can now be scaled
4512 - added redundancy check of sides of ranged row varbound constraint
4513 - added coefficient tightening for ranged row varbound constraint
4514 - XOR constraint handler can add two extended formulations (flow/asymmetric, parameter `addflowextended/addextendedform`)
4515 - added multi-aggregation for binary variables with at most two uplocks and two downlocks, which emerge from set-
4516 partitioning or set-packing constraints
4517 - added upgrade from quadratic constraints to set-packing constraints
4518 - generalized the linking constraint handler
4521 - can now read and write CIP-files with (multi-)aggregated variables
4522 - all readers now take the global parameters `reading/dynamic{conss|cols|rows}` and `reading/initialconss` into account
4523 - added reader_pbm, which writes the constraint-variable incidence matrix in pbm format (possibly scaled to given size)
4524 - reader_osil can now read SOS1 and SOS2 constraints
4525 - reader_lp and reader_mps are now able to write and-constraints in form of their (weak/strict) relaxation
4526 - added reading capability to GAMS reader (if compiling with GAMS=true, requires a GAMS system)
4527 - added capability of writing SOS1/2 constraints to GAMS reader (introduces extra variables and equations)
4530 - new primal heuristics dual value
4531 - new LNS heuristic called `proximity`, which solves a problem in which a local branching constraint replaces the
4532 objective function which in turn is treated as additional constraint
4533 - new LP-based rounding heuristic (heur_randround) whose randomized rounding is biased towards the LP solution value;
4534 the heuristic uses the probing mode of SCIP to generate conflict clauses on the fractional variables
4537 - added new dual presolving for setppc-constraints
4538 - changed dualfix presolver to propagator such that dual fixing can also be applied during repropagation of the root node
4539 - added full-dual presolving step in setppc constraint handler
4540 - dual solution can now be displayed for pure LPs when no presolving was performed
4541 - added clique presolving for xor constraints
4542 - added presolving using pairs of variable bound constraints that use the same variables
4543 - added more presolving to cons_indicator, checking whether indicator/slack variables are aggregated
4544 - added presolve.{c,h} which should be used for all preprocessing mechanisms executed from within SCIP, corresponding to
4545 solve.{c,h} and also for presprocessing methods which can be called from different plugins or from the core to avoid
4547 - return error if variable should be fixed to infinity after presolving (LP-solvers do not handle this consistently)
4548 - in verblevel `SCIP_VERBLEVEL_FULL`, the number of non-zeros will be output for the original and presolved model
4549 - new presolving step for tightening logicor constraints using implication and clique information
4550 - several new presolving steps for linear and knapsack constraints, using gcd information and many more
4553 - added average gap based on primal-dual integral to solution statistics; can be disabled via parameter
4555 - the statistics now include the value of the first LP solved at the root node (without cuts)
4556 - added new statistic which distinguishes between internal nodes and leaves which got processed
4557 - new section `Root Node` in statistics, listing objective value, iterations and solving time for the first LP solved
4558 at the root node as well as final dual bound of the root node and LP iterations for processing the root node
4559 (those where listed in the `Solutions` section before, named `Root Dual Bound` and `Root Iterations`)
4561Performance improvements
4562------------------------
4564- allow multiaggregation of binary variables
4565- shorten conflicts and deriving global boundchanges from conflicts
4566- apply lowerbound provided by pricers already during pricing loop, stop pricing if the lower bound computed by pricing
4567 already exceeds the cutoff bound
4568- improved performance of SCIPcliquelistDel(), SCIPcliquetableAdd(), SCIPcliquetableCleanup()
4571 - strong branching LP solutions are checked for integrality
4572 - improved LP reoptimization for branch-and-price applications
4573 - improved numerical stability checks for LP solution
4574 - faster feasibility check of LP solutions (controlled by parameters `lp/checkprimfeas` and `lp/checkdualfeas`)
4577 - improved methods SCIPlpiGetBInv{Row,Col,ACol} for row representation in SoPlex LP interface
4578 - improved performance of method SCIPsolRetransform() when called during presolving with many aggregations
4579 - minor presolving performance improvements in cons_logicor.c and cons_knapsack.c
4580 - dual fixing presolver was turned into a propagator
4581 - many presolving improvements in constraint handlers
4582 - improved dual-presolving for setppc constraints in special cases
4585 - major improvements in pseudo-boolean constraint handler
4586 - performance improvement in domain propagation by marking constraints for propagation
4587 - added more constraint upgrading possibilities
4588 - improved handling of initial constraints created during solving
4589 - disabled scaling in feasibility check of nonlinear constraint handlers
4590 - conflict consisting of exactly two binary variables will be handled as set-packing constraint instead of an logicor
4591 constraint and the corresponding clique information is globally added
4592 - fasten repropagation for set-packing and -partitioning constraints
4593 - improved merging of and-constraints
4594 - disabled multi-aggregation in linear constraint handler when coefficients differ too much
4595 - improved multi-aggregation in linear constraint handler when only one variable in the aggregation has infinity
4597 - added upgradability for implicit binary variable cases for linear constraints
4599Examples and applications
4600-------------------------
4602- new textbook Gomory mixed integer cuts example
4607- removed all message length parameters in message.c and for printing error messages (not needed anymore)
4609### New and changed callbacks
4611- Domain Propagation:
4612 - added parameter `nmarkedconss` to SCIP_DECL_CONSPROP() callback which gives the number of constraints marked
4613 for propagation (these constraints are listed first in the conss array given as parameter).
4616 - Added parameter `nodeinfeasible` to SCIP_DECL_HEUREXEC() callback which states whether the current subproblem was
4617 already detected to be infeasible. In this case, the current LP solution might not respect local bounds and the
4618 heuristic must not assume that it does.
4621 - Added parameter `stopearly` to callback method SCIP_DECL_PRICERREDCOST(). This boolean pointer should be used by the pricer
4622 to state whether early branching should be performed, even if new variables were added in the current pricing round.
4625 - new possible return value `SCIP_DIDNOTFIND` for SCIP_DECL_BRANCHEXECLP(), SCIP_DECL_BRANCHEXECPS(), and
4626 SCIP_DECL_BRANCHEXECEXT() callbacks to state that the branching rule searched, but did not find a branching.
4628### Deleted and changed API methods
4630- SCIPcalcMIR() takes an additional parameter sidetypes to determine which side of the rows to use
4631 (relevant for ranged rows)
4632- SCIPvarParseOriginal() and SCIPvarParseTransformed() now return the end of the parsed string
4633- SCIPgetConsCopy() now always captures the created constraint
4636 - Added parameter `nfracimplvars` to SCIPgetLPBranchCands()
4637 - SCIPgetLPBranchCands() can be used to retrieve the number of implicit integer variables with fractional LP solution
4638 value via an additional pointer; the corresponding implicit integer variables can be accessed together with their
4639 fractionalities and solution values in the same way as binary and integer variables before; the arrays are sorted such
4640 that binary and integer variables precede the implicit integer variables; the method SCIPbranchcandGetLPCands()
4641 has been modified in the same way
4643- LP and Cutting Planes:
4644 - Added parameter `sidetypes` to SCIPcalcMIR() to specify the specify row side type to be used.
4645 - Added parameter `cutrank` to SCIPcalcMIR() and SCIPcalcStrongCG() which stores the rank of the returned cut;
4646 via SCIProwChgRank() the rank of a cut can be changed (default rank is 0)
4647 - Added parameter `infeasible` to SCIPaddCut() which is a pointer to store whether the cut is infeasible for the
4649 - SCIPgetLPObjval() now returns the LP value of the current (suboptimal) basis if the iteration limit is hit during LP
4650 solving (instead of -infinity); this value is not necessarily a valid dual bound and must not be used as such, but can
4651 be used as an objective estimate, e.g., if strong branching is simulated using the probing mode
4652 - removed parameter `normtype` from function SCIPcomputeLPRelIntPoint()
4655 - Added parameter `lazyconss` to SCIPwriteMIP() to swith writing removable rows as lazy constraints.
4656 - Added parameter `enablepropagation` to SCIPstartStrongbranch(), which can be used to enable strong branching
4657 with domain propagation.
4658 - SCIPstartStrongbranch() has a new parameter `propagate` to enable or disable propagation support for strong branching
4659 - New method SCIPgetVarStrongbranchWithPropagation() which performs strong branching with propagation on a variable.
4660 - Added parameter `endptr` to SCIPparseVar() which stores the final string position after parsing.
4662### New API functions
4664- added SCIPdebugCheckConss() to the debugging mechanism and therefore created a `SCIP_SOL` (in original space) in debug.c
4665- before copying solutions to the original solution candidate storage, infinite solution values can now be removed using SCIPcreateFiniteSolCopy()
4666- SCIPsortLongPtrRealBool(), SCIPsortLongPtrRealRealBool(), SCIPsortLongPtrRealRealIntBool() and corresponding
4667 methods for sorting, insertion and deletion
4668- SCIPstoreSolutionGap() in scip.c, to store the gap when the first and last solution is found
4669- SCIPwriteCliqueGraph() which allows to write a graph with node weights for fractional variables
4672 - SCIPconshdlrIncNCutsFound(), SCIPsepaIncNCutsFound() and SCIPsepaIncNCutsFoundAtNode() to increase the number of found cuts
4673 - SCIPseparateSolCutpool() to separate a cutpool w.r.t. a given solution
4675- Constraint Handlers:
4676 - New method SCIPconshdlrGetStrongBranchPropTime() which returns the time used for domain propagation methods
4677 of the constraint handler during strong branching.
4678 - New method SCIPconsIsMarkedPropagate() which returns whether a constraint is marked for propagation.
4679 - New methods SCIPconsAddUpgradeLocks() and SCIPconsGetNUpgradeLocks() to increase or get the number of upgrade
4680 locks of a constraint.
4681 - New method SCIPgetNCheckConss() which returns the number of checked constraints.
4684 - New methods SCIPsparseSolGetFirstSol() and SCIPsparseSolGetNextSol() to get the first sparse solution
4685 or iterate over the sparse solutions, respectively.
4686 - New methods for the `SCIP_QUEUE` data structure in pub_misc.h to handle a (circular) queue, e.g., SCIPqueueCreate(),
4687 SCIPqueueFree(), SCIPqueueInsert(), SCIPqueueRemove(), SCIPqueueFirst(), SCIPqueueIsEmpty(), SCIPqueueNElems()
4688 - New method SCIPgmlWriteNodeWeight() to write a node section including weight to a .gml graph file.
4689 - New methods for hash tables: SCIPhashtableRemoveAll(), SCIPhashtableGetNElements(), SCIPhashtableGetLoad()
4690 - New methods in pub_misc.h to handle a resource activity, e.g., SCIPactivityCreate(), SCIPactivityFree(),
4691 SCIPactivityGetVar(), SCIPactivityGetDemand() ...
4692 - New methods for digraphs: SCIPdigraphResize() to resize the graph and SCIPdigraphSetNodeDatas() and
4693 SCIPdigraphGetNodeDatas() to set and get the data attached to the nodes.
4695- Domain Propagation:
4696 - New method SCIPpropGetStrongBranchPropTime() which returns the time spent by a domain propagator during strong branching.
4697 - New methods SCIPmarkConsPropagate() and SCIPunmarkConsPropagate() to (un)mark a constraint for propagation.
4699- LP and Cutting Planes:
4700 - New methods SCIPchgRowLhsDive() and SCIPchgRowRhsDive() to change left and right hand side of a row during diving.
4701 - Added parameter `cutoff` to SCIPsolveDiveLP(), SCIPsolveProbingLP(), and SCIPsolveProbingLPWithPricing()
4702 which is a pointer to store whether the diving/probing LP was infeasible or the objective limit was reached.
4703 - SCIPgetFirstLP{Dual/Lower}boundRoot() which return the value of the first LP solved at the root node
4704 - SCIPgetNRootFirstLPIterations() which returns the number of LP iterations for the first LP solved at the root node
4705 - SCIPlpiGetNorms(), SCIPlpiSetNorms() and SCIPlpiFreeNorms() for getting the LP pricing norms from the LP
4706 solver, loading them back into the solver and freeing the data
4707 - New method SCIPgetFirstLPTime() and SCIPgetNRootFirstLPIterations() to return time and iterations for the first LP solve
4708 and SCIPgetFirstLPDualboundRoot() and SCIPgetFirstLPLowerboundRoot() to return the first root LP dual and lower bound.
4709 - New method SCIPprintDualSol() which prints the dual solution for a pure LP (works only with preprocessing disabled).
4710 - New method SCIPisCutApplicable() which returns whether a cut is good enough to be applied.
4713 - the main output routine of message.c (`bufferMessage` now handleMessage) has been rewritten: it now does not need
4714 a copy of the string to be output anymore, which makes the code much simpler (and also faster); it is passed a
4715 function pointer to the output function and uses it to directly output the (buffered) messages
4716 - New generic messagehandler output callback method SCIP_DECL_MESSAGEOUTPUTFUNC().
4717 - Removed parameter `msglength` from callback method SCIP_DECL_ERRORPRINTING().
4718 - New method SCIPmessageVPrintError() to print an error message.
4719 - Removed method SCIPmessagePrintWarningHeader().
4722 - New method SCIPparamGetCharAllowedValues() to get the allowed values for a char parameter.
4723 - New method SCIPgetParam() to get the parameter with a given name.
4726 - SCIPapplyProbingVar() in prop_probing.h
4727 without deteriorating its objective value
4728 - SCIPshrinkDisjunctiveVarSet(), which takes an set of variables with corresponding bounds and boundtypes, and
4729 tries to derive global boundchanges and also to shorten this set of variables by using cliqe, implication and
4730 variable bound information
4731 - SCIPselectVarStrongBranching() to get the variable that fullstrongbranching would select
4732 - New method SCIPvarGetValuehistory() to get the value-based history of a variable.
4735 - New method SCIPdoNotMultaggr() which returns whether multi-aggregation was disabled.
4736 - New method SCIPcreateFiniteSolCopy() to create a copy of a solution with infinite fixings removed.
4737 - New method SCIPadjustImplicitSolVals() which sets implicit integer variables to an integer value in the given
4738 solution without deteriorating its objective value.
4739 - New method SCIPcopyOrig() to copy the original problem. Analoguosly, use SCIPcopyOrigProb(), SCIPcopyOrigVars(),
4740 and SCIPcopyOrigConss() to copy original problem data, variables, or constraints, respectively.
4741 - New method SCIPwriteCliqueGraph() to write the clique graph in GML format into a given file
4742 - New method SCIPaddOrigObjoffset() to add an offset to the objective function.
4743 in original space and updates all orignal solutions correspondingly
4744 - New method SCIPcopyImplicationsCliques() to copy implications and cliques to a copied SCIP instance.
4745 - New method SCIPgetOpenNodesData() which returns all unprocessed nodes.
4746 - Added parameter `endline` to SCIPprintDisplayLine() to switch printing a newline symbol at the end of the line.
4747 - New method SCIPgetNLimSolsFound() returning the number of feasible primal solution respecting the objective limit.
4749### Command line interface
4751- allow dialog option to write clique graph
4752- dual solution values can now be obtained in the interactive shell after solving a pure
4753 LP without presolving
4755### Interfaces to external software
4757- new SoPlex 2.0 interface, can be enabled with `LPS=spx2`
4758- add support for SOS1 and SOS2 constraints to AMPL interface (see `interfaces/check/testset/SOS/sos?a.mod` for example)
4759- added copy of GAMS interface from COIN-OR/GAMSlinks project; GAMS-reader in SCIP can now read model instances from .gms files
4760- beta version of a python interface for the scipoptsuite is now available under interfaces/python
4761- beta version of a Java native interface is now available under `interfaces/jni`
4763### Changed parameters
4765- parameter `branching/scorefunction` has new value `q` for for `q`uotient branching score function
4766- replaced parameter `lp/checkfeas` by two parameters `lp/checkprimfeas` and `lp/checkdualfeas` to decide on primal and dual
4767 feasibility checks individually
4768- removed all local parameters `reading/(READER)/dynamic{conss|cols|rows}` and replaced them by global parameters
4769 `reading/dynamic{conss|cols|rows}`
4770- changed default value of parameter `numerics/dualfeastol` to 1e-7 for safer dual bounds from LP solver
4771- new possible values for parameter `heuristics/shiftandpropagate/sortkey` for sorting variables w.r.t. their norm,
4772 default changed from `u` to `v`, which means sorting downwards by violations
4775 - changed type of parameters `constraints/bivariate/scaling`, `constraints/quadratic/scaling`, `constraints/soc/scaling`
4776 from boolean to character
4777 - changed default for `constraints/{abspower,bivariate,nonlinear,quadratic,soc}/scaling` to off
4778 - changed default max coefficient for big-M constraint to be initial from 1e6 to 1e9
4781 - changed default value of gomory cut separation parameter `separating/gomory/maxrank` from 0 to 3, to take also gomory
4782 cuts that could not be scaled to integral coefficients, with maximal rank 3 into account
4783 - remove parameter `separating/closecuts/relintnormtype`
4787- `branching/checksol` and `branching/heursbsol` to specify whether the strong branching LP solution
4788 should be checked for feasibility and whether a simple rounding heuristic should be run on this solution
4789- `branching/firstsbchild` and `branching/forceall` to specify the first child node to be
4790 investigated during strong branching (`u`p, `d`down, `a`uto) and whether always both children should be solved (only for
4791 strong branching with domain propagation, per default, the second child is not looked at when the first is infeasible)
4792- `conflict/fullshortenconflict` to decide whether we want to stop shortening a conflict set, when no
4793 global bound changes can be found anymore
4794- `conflict/maxvarsdetectimpliedbounds` to decide whether the a valid conflict of what maximal length
4795 will be used to derive global bound changes
4796- `constraints/{linear,knapsack}/detectcutoffbound` and `constraints/{linear,knapsack}/detectlowerbound`
4797 to enable/disable detection of constraint parallel to the objective function that will add an cutoffbound or an
4798 lowerbound respectively and these constraints will be prevented from entering the LP
4799- `constraints/and/upgraderesultant` to upgrade resultants of and constraints from binary to implicit binary variables, default is TRUE
4800- `constraints/abspower/scaling` and `constraints/nonlinear/scaling`
4801- `constraints/indicator/scaleslackvar` for scaling of the slack variable in indicator constraints
4802- `constraints/indicator/trysolfromcover` for trying to construct a feasible solution from a cover
4803- `constraints/linear/checkrelmaxabs` for checking linear constraints with a side of 0.0 relative to
4804- `constraints/linear/detectpartialobjective` to enable/disable the detection of sub-equations of the objective function
4805- `constraints/logicor/strengthen`, should pairwise constraint comparison try to strengthen constraints by removing superflous non-zeros?
4806- `constraints/xor/addextendedform` to add an extended formulation in XOR-constraints
4807- `constraints/xor/addflowextended` to add use the extended flow formulation in XOR-constraints
4808- `heuristics/<heurname>/lplimfac` for LNS heuristics to limit the number of LPs solved in a subproblem
4809 the maximum absolute value in the activity instead of 1.0
4810- `heuristics/shiftandpropagate/fixbinlocks` for fixing binary variables with no locks in one direction to the corresponding bound
4811- `heuristics/shiftandpropagate/collectstats` which decides whether variable statistics are collected
4812- `heuristics/shiftandpropagate/impliscontinuous` to decide whether implicit integer variables are treated as continuous variables
4813- `heuristics/shiftandpropagate/preferbinaries` and `heuristics/shiftandpropagate/stopafterfeasible`,
4814 which decide whether binaries should be shifted first and the shifting should be stopped when no violations are left
4815- `lp/disablecutoff` to toggle usage of LP cutoff bound (0: enabled, 1: disabled, 2: auto = disabled if pricers are used)
4816- `misc/calcintegral` (default TRUE) to trigger calculation of primal-dual integral
4817- `misc/finitesolutionstore` to switch whether infinite fixings should be removed from solutions before
4818 copying them to the original solution store
4819- `misc/permuteconss` and `misc/permutevars` to control whether variables and/or constraints should be permuted, if permutationseed != -1
4820- `presolving/components/feastolfactor` to increase the feasibility tolerance in all sub-SCIPs, when solving a component
4821- `propagating/obbt/conditionlimit` to discard instable LP bases
4822- `reading/(READER)/initialconss` that determines whether model constraints are initial
4823- `reading/cipreader/writefixedvars` for disabling printing of fixed variables in CIP format
4824- `reading/lpreader/aggrlinearization-ands` and `reading/mpsreader/aggrlinearization-ands` to enable/disable
4825 the printing of the weak or strict relaxation of and-constraints in LP and MPS format, respectively
4826- `reading/lpreader/linearize-and-constraints` and `reading/mpsreader/linearize-and-constraints` to
4827 allow and-constraints to be linearized when printing in LP and MPS format, respectively
4828- `separating/feastolfac` to allow dynamic decrease of relaxation feasibility tolerance depending on feasibility to applied cuts,
4829 i.e., allow relaxation solutions to have a primal infeasibility of at most this factor times the infeasibility of applied cuts
4830- `separating/gomory/sidetypebasis` to decide whether the sides of ranged rows should be determined from the basis status
4831- `separating/oddcycle/cutthreshold` to run odd cycle separation if not enough cuts have been found
4832- `separating/zerohalf/delayedcuts` to use the delayed cutpool for the zerohalf separator
4833- `write/allconss` to enable that all constraints are written
4834- `write/genericnamesoffset` when writing a generic problem to define an offset on the variable numbering
4838- New structure to store value-based branching and inference history (see pub_history.h).
4839- new data structure for (circular) queues (`SCIP_QUEUE`)
4840- hash tables will now increase dynamically
4841- Moved LP solver interfaces to subdirectory `src/lpi`.
4846- added McNemar tests and Wilcoxon signed rank tests to cmpres.awk evaluation scripts
4847- added passing MEM option of testgams(cluster) target as workspace option to GAMS jobs
4848- extended test scripts by statistical tests
4855- default flag for ZIMPL is now `auto`, which means that it is built if and only if GMP is available (GMP=true)
4856- fixed make install for older Mac systems where install command does not have option -t
4857- dropped support for Ipopt < 3.10
4862- fixed bug when adding (global) clique, implications or variable bound information in solving stage that lead to
4863 global bound changes which contradict local bounds and therefore need to be stored as pending bound changes
4864- unlinking a solution now copies solution values smaller than SCIPepsilon() avoiding some feasible solution in the
4865 transformed problem to be infeasible in the original problem
4866- fixed bug when flushing the warning buffer when SCIP is closed
4867- fixed bug when a bound change contradicts a local bound and is stored as pending, but the contradicting local
4868 bound becomes global afterwards (--> node where pending bound change is valid can be cut off)
4869- fixed statistics bug: externally given solutions and new solutions found while transforming existing ones
4870 are now listed in line `other solutions` of primal heuristics statistics
4871- fixed bug in random generators SCIPgetRandomInt() and SCIPgetRandomReal() for large intervals
4872- make sure that bound changes of negated original variables are correct
4875 - fixed bug w.r.t. changing the variable branching priority beyond the problem stage
4876 - allow again branching on continuous variables with huge bounds
4879 - fixed bug in sepa_cgmip computeObjWeightSize() w.r.t. equal sized rows
4880 - fixed wrong bound calculation in sepa_rapidlearning
4881 - fixed bug in flowcover separator to exclude unconstrained rows in aggregation
4884 - fixed bug that lead to resolving the LP after diving instead of restoring the buffered solution
4885 - fixed rare bug with conflict analysis and LP/LPI having different states after diving
4886 - fixed several bugs in lpi_grb
4887 - fixed wrong strong branching results in lpi_grb.c and an invalid write
4888 - fixed bug in handling max-function in ampl interface; added support for min-function
4891 - fixed bug in prop_dualfix w.r.t. to fixing of variables to infinity after presolving
4892 - fixed wrong presolving finished status which sometimes occurred when the time limit was hit during presolve
4893 - fixed bug where a limit on presolving rounds was exceeded by 1
4894 - fixed minor bugs in presolving in cons_setppc.c and cons_logicor.c
4895 - fixed minor bug in cons_linear w.r.t. disabled presolving
4898 - fixed bug in genvbounds propagator occurring when objective offset or scale changes after a restart
4899 - fixed bug in genvbounds propagator by replacing non-active variables on right-hand side after presolving
4902 - fixed memory bug in reader_mps
4903 - fixed several minor bugs with handling of memory when writing aggregated variables (reader_lp, reader_mps)
4904 - fixed bug in reader_lp when writing bilinear terms (product sign was missing)
4905 - fixed bug in reading indicator constraints in mps-format
4906 - nonlinear readers now create auxiliary objective variables and constraints always as initial and not removable
4907 in order to avoid unbounded LPs due to loose variables with infinite best bound
4910 - fixed several bugs where variables or constraints were not freed correctly
4911 - do not multi-aggregate variables if the constant would be a huge value in order to avoid numerical troubles
4912 - fixed bug with infinite multi-aggregation constants
4913 - fixed output of aggregated variables in indicator constraints in lp and mps-format
4914 - improved handling of initial constraints: constraints which are initial, but added during the search to an already
4915 treated node are kept and added to the LP at every node where they are active
4916 - fixed bug in cons_superindicator concerning names of upgraded constraints
4917 - fixed bug in cons_indicator with trying to create solution in problem stage
4918 - fixed bug in cons_orbitope with fixing upper right triangle in non-root nodes
4923- new SCIP Optimization Suite homepages
4925@page RN30 Release notes for SCIP 3.0
4927@section RN302 SCIP 3.0.2
4928*************************
4933- reading erroneous CIP files can now output some indication of syntax errors
4934- can now run splint on core files
4935- cons_xor now uses the integral variable in propagation
4936- allowed to switch on/off the solution debugging
4938Performance improvements
4939------------------------
4941- improved SCIPlpiAdd{Cols,Rows}() in SoPlex LPi
4943Examples and applications
4944-------------------------
4949### New API functions
4951- SCIPmarkColNotRemovableLocal() and SCIPmarkRowNotRemovableLocal() to forbid removal of an column/row
4952 from the LP in the current node
4953- SCIPmessageVPrintError()
4955### Command line interface
4957- can now output the solutions in the solution pool in the interactive shell
4959### Interfaces to external software
4961- updated Mosek LP interface to compile with Mosek 7
4966- fixed bugs in solution counting
4967- fixed fieldtypes in sorting template
4968- fixed bug concerning the userinterrupt flag, which was not reset
4969- fixed solution collection when counting solutions
4970- fixed bug with storing original solutions
4971- fixed bug with infinite multi-aggregation constants
4972- fixed bug that removing reverse implication did not reset closestvblpcount
4973- fixed bug that duplicate solutions stopped copying of solutions to original solution candidate store
4974- forbid branching on variables with huge bounds; such huge values cannot be enumerated with fixed precision
4975 floating point arithmetics
4976- fixed bug that Ipopt's error message was not fully shown due to exiting before the message handler buffer was emptied
4977- unlinking a solution now copies solution values smaller than SCIPepsilon() avoiding some feasible solution in the
4978 transformed problem to be infeasible in the original problem
4979- allow to add columns (rows) with nonzero indices beyond current number of rows (columns) in SoPlex LPi
4980- updated get.ASL script to cope with broken ftp access to netlib server
4983 - fixed bugs with freeing C++ object data for problem and variables
4984 - fixed memory leak in lp.c (probably never occurred so far since array was not used)
4985 - fixed bug in sepa_zerohalf.c where the maxcuts(root) parameters led to an invalid memory allocation call
4988 - fixed assert in solve.c with branched status and LP reached the objective limit
4989 - fixed bug in heur_oneopt.c and heur_clique.c which was caused by side-effects when calling SCIPconstructLP(); when
4990 adding new variables in this method (e.g. adding new variables needed for a relaxation), this changes the variables
4992 - fixed problem that diving did not save status for infeasible LPs
4993 - fixed bug in SCIPlpComputeRelIntPoint() with wrong iteration limit and with wrong recompution
4994 - fixed bug that old LP size was not updated for deadend if no LP was solved
4997 - fixed issues with ungraceful termination when encountering unsupported expression operands in AMPL interface
4998 - fixed bug in backward propagation of linear expressions in expression graph
5001 - fixed potential performance issue with tree depth always assumed to be zero when propagating in probing mode
5002 - fixed bug in prop_vbound w.r.t. creation of variables during the search
5003 - fixed several bugs in propagation of cons_xor: need to take integral variables into account
5004 - fixed bug in cons_abspower.c handling infinity values in propagation
5005 - fixed bug in cons_and.c when a constraint was not correctly propagated which led to wrong dual-presolve reductions
5006 - fixed bug in cons_abspower: wrong infinity check when propagating bounds
5009 - fixed bug that the number aggregated variables were not counted in presol_inttobinary.c
5010 - fixed bug in presol_domcol: locks are now checked to see whether rounding was forbidden for a variable
5013 - fixed bug in reader_gms.c w.r.t. writing nonlinear expressions with polynomials with constants
5014 - fixed bugs in parsing bounds from CIP-files, in reader_gms and AMPL interface
5015 - fixed bug when reading a mps formated file with a missing bound in the bound section
5018 - fixed bug in cons_bounddisjunction with satisfied literal of multi-aggregated variable
5019 - fixed bug in upgrade method of cons_soc
5020 - fixed issue with negated variables in cons_xor.c
5021 - fixed several asserts in cons_xor presolving
5022 - fixed bug in cons_xor.c calling method on null pointer row
5023 - fixed bug using a too hard comparison on the objective-infeasible-decision in constraint enforcement
5024 - fixed possible cycling in enforcement of nonlinear constraints due to too early removal of newly added cuts from LP
5025 - fixed bug wrongly removing constraints locally while counting
5026 - fixed bugs in cons_bivariate.c when the nonlinear function is not differentiable on the boundary of the domain
5027 - fixed bug in cons_indicator.c:SCIPmakeIndicatorFeasible() with handling fixed variables
5028 - fixed bug in cons_integral: check integrality of implicit integer variables when a solution is checked for feasibility
5029 - fixed bug in Undercover with `pseudo-`quadratic constraints
5030 - fixed bug with quadratic constraints not being upgraded
5031 - fixed bug in intervalarith.c: bivariate quad. equations may have been solved wrongly if second variable is unbounded
5034 - fixed bug in sepa_zerohalf.c not copying the displays to the subscip, but still changing a display parameter there
5035 - fixed iteration limit determination in sepa_closecuts
5036 - fixed bug in sepa_closecuts: need to make sure that variable values of separation point satisfy bounds
5037 - fixed bugs in sepa_oddcylce: number of arcs have to be adjusted, handle implicit binary variables,
5038 fixed bug in heuristic separation method, fixed asserts
5039 - fixed wrong bound calculation in sepa_rapidlearning
5041@section RN301 SCIP 3.0.1
5042*************************
5047- added delayed cutpool which only gets separated if the sepastore is empty after a separation round
5048- sepa_cgmip can now take the objective row into account
5049- added possibility to run clang compiler
5050- statistics now include output on number of solutions that respect objective limit
5052Performance improvements
5053------------------------
5055- also copying active tight cuts from the delayed cut pool when calling SCIPcopyCuts()
5056- sort genvbounds only when root node is finished; apply more often
5058Examples and applications
5059-------------------------
5064- when using an objective limit, heuristic characters are not displayed any longer for worse solutions
5066### Deleted and changed API methods
5068- fixed spelling in the method name SCIPgmlWriteClosing()
5070### New API functions
5072- SCIPgetNLimSolsFound() to get number of solutions that respect the objective limit
5077- fixed issue with applying the effective root depth during the search
5078- fixed bug concerning usage of dualbound and lowerbound
5079- fixed bug trying to color probing nodes, which are not added to the vbc output anymore
5080- fixed bug in sorting template
5081- fixed bug leading to removing a ranged row parallel to the objective function, although one of the sides was still needed
5082- fixed a bug correcting the binvarssorted flag in cons_linear.c
5083- fixed bug in cons_varbound.c not resolving multi-aggregated variables
5084- relaxed assert in SCIPvarCh{Lb,Ub}{Global,Local} that new bound must be tighter to feastol
5085- fixed contra-intuitive behavior when using SCIP with objective limits and solution limit at the same time;
5086 SCIP now only stops when sufficiently many solutions better than the objective limit have been found
5087- fixed bug when adding binary implications with non-vartype binary variables
5088- fixed bug adding binary implications on binary variables with type != `SCIP_VARTYPE_BINARY`
5089- fixed bug concerning different tolerances for reached objective limit in case of pricing with fastmip
5092 - fixed bug which disabled iteration limit in SCIPlpSolveAndEval()
5093 - ensure consistency of LP bounds during OBBT diving, i.e., that lower <= upper holds exactly
5094 - set lpsolstat to `SCIP_LPSOLSTAT_NOTSOLVED` in SCIPchg{Lp,Dual}feastol()
5095 - use tighter dual feasibility tolerance for LPs solved during optimization-based bound tightening
5096 - fixed bug with unflushed LP arising from global bound changes in strong branching
5099 - fixed issue with deleting varbound constraints in case the bound change was not applied
5100 - fixed bugs in parsing dis-/conjunctive constraints
5101 - fixed bug with handling of empty logicor and bounddisjunction constraints
5102 - fixed issue in cumulative constraint and separation
5103 - fixed bug when sorting knapsack constraints with the same weights
5104 - fixed bug resulting in trying to delete an upgraded linear constraint a second time in exitpre callback
5105 - fixed minor bug in conjunctive constraint handler printing wrong constraint
5106 - fixed bug in disjunctive constraint handler when enforcing a constraint
5107 - fixed behaviour change of indicator constraint handler when solving another instance after solving one using the
5109 - fixed several issues in cumulative constraint handler
5110 - fixed bug in cumulative constraint handler w.r.t. getting active variables
5111 - fixed bug in cumulative constraint handler concerning conflict analysis
5113- LPI and Interfaces:
5114 - fixed bug in CppAD in connection with abspower constraints
5115 - fixed bug in CppAD when using signpower functions with expression pointers that do not fit into an unsigned int
5116 - better handling of generalized (Lagrangian) variable bounds that are not in the LPI
5117 - fixed wrong basis rstat values in CPLEX LPI
5118 - fixed bug with LP not being flushed after bound changes on columns that are not in the LPI
5119 - methods SCIPlpiIs{PrimalFeasible,DualFeasible,DualUnbounded}() in SoPlex LPi now check that the LP is not perturbed,
5120 which may happen when stopping due to iteration or time limit
5121 - fixed inconsistencies between methods SCIPlpiIs{PrimalFeasible,DualFeasible,Optimal,...} in SoPlex LPi
5124 - fixed bug when adding linear constraints with non active variables in solving process, during propagation this
5125 resulted in changing the row, which is not possible for unmodifiable constraints/locked rows
5126 - fixed small issue in pseudo objective propagator w.r.t. propagating the lower bound globally
5127 - fixed bug in cons_orbitope: in rare cases one cannot repropagate
5128 - fixed bug of wrong result code in propagation in prop_genvbound.c
5131 - fixed bug in copying nonlinear constraints during presolve (resulted
5132 in wrongly declaring instances as infeasible when using component presolve)
5133 - fixed bug in copying nonlinear constraints during presolve (nonlinear part was not copied)
5136 - fixed wrong solving status (OPTIMAL) in case an unbounded solution was provided or found by heuristic before presolve
5137 - fixed bug in heur_subnlp running with tightened tolerances: sumepsilon must be tightened like feastol and epsilon
5138 - fixed bug in nlp diving heuristic for fractional variables with values slightly outside of their domain
5141 - fixed several numeric issues
5142 - fixed numerical bug in conflict.c relaxing bounds while keeping an infeasibility proof
5143 - fixed feasibility decision bug when replacing inactive variables by their active counterparts, which might change the
5144 redundancy status of a bounddisjunction constraint due to numerics
5145 - fixed numerical bug adding a relaxed bound for conflict analysis in cons_varbound
5146 - fixed numerical bug in conflict analysis of genvbounds propagator
5148@section RN300 SCIP 3.0.0
5149*************************
5154- SCIPcomputeLPRelIntPoint() with normtype=`s` now uses homogenized LP for computing rel.int. point too and allow to
5155 set relaxrows = FALSE
5156- new column showing the pseudo objective value
5157- digraph structure added to misc.c and pub_misc.h that can be used to handle directed graphs, compute undirected
5158 components in the graph and sort these components (almost) topologically
5159- SCIP does now print an info message when the root LP could not be solved or is unbounded
5160- added counter and clock for SCIPcopy() calls
5161- correct initialization of steepest edge weights with SoPlex 1.6.0.4
5162- parameters can now be fixed, which means that their value cannot be changed unless they are unfixed, first;
5163 the fixing status of a parameter is copied to sub-SCIPs, which allows to ensure that certain parameters
5164 are also not changed when, e.g., heuristics change emphasis settings or also specific parameters
5165- automatic transfer of original solutions (e.g., provided by the user, from solution pool, after restart, from heuristic
5166 adding original solution during solve) to the transformed space (might fail due to, e.g., dual fixings)
5167- added possibility to use GUBs for lifting knapsack cuts (disabled)
5168- added pre- and post-conditions in doxygen documentation for all methods of scip.{c,h}
5169- added zeroobj heuristic that solves a copy of the problem without an objective function and with quite strict limits
5170 on the number of nodes and LP iterations
5171- complete reworking of the vbounds propagator: it now takes into account variable bounds, cliques and implications,
5172 stores bounds of variables which were changed and performs a forward propagation from these bounds, i.e., tries to
5173 derive new bounds for other variables; during propagation, bound changes are propagated in an (almost) topological order
5176 - full version of cumulative constraint handler
5177 - new constraint handler `superindicator` for indicator constraints with slack constraints of arbitrary type
5178 - implemented first clique lifting procedure in cons_setppc.c (by default is off)
5179 - the conjunction and disjunction constraint handlers are now able to parse their CIP output format
5182 - better handling of memory limits, in particular for large problems
5183 - estimate memory consumption for sub-SCIP and do not copy them if close to memory limit
5186 - time for initpre and exitpre methods is now also measured in presolving time
5187 - added dual presolving for and-constraints difficult instances (no guarantees)
5188 - oneopt can now be called before presolving
5189 - added a presolving step in the disjunctive constraint handler, removing disjunction, where a sub-constraint was
5190 deleted, which means this sub-constraint is redundant, which again means it is always TRUE or will be enforced by
5192 - added new presolver convertinttobin, which converts bounded integer variables to their binary representation, e.g.
5193 for integer variable 0 <= x <= 10 the binary variables y0, y1, y2 and y3 are created, such that
5194 1 y0 + 2 y1 + 4 y2 + 8 y3 <= 10 and x = 1 y0 + 2 y1 + 4 y2 + 8 y3
5195 - added new presolver gateextraction, which tries to find and-gates/constraints which are linearized
5196 e.g. (x + y + z >= 1, x + y <= 1 and x + z <= 1 => x == AND(~y,~z)), in special cases it also detects set-partitioning
5197 constraints e.g. (x + y + z >= 1, x + y <= 1, x + z <= 1 and y + z <= 1 => x + y + z == 1));
5198 gate-extractor is also able to detect logicor constraints and set-packing/-partitioning constraints with the same
5199 variables, to upgrade these both constraints to a set-partitioning constraint
5200 - added new presolver components, that searches for independent components in the problem structure and solves
5201 these components as sub-SCIPs when they are small enough (per default <= 20 discrete variables, nodelimit of 10000)
5202 - added new presolver domcol that looks for dominated columns in a MIP and tries to fix them
5205 - CNF reader now creates feasibility instances per default, usage of an objective has to be set by a parameter
5206 - added reader for MI(NL)Ps in OSiL (Optimization Services Instance Language) format
5209 - new statistics and new statistic output messages
5210 - number of presolving calls of plugins is counted and displayed in the statistics,
5211 can be accessed via SCIPpresolGetNCalls() and SCIP{prop/conshdlr}getNPresolCalls()
5212 - the statistics shows for a branching rule the number of calls for LP, extern and pseudo candidates
5213 - new switch `SCIP_STATISTIC` and new macros SCIPstatisticMessage(), SCIPstatisticPrintf() and SCIPstatistic() to output
5214 statistic and execute code lines which are only needed therefor. Works as `SCIP_DEBUG` and SCIPdebugXyz()
5215 - added statistics on the number of cuts/rows that have actually been applied to the lp for each constraint handler and separator;
5216 use SCIPcreate(Empty)RowCons() and SCIPcreate(Empty)RowSepa() to support the statistics.
5219 - new propagators obbt and genvbounds for MINLP
5220 - new NLPI parameter `SCIP_NLPPAR_FASTFAIL` to enable convergence checks in NLP solver to stop early on seemingly
5221 - added nlpdiving heuristic that comprises several diving heuristics using an NLP relaxation
5223Performance improvements
5224------------------------
5226- improved scaling by choosing the smallest scaler
5227- if first root lp is solved and the optimality is rejected by SCIP, there won't be an unnecessary solving of the lp
5229- several performance improvements for Pseudo-Boolean optimization, pseudo objective propagator
5230- streamlined initlp functions in cons_indicator, cons_sos1, cons_sos2 (add rows only if needed)
5231- improved time used for adding implications
5232- speed up in SCIPboolarrayExtend() in misc.c replacing a for loop with BMSmoveMemoryArray() call
5233- speed up in var.c changing some recursive calls into iterative calls and reducing the number of VARFIX event that are
5234 thrown for fixation, aggregation or multi-aggregations
5235- revised reduced cost propagator
5236- increased performance in SCIPcliqueAddVar(), adding a variable to a clique
5237- tighten primal and dual feasibility tolerances independently if they are not reached in LP solving
5240 - if probing reached the end of all variables it will restart the probing cycle correctly
5241 - improved probing by ordering the variables differently and applying the one-branch before the zero-branch
5244 - improved scaling of linear constraints, linear constraints with integral variables will now be scale with
5245 1e+06/MAX(maximal absolute coefficient, 1.0) instead of 1e+03/MAX(maximal absolute coefficient, 1.0);
5246 if all coefficients are in absolute value equal they will be scaled by that
5247 - added clique presolving for and-constraints, which checks if two operands or one operand and the resultant are in a
5248 clique and then fixes the resultant to 0 and in the former case we can delete the and-constraint too
5249 - speed up in linear constraint handler replacing aggregated variables
5250 - when all nonlinearities have been fixed and the number of nonfixed variables is 1 in cons_nonlinear/cons_quadratic/
5251 cons_bivariate, handle it by a bound change instead of adding a linear constraint
5254 - automatically turn off separation in sepa_oddcycle if it was too unsuccessful within the last calls
5255 - use faster Dijkstra variants in sepa_oddcycle
5256 - improved tcliquegraphAddImplicsVars() in sepa_clique.c to faster add possible variables
5257 - changed emphasis settings: knapsack disaggregation is now allowed in fast presolving, CG-MIP separator disabled in
5258 aggressive separation
5261 - improved lp-, mps-, opb-reading time
5262 - speed up mps reader asking parameters only once
5265 - added parameters mincoveredrel and mincoveredabs to heur_undercover to only run if problem is sufficiently nonlinear
5266 - improved intdiving heuristic by activating backtracking to a different fixing value
5267 - heur_undercover treats indicator constraints as nonlinear and fixes the binary variable for linearization
5269Examples and applications
5270-------------------------
5272- new examples for scheduling and usage of the callable library with nonlinear problems
5273- the error messages are not handled via the message handler anymore; per default the error message a written to stderr
5278- introduced basic inclusion and creation methods to simplify usage of the SCIP library
5279- allowed to start diving mode even if LP is not flushed, not solved, or not solved to optimality
5280- changed the message handler system within SCIP heavily such that it is thread save
5281- the resolve propagation methods for the constraint handler and propagator getting a new parameter called relaxedbd;
5282 explaining/resolving this relaxed bound is sufficient
5283- default integer comparer SCIPsortCompInt() (see pub_misc.h)
5286 - SoPlex LPI supports setting of `SCIP_LPPAR_DUALFEASTOL` when using SoPlex version 1.6.0.5 and higher.
5289 - Forbid problem modifications in `SCIP_STAGE_{INIT,EXIT}PRESOLVE` (see pre-conditions for corresponding methods in scip.h).
5292 - New macro SCIPdebugPrintCons() to print constraint only if `SCIP_DEBUG` flag is set.
5293 - all objscip *.h file now use the default SCIP interface macros (this should avoid errors when changing the interface)
5295### New and changed callbacks
5297- Constraint Handler:
5298 - Added a propagation timing parameter `proptiming` to SCIP_DECL_CONSPROP(), giving the current timing at which
5299 this method is called (also to the corresponding c++ wrapper classes).
5300 - New optional callback methods in constraint handlers: `SCIP_DECL_CONSGETVARS` and `SCIP_DECL_CONSGETNVARS`.
5301 These callbacks, if implemented, should return an array of all variables and the number of all variables used
5302 by the given constraint, respectively. (This method might, e.g., be called by a presolver)
5304- NLP Solver Interface:
5305 - New NLPI callback SCIP_DECL_NLPISETMESSAGEHDLR() to set message handler in NLP solver interfaces.
5308 - Added a propagation timing parameter `proptiming` to SCIP_DECL_PROPEXEC(), giving the current timing at which this method is
5309 called (also to the corresponding c++ wrapper classes).
5312 - added `basic` inclusion methods which have only fundamental data of the plug-ins as arguments; added setter functions
5313 for all non-fundamental callbacks of the plug-ins; the plug-in types with basic inclusion functions are:
5314 readers, constraint handlers, conflict handlers, presolvers, propagators, heuristics, separators, relaxation handlers,
5315 branching rules, node selectors and pricers; these methods should make the usage easier, sparing out optional callbacks and
5316 parameters: e.g., SCIPincludeConshdlrBasic();
5317 - To extend the basic functionalities, there are setter method to add
5318 optional callbacks. For example SCIPsetConshdlrParse(), SCIPsetPropCopy() or SCIPsetHeurInitsol().
5320- Constraint Handlers:
5321 - Added basic creation methods for all constraints types, e.g., SCIPcreateConsBasicLinear(); these methods should make the usage easier,
5322 sparing out optional callbacks and parameters.
5324### Deleted and changed API methods
5326- SCIPcomputeCoverUndercover() now has an additional parameter coverbd
5327- tcliqueMaxClique has an additional parameter to store the number of used branch-and-bound nodes
5328- the code in `src/dijkstra` and `src/xml` has been changed to (increasingly) conform to the SCIP coding style;
5329 all function (and variable) names have been changed (do not contain `_` anymore).
5330- renamed SCIPstairmap*Core() to SCIPstairmap*Stair()
5333 - Added parameter `relaxedbds` to conflict handler callback method SCIP_DECL_CONFLICTEXEC(). This array contains
5334 bounds which are sufficient to create a valid conflict
5336- Constraint Handler:
5337 - Added a parameter `restart` to the SCIP_DECL_CONSEXITSOL() callback method, indicating whether this call was
5338 triggered by a restart.
5339 - Added a parameter `relaxedbd` to SCIP_DECL_CONSRESPROP() callback method. If explaining a given bound change
5340 (index), it is sufficient to explain the reason for reaching the `relaxedbd` value, see above
5341 - Removed parameters `isunbounded`, `isinfeasible` and `result` from SCIP_DECL_CONSINITPRE() and SCIP_DECL_CONSEXITPRE()
5342 callback methods. It is not allowed to determine unboundedness or infeasibility in these callbacks, anymore.
5343 - added a `SCIP_CONS*` parameter to SCIPcreateConsDisjunction() which can represent the linear relaxation of the whole
5344 disjunction constraint as a conjunction constraint, or `NULL`
5345 - remove problematic function cons_indicator:SCIPsetSlackVarIndicator()
5346 - Renamed SCIPgetCountedSparseSolutions() to SCIPgetCountedSparseSols() in cons_countsols.{c,h}.
5349 - Changed the counting system within SCIP heavily. New method for `SCIP_SPARSESOL` usage, SCIPsparseSolCreate(),
5350 SCIPsparseSolFree(), SCIPsparseSolGetVars(), SCIPsparseSolGetNVars(), SCIPsparseSolGetLbs(), SCIPsparseSolGetUbs()
5351 in (pub_)misc.{c,h}.
5353- Cuts and Separation:
5354 - removed `targetscip` parameter from SCIPconvertCutsToConss(), now this function can only convert cuts on one instance,
5355 otherwise use SCIPcopyCuts()
5356 - added `ncutsadded` parameter to SCIPcopyCuts() to be able to store the number of copied/converted cuts
5357 - New functions SCIPcreateEmptyRowCons(), SCIPcreateEmptyRowSepa(), SCIPcreateRowCons(), and SCIPcreateRowSepa() that allow
5358 to set the originating constraint handler or separator of a row respectively; this is, for instance, needed for statistics
5359 on the number of applied cuts. If rows are created outside a constraint handler or separator use SCIPcreateRowUnspec() and
5360 SCIPcreateEmptyRowUnspec(). The use of SCIPcreateEmptyRow() and SCIPcreateRow() is deprecated.
5361 - New functions SCIProwGetOrigintype(), SCIProwGetOriginCons(), and SCIProwGetOriginSepa() to obtain the originator
5365 - new parameter numerics/lpfeastol for primal feasibility tolerance used in LP solver
5366 - SCIPcomputeLPRelIntPoint() takes two new arguments giving a time and iteration limit
5367 - SCIPcolGetStrongbranchLPAge(), SCIPgetVarStrongbranchLPAge(), SCIPgetNLPs(), SCIPgetNPrimalLPs(), SCIPgetNDualLPs(),
5368 SCIPgetNBarrierLPs(), SCIPgetNResolveLPs(), SCIPgetNPrimalResolveLPs(), SCIPgetNDualResolveLPs(), SCIPgetNNodeLPs(),
5369 SCIPgetNNodeInitLPs(), SCIPgetNDivingLPs(), SCIPgetNStrongbranchs(), SCIPgetNRootStrongbranchs() now return a longint
5370 instead of an integer
5372- Message Handler and Printing:
5373 - New callback method SCIP_DECL_MESSAGEHDLRFREE() which is called when the message handler is freed.
5374 - The old callback method SCIP_DECL_MESSAGEERROR() was replaced by the callback method SCIP_DECL_ERRORPRINTING().
5375 - the follwing methods additionally need the SCIP pointer as parameter to make the output thread save:
5376 SCIPprintVersion(), SCIPsetMessagehdlr(), SCIPgetMessagehdlr() and SCIPwarningMessage()
5377 - the error printing method can be replaced using the method SCIPmessageSetErrorPrinting(); the default error message
5378 printing can be recoverd via SCIPmessageSetErrorPrintingDefault() (see pub_message.h)
5379 - Changed the message handler system within SCIP heavily such that it is thread-safe. SCIPcreateMessagehdlr() in
5380 scip.{c,h} was replaced by SCIPmessagehdlrCreate() in pub_message.h/message.c with a changed parameter list;
5381 see pub_message.h and type_message.h.
5382 - removed method SCIPcreateMesshdlr(), please use SCIPmessagehdlrCreate() (see pub_message.c)
5383 - removed method SCIPfreeMesshdlr(), please use SCIPmessagehdlrRelease() (see pub_message.c)
5384 - Error messages (SCIPerrorMessage()) are not handled via the message handler anymore; per default the error
5385 message is written to stderr.
5386 - the following methods need an additional message handler: SCIPdispLongint(), SCIPdispInt(), SCIPdispTime(), all message
5387 handler methods (see pub_message.h), SCIPhashtablePrintStatistics(), SCIPhashmapPrintStatistics(), SCIPlpiCreate()
5388 - SCIPprintCons() does not print termination symbol `;\n` anymore; if wanted, use SCIPinfoMessage() to print `;\n` manually
5389 - remove SCIPcolPrint() and SCIProwPrint(), please use SCIPprintCol() SCIPprintRow() see scip.h
5390 - method SCIPprintError() does not need the file stream anymore. The error is written via the error message callback.
5392- Nonlinear expressions, relaxation, and solver interface:
5393 - Method SCIPexprtreeRemoveFixedVars() is not public anymore.
5394 - Renamed SCIPmarkNonlinearitiesPresent() to SCIPenableNLP()
5395 - Renamed SCIPhasNonlinearitiesPresent() to SCIPisNLPEnabled().
5396 - removed SCIPmarkContinuousNonlinearitiesPresent(),
5397 renamed SCIPhasContinuousNonlinearitiesPresent() to SCIPhasNLPContinuousNonlinearity() and allow call only during
5398 initsolve and solve,
5401 - Replaced SCIPparamSet*() by SCIPchg*Param()
5402 + replaced SCIPparamSetBool() by SCIPchgBoolParam()
5403 + replaced SCIPparamSetInt() by SCIPchgIntParam()
5404 + replaced SCIPparamSetLongint() by SCIPchgLongintParam()
5405 + replaced SCIPparamSetReal() by SCIPchgRealParam()
5406 + replaced SCIPparamSetChar() by SCIPchgCharParam()
5407 + replaced SCIPparamSetString() by SCIPchgStringParam()
5410 - Removed parameters `isunbounded`, `isinfeasible` and `result` from SCIP_DECL_PRESOLINITPRE() and
5411 SCIP_DECL_PRESOLSEXITPRE(). It is not allowed to determine unboundedness or infeasibility in these callbacks, anymore.
5414 - changed parameters of function SCIPpropagateCutoffboundVar() in prop_pseudoobj.{c,h}
5415 - Added a parameter `restart` to SCIP_DECL_PROPEXITSOL() callback method, indicating whether this call was triggered
5417 - Added a parameter `relaxedbd` to SCIP_DECL_PROPRESPROP() callback method. If explaining a given bound change
5418 (index), it is sufficient to explain the reason for reaching the `relaxedbd` value.
5419 - Removed parameters `isunbounded`, `isinfeasible` and `result` from SCIP_DECL_PROPINITPRE() and
5420 SCIP_DECL_PROPEXITPRE() callback methods. It is not allowed to determined unboundedness or infeasibility in
5421 these callbacks, anymore.
5424 - The methods SCIPsortedvecInsert*() have an additional parameter which can be used to receive the position where
5425 the new element was inserted, if this is not of interest a `NULL` pointer can be given
5426 - new parameter in SCIPcopyPlugins() to indicate whether the message handler from the source SCIP should be passed to the
5427 target SCIP (only the pointer is copied and the usage counter of the message handler is increased)
5428 - New parameter in SCIPcopy() to indicate whether the message handler from the source SCIP
5429 should be passed to the target SCIP (only the pointer is copied and the usage counter of the message handler is
5430 increased). In multi theaded enviroment this parameter needs to be set to FALSE.
5433 - rename SCIPvarGetBestBound() to SCIPvarGetBestBoundLocal()
5434 - rename SCIPvarGetWorstBound() to SCIPvarGetWorstBoundLocal()
5435 - Method SCIPvarGetProbvarSum() is not public anymore, use SCIPgetProbvarSum() instead.
5436 - Replaced method SCIPvarGetRootRedcost() by SCIPvarGetBestRootRedcost().
5438### New API functions
5440- setup timer to all plugins and therefore SCIP<plugin-type>GetSetupTime() methods in all pub_plugin-type.h to ask
5441 for this time (, e.g. SCIPeventhdlrGetSetupTime() in pub_event.h)
5442- new GML(Graph Modeling Language) methods SCIPgmlWriteOpening(), SCIPgmlWriteCosing(), SCIPgmlWriteArc(), SCIPgmlWriteEdge(),
5443 SCIPgmlWriteNode() that write to a given GML file
5444- new LPI method SCIPlpiGetObjsen() to query objective sense
5445- SCIPpermuteIntArray() in pub_misc.h and misc.c for permuting an integer array
5446- SCIPcalcBinomCoef() in pub_misc.h and misc.c which calculates a binomial coefficient up to 33 over 16
5447- SCIPheurPassSolAddSol() in heur_trysol.c; solution which are passed via this method are just without any feasibility check
5448- SCIPgetGlobalPseudoObjval() which returns the global pseudo objective value which is all variables
5449 set to their best (w.r.t. the objective function) global bound
5450- SCIPhashGetKeyStandard() which returns the element itself as the key, SCIPhashKeyEqPtr(),
5451 SCIPhashKeyValPtr() which do the hash-comparison/-conversion on a pointer in pub_misc.h
5452- SCIPhashtableClear() which removes all elements of a hash table
5453- SCIPisUpdateUnreliable() to check whether an iteratively updated value should be recomputed from scratch
5454 (e.g., for activities; uses new parameter `misc/num_recompfac`)
5455- SCIPisHugeValue() to check whether a value is huge and should be handled separately from other values
5456 (e.g., in activity computations) and SCIPgetHugeValue() to get the smallest value counting as huge
5457- SCIPfixParam() and SCIPunfixParam() to fix and unfix a parameter, respectively;
5458 the fixing status of a parameter can be requested by SCIPparamIsFixed();
5459- SCIPsetBasePointClosecuts() to set the base point for close cut separation
5460- SCIPchgCutoffboundDive() to change the cutoffbound in diving mode
5461- SCIPupdateCutoffbound() which can be used to pass a cutoff bound
5464 - SCIPpropIsPresolDelayed() which return if a propagator is delay during presolving
5465 - Added method SCIPisPresolveFinished() which returns whether the presolving process would be stopped after the
5466 current presolving round, given no further reductions will be found, can be used to ensure that a presolver is called very late
5469 - added forgotten implementation of SCIPfreeMemorySize(), SCIPfreeMemorySizeNull() in scip.h and BMSfreeMemorySize(),
5470 BMSfreeMemorySizeNull() in memory.h
5471 - SCIPmemccpy() in pub_misc.h and misc.c which copies either a specified number of charcters of a source
5472 string to a destination string or until it hits a stoping character
5473 - BMSmoveMemory(), BMSmoveMemoryArray(), BMSmoveMemorySize() and corresponding BMSmoveMemory_call() in
5474 memory.{h,c} too move memory elements
5477 - SCIPisConflictAnalysisApplicable() which return FALSE is the conflict will not runs; can be used
5478 to avoid unnecessary initialization of the conflict analysis
5479 - SCIPaddConflictRelaxedLb(), SCIPaddConflictRelaxedUb() and SCIPaddConflictRelaxedBd(); these methods
5480 can be used to give for a bound change which is part of an explanation a relaxed bound; this means the relaxed bound
5481 is already efficient to be part of a valid explanation
5482 - SCIPisConflictVarUsed() returns TRUE if the given bound change is already part of the conflict set;
5483 that is the bound change is redundant;
5484 - SCIPgetConflictVarLb() and SCIPgetConflictVarUb() returning the lower/upper bound of the given
5485 variable within the current active conflict set
5488 - SCIPvarsGetProbvar() in pub_var.h and var.c, which returns for a given array of variables the active, fixed
5489 or multiaggregated representation
5490 - SCIPgetActiveVars() in scip.{h,c}, which returns for a given array of variables the active counterparts
5491 - SCIPgetNObjVars() which returns the number of variables which have a non-zero objective coefficient
5492 - SCIPenableVarHistory() and SCIPdisableVarHistory() which can be used to turn off and on the collection
5493 of variables statistics which is used for example for branching
5494 - SCIPbranchVarHole() which branches a variable w.r.t. a given domain hole
5495 - SCIPvarGetAggregatedObj() which computes for a (not active) variable the corresponding objective value
5496 - SCIPsolIsOriginal() that returns whether a solution is defined on the original variables
5497 - SCIPgetVarImplRedcost() which returns the implied reduced costs
5498 - SCIPvarGetBestRootSol(), SCIPvarGetBestRootRedcost(), SCIPvarGetBestRootLPObjval() which return the best
5499 combination for a variable w.r.t. root solution value, root LP objective value and root reduced cost
5500 - SCIPhaveVarsCommonClique() in scip.{h,c}, to check for common clique information on two given variables
5501 - added basic creation methods SCIPcreateVarBasic() and SCIPcreateProbBasic() and setter functions for
5502 non-fundamental callbacks of variables and problems.
5503 - added new methods SCIPvarGetBestBoundGlobal() and SCIPvarGetWorstBoundGlobal().
5505- Constraint Handler:
5506 - added public wrapper functions for calling constraint handler callback methods for a single constraint:
5507 SCIPactiveCons(), SCIPdeactiveCons(), SCIPinitlpCons(), SCIPsepalpCons(), SCIPsepasolCons(), SCIPpropCons(),
5508 SCIPrespropCons(), SCIPenfopsCons(), SCIPenfolpCons()
5509 - added basic creation methods for all constraint handlers
5510 - SCIPchgCapacityKnapsack() which can be used to change the capacity of a knapsack constraint
5511 - SCIPconsIsAdded() which returns whether a constraint was already to a SCIP instance
5512 - SCIPconshdlrGetNCutsApplied() in pub_cons.h to get the number of cuts applied to the lp
5513 - SCIPconshdlrIncNAppliedCuts() in cons.h to increase the number of applied cuts (used by sepastore.c)
5514 - SCIPchgVarName() and SCIPchgConsName() which can be used to change name of variables and
5515 constraints in problem creation stage
5516 - New methods SCIPgetConsVars() and SCIPgetConsNVars() which return for a given constraint the involved variables and
5517 the number of variables if the corresponding constraint supports this (optional) callbacks
5518 (corresponding callbacks need to be implemented, see above)
5521 - SCIPmessagehdlrCapture() which captures a given message handler (increases number of uses)
5522 - SCIPmessagehdlrRelease() which releases and possibly frees a given message handler (decreases number of uses)
5523 - SCIPsetMessagehdlrLogfile() which can be used to write into a log file
5524 - SCIPsetMessagehdlrQuiet() which can be used to turn the screen output on and off
5526### Command line interface
5528- in the interactive shell, parameters can be fixed and unfixed with `fix` (instead of `set`), e.g., `fix heuristics rens freq TRUE`;
5529- new shell command `change minuc` to minimize the number of unsatisfied constraints
5531### Interfaces to external software
5533- beta-version of a MATLAB interface can be found under interfaces/matlab
5534- beta-version of a AMPL interface can be found under interfaces/ampl
5536### Changed parameters
5538- `branching/fullstrong/reevalage` changed from an integer to a longint parameter
5540- Removed parameters:
5541 - `separating/closecuts/separootonly`
5542 - `constraints/quadratic/defaultbound`
5543 - `separating/cgmip/nodelimit`
5547- `constraints/%s/timingmask` for changing the timingmask for calling the propagtion method of all constraint plugins
5548- `constraints/and/dualpresolving` by default set to TRUE, enabling dual-presolving on and-constraints
5549- `constraints/indicator/{sepacouplingcuts,sepacouplinglocal}` to enable separation of (local) cuts
5550- `constraints/indicator/{maxsepacuts,maxsepacutsroot}` to restrict the number of separated cuts
5551- `constraints/indicator/dualreductions` to enable dual presolving/propagation steps
5552- `constraints/setppc/cliquelifting`, `constraints/setppc/addvariablesascliques`,
5553 `constraints/setppc/cliqueshrinking`, first for enabling/disabling the clique lifting algorithm in cons_setppc.c,
5554 second parameter is for trying to create extra clique constraints in lifting algorithm, third parameter is for trying
5555 to decrease the number of variable in a clique constraint in the lifting algorithm
5556- `limits/totalnodes` that allows to stop at the correct node if a restart occured; therefore the new
5557 `SCIP_STATUS_TOTALNODELIMIT` is added
5558- `lp/{rootiterlim,iterlim}` to set a limit on the LP iterations spend in the initial root LP and each
5559 LP resolve, respectively
5560- `misc/transorigsols` by default set to TRUE, that switches whether SCIP tries to transfer original
5561 solutions into the transformed space (in initsol and if a heuristic adds an original solution during solving)
5562- `numerics/hugeval` that defines the smalles value counting as huge (see new method SCIPisHugeValue())
5563- `numerics/recompfac` which denotes the factor, by which the absolute of an iteratively updated value has
5564 to be decreased in order to recompute the value from scratch
5565- `presolving/convertinttobin/maxdomainsize` by default is set to `SCIP_LONGINT_MAX`, which deternmines
5566 the domainsize for which integers are converted to their binary representation
5567- `presolving/convertinttobin/onlypoweroftwo` by default is set to FALSE, that parameter allows you to
5568 only convert integer variables with a domainsize of 2^p-1 to their binary representation
5569- `presolving/convertinttobin/samelocksinbothdirections` by default is set to FALSE, that parameter allows
5570 you to convert only integer variables to their binary representation, which have the same amount of up- and downlocks
5571- `presolving/gateextraction/sorting` by default is set to 1, that parameter determines if you want to try
5572 to extract big-gates(-1) or small-gates(1) at first by ordering bigger/smaller logicor constraint up front, or use
5573 them as they are (0)
5574- `presolving/gateextraction/onlysetpart` by default is set to FALSE, that parameter allows you to
5575 only extract set-partitioning and no and-constraints
5576- `presolving/gateextraction/searchequations` by default is set to TRUE, that parameter allows you to
5577 search for logicor constraints and set-packing/-partitioning constraints with same variables
5578- `propagating/%s/timingmask` for changing the timingmask for calling the propagtion method of all propagator plugins
5579- `propagating/probing/maxdepth` to set the maximal depth until the probing propagation is executed
5580- `reading/cnfreader/useobj` to state whether an artificial objective, depending on the number of clauses
5581 a variable appears in, should be used, by default set to FALSE, old default behavior of reader corresponds to TRUE
5582- `separating/cgmip/{minnodelimit,maxnodelimit}` to determine node limit.
5583- `separating/closecuts/maxlpiterfactor` for iteration limit in relative interior point computation
5584- `separating/oddcycle/maxunsucessfull` to automatically turn off separation
5585- `oncepernode` in Rounding and Simple Rounding heuristic
5589- new data structure for binary trees (`SCIP_BT` and `SCIP_BTNODE` in pub_misc.h)
5590- renamed data structure `SCIP_STAIRMAP` to `SCIP_PROFILE`
5591- added new stages `SCIP_STAGE_INITPRESOLVE`, `SCIP_STAGE_EXITPRESOLVE` and `SCIP_STAGE_FREE`; renamed `SCIP_STAGE_FREESOLVE`
5592 to `SCIP_STAGE_EXITSOLVE`
5593- Changed the counting system within SCIP heavily. `SPARSESOLUTION` was renamed to `SCIP_SPARSESOL` and moved
5594 from cons_countsols.h to struct_misc.h
5599- the check script now recognizes MIQCP and MINLP instances
5600- make test now also checks instances in wbo, cnf, osil and fzn format
5601- renamed parameter SCRDIR of `make testgams` to CLIENTTMPDIR and changed its default to `/tmp`
5608- CppAD source code is now distributed with SCIP (`src/cppad`), so that `lib/cppad` is not used anymore;
5609 the default for EXPRINT has changed from none to cppad
5614- fixed bug with strong branching with the LP status for conflict analysis
5615- fixed bug w.r.t. adding a value to the objective offset of the transformed problem
5616- fixed wrong assert in feasibility pump stage 3
5617- fixed bug in solve.c, applied bounding for the initial lp was only done if root-lp-solution was valid but another
5618 solution could also have been added
5619- primal solutions with infinite objective value are now automatically discarded
5620- all plugins that solve sub-SCIPs now do not stop the whole solution process if there has been an error
5621- fixed bug in cip reader, wrong use of SCIPstrtok()
5624 - fixed bug in shiftandpropagate w.r.t. SCIPconstructLP() which can have the side effect that variables are created
5625 - method SCIPvarGetProbvarSum() (and thus also SCIPgetProbvarSum()) returns +/-infinity if the variable resolves to a
5626 variable fixed to +/-infinity (depending on the sign of the scalar) but does not multiply with the scalar, anymore
5627 - better handling of infinite solution values for aggregated and negated variables
5628 - fixed bug that disabled multi-aggregation of two integer or implicit integer variables
5629 - fixed bug in sol.c with requesting values of transformed variables in original solution; previously this had only
5630 been handled in SCIPgetSolVal(), now the handling has been moved to SCIPsolGetVal()
5631 - fixed several bugs writing an mps file in the reader_mps.c, e.g. writing fixed variables which are not (yet) removed
5632 and writing integer variables even with an objective value of 0, if they only exist in non-linear constraints
5635 - fixed minor bugs with respect to counting generated and lifted cuts in sepa_oddcycle
5636 - fixed bug in sepa_clique.c, could not handle only empty cliques, that were not removed
5639 - fixed potential bugs in shiftandpropagate heuristic concerning the transformation update of a variable with free status
5640 - fixed bug in heur_zirounding with computation of up/downslacks
5641 - fixed bug in mutation heuristic with unnecessary aborts due to a wrong memory limit
5642 - fixed potential bug in fix-and-infer heuristic with variables being fixed to infinite value
5643 - fixed bug in diving heuristics with variables being fixed to values outside their domain
5644 - fixed bug in simple rounding heuristic with column generation for variables with strictly positive lower bound
5645 - made Octane heuristic numerically more stable to avoid asserts being caused by cancellation
5646 - fixed bug in mutation heuristic with variables being fixed to infinite values
5647 - do not run heur_shiftandpropagate if there is no LP
5650 - fixed bug in Cplex LPI: after running simplex, solisbasic flag was always true, which might be wrong if Cplex hit a
5652 - fixed bug in SCIP probing mode with cleared LPI state but solved LP
5653 - fixed assert with `LPI=none` (need to count rows/cols in lpi_none)
5654 - fixed bug in SoPlex LPI where objective sense was not correct after reading LP from file in SCIPlpiReadLP()
5657 - fixed bug in scip.c adding a constraint in SCIPgetConsCopy() to the constraint hashmap
5658 - fixed bug in cons_linear w.r.t recalculation of unreliable activities
5659 - fixed bug in cons_linear concerning huge activity values: besides infinite contributions, we now also treat huge
5660 contributions separately, count their occurences in a constraint and provide a relaxed activity value
5661 - fixed bug in cons_xor.c parsing a constraint
5662 - fixed count of propagations in cons_indicator and only try to propagate if variables are not yet fixed
5663 - fixed some bugs in cons_disjunction.c (wrong assert, forgotten deletion of constraint, wrong SCIPreleaseCons() call)
5668- first release of GCG, a generic branch-cut-and-price solver built on top of SCIP
5669- first release of UG, a framework for solving mixed integer programs, mixed integer
5670 nonlinear programs and constraint integer programs in parallel
5672- renamed ZIB Optimization Suite to SCIP Optimization Suite
5674@page RN21 Release notes for SCIP 2.1
5676@section RN212 SCIP 2.1.2
5677*************************
5679Performance improvements
5680------------------------
5682- fixed performance issue in debug mode, where SCIPvarGetLPSol_rec() calculated a value to often, which in the end lead
5683 to exponential growth in running time
5684- force cuts from linearizations of convex constraint in NLP relax solution into LP, thus allowing faster proving of
5685 optimality for convex NLPs
5690- fixed bug in varAddTransitiveImplic() in var.c, when adding implications on special aggregated, namely negated, variables
5691- fixed issue if a primal solution leads to a cutoff of the current focus node
5692- fix compilation issues with zlib 1.2.6
5693- fixed bug in SCIPsolveKnapsackExactly(), trying to allocate too much memory which led to an overflow and later to a segmentation fault
5694- fixed bug in sepa_rapidlearning, carrying on the optimization process, when already solved
5697 - fixed bug in heur_undercover.c, where a variable with fixed bounds but not of status `SCIP_VARSTATUS_FIXED` was wrongly handled
5698 - fixed bug in heur_oneopt.c which forgot to check LP rows if local rows are present
5701 - fixed bug in SCIPsolveKnapsackExactly()
5702 - fixed bug in cons_quadratic where bounds on activity of quadratic term were not always invalidated when quadratic variables were removed
5703 - fixed bug in cons.c, where after a restart the arrays for all initial constraints were corrected in the initsol process
5704 instead of the initpre process, this was to late because you might change the status in presolving which lead to an assert()
5705 - fixed bug in NLP representation of abspower constraints handling (x+a)^2 with nonzero a
5706 - fixed bug parsing an and-constraint in cip format
5707 - fixed bug in cons_setppc, did not handle new constraints with inactive variables
5708 - fixed bug in cons_xor.c which did not copy the artificial integer variable (used for the lp relaxation)
5710@section RN211 SCIP 2.1.1
5711*************************
5716- the pseudo objective propagator can be forced to propagate if active pricers are present; this can be done
5717 if for all (known or unknown) variables follows that: they have positive (negative) objective coefficient
5718 and the global lower (upper) bound is zero.
5720Performance improvements
5721------------------------
5723- improvements in undercover heuristic
5724- improve SCIPintervalSolveBivariateQuadExpressionAllScalar() for ax=0 case if x has 0 in the interval for the linear coef.
5725- better domain propagation for quadratic constraints that consist of `non-overlapping` bilinear terms only
5726- ensure that a fixing of a variable in an abspower constraint is propagated to a fixing of the other variable
5727- improvements in undercover heuristic, e.g., bound disjunction constraints are considered when setting up the covering problem
5732### Changed parameters
5734- changed parameter `propagating/pseudoobj/maxcands` to `propagating/pseudoobj/minuseless` (see prop_pseudoobj.c)
5735 due to revision of the pseudo objective propagator
5739- added parameters `heuristics/undercover/coverbd` and `heuristics/undercover/fixingorder`
5744- fixed numeric issue in aggregations
5745- fixed pseudo cost computation
5746- fixed bug with setting type of slack variables to be implicitly integral
5747- fixed bug when copying problem data in c++ case returned with the result `SCIP_DIDNOTRUN`
5748- fixed computation of counter which state the changes since the last call of a presolver
5749- fixed handling of unbounded solutions, including double-checking their feasibility and that the primal ray is a
5750 valid unboundedness proof and reoptimizing the LP with modified settings if the solution is not feasible
5751- fixed compilation issues with negate() function in intervalarith.c on exotic platforms
5752- fixed bug in SCIPsortedvecDelPos...() templates
5753- pseudo objective propagator does not propagate it active pricers are present
5754- fixed bug in heur_shiftandpropagate.c concerning the treatment of unbounded variables
5755- workaround for trying to add variable bounds with to small coefficients
5757- Reading and Writing:
5758 - gams writer now also substitutes $-sign from variable/equation names
5759 - fixed bug in reader_mps.c: INTEND marker is now also written, if COLUMNS section ends with non-continous variables
5760 - fixed bug in flatzinc reader w.r.t. boolean expressions
5763 - fixed constraint flags evaluation within the ZIMPL reader (reader_zpl.c)
5764 - fixed bug in SCIPmakeIndicatorFeasible() in cons_indicator.c
5765 - fixed bug with conflict clause modification in cons_indicator
5766 - fixed bug in cons_bounddisjunction with uninitialized return values
5767 - fixed bug in cons_orbitope with calling conflict analysis
5768 - fixed bug in nlpi_oracle w.r.t. changing linear coefs in a NLP constraint
5770@section RN210 SCIP 2.1.0
5771*************************
5776- New original solution storage capability, which allows transfering solutions between SCIP runs
5777- SCIP-CPX is now threadsafe
5778- comparison of solutions now also works for original solutions
5779- can now compute the relative interior point of the current LP
5780- interval arithmetics for power, log, exp, bivariate quadratic expressions should be rounding safe now
5781- LP iterations in resolving calls can now be limited w.r.t. the average number of LP iterations in previous calls
5782 (after the root node); this is currently only done for the initial LP solve at a node and the corresponding parameter
5783 resolveiterfac is set to -1 (no limit) per default
5784- it is now possible in `SCIP_STAGE_TRANSFORMED` to call SCIPaddVarLocks() (i.e. to lock variables in initialization methods)
5785- changed computation of optimality gap which is now done in the same way as described in the MIPLIB 2010 paper: the gap
5786 is 0, if primalbound (pb) and dualbound (db) are equal (within tolerances), it is infinity if pb and db have opposite
5787 signs and (this changed), if both have the same sign, the difference between pb and db is devided by the minimum of
5788 the absolute values of pb and db (instead of always the dual bound)
5789- functionality to use the bound flipping ratio test of SoPlex is available (requires at least version 1.5.0.7)
5790- there exists now a solution candidate store for the original problem; during transformation these solutions are tried;
5791 during free the transformed problem the best feasible solution of the transformed problem are copied to the solution
5792 candidate store of the original problem; this useful if you solve several problems iteratively, solutions get now
5793 carried over automatically.
5794- reworked concept of lazy bounds: they can now also be used for problems where constraints and objective together
5795 ensure the bounds; to allow this also for diving heuristics that might change the objective and thus destroy this
5796 property, lazy bounds are explicitly put into the LP during diving and removed afterwards
5797- `SCIP_HASHMAP` now works also without block memory
5798- The variable deletion event is now a variable specific event and not global, anymore.
5799- All timing flags are now defined type_timing.h.
5800- all C template files are now called <plugintype>_xyz.{c,h} instead of <plugintype>_xxx.{c,h}
5802- Separators and Cuts:
5803 - reorganized computation of scores in cut filtering: instead of the computation at the time of addition, scores are now
5804 only computed w.r.t. the current LP solution and when cut filtering is performed; one can now fill the cut storage
5805 with cuts that were separated for different solutions
5806 - New separator for close cuts and a new function to compute relative interior points of the LP
5807 - added first version of sepa_closecuts.{c,h} to separate cuts w.r.t. a point that is closer to the integral polyhedron
5810 - implement possibility to force a restart in cons_indicator if enough indicator variables have been fixed
5811 - the xor constraint handler can now parse its constraints
5812 - the bounddisjunction constraint handler can now parse its constraints
5813 - the knapsack, setppc and soc constraint handler can now parse their constraints
5814 - the varbound constraint handler can now parse its constraints
5815 - added beta version of variable deletion: for branch-and-price application, variables can now be completely deleted
5816 from the problem; variables that are deletable have to be marked with SCIPvarMarkDeletable(), constraint handlers can
5817 implement the new `SCIP_DECL_DELVARS` callback that should remove variables from the constraints; at the moment, only
5818 the linear, the setppc and the knapsack constraint handler support this callback; furthermore, when using this
5819 feature, all used plugins have to capture and release variables they store in their data, this is currently only done
5820 for the aforementioned constraint handlers as well as the and, the varbound and the logicor constraint handler; for
5821 more details about this feature, see the FAQ
5822 - added pseudoboolean constraint handler (cons_pseudoboolean.{c,h})
5823 - added first version of cons_disjunction.{c,h} which allows a disjunction of constraints
5824 - added constraint handler for (absolute) power constraints (cons_abspower.{c,h}) to handle equations like z = sign(x)abs(x)^n, n > 1
5827 - new heuristic vbounds which use the variables lower and upper bounds to fix variable and performs a neighborhood search
5828 - added vbound heuristic (heur_vbounds.{c,h})
5829 - added clique heuristic (heur_clique.{c,h})
5831- Reading and Writing:
5832 - added writing for wbo files
5833 - added writing for pip files (linear, quadratic, polynomial nonlinear, polynomial abspower, polynomial bivariate, and
5835 - CIP format variable characters defined, e.g. `SCIP_VARTYPE_INTEGER_CHAR`
5836 - Improved support for wbo format for weighted PBO problems, IBM's xml-solution
5837 format and pip and zimpl format for polynomial mixed-integer programs
5838 - New reader for (standard) bounds on variables
5839 - Extended reader for CIP models to handle various new constraints, including all types of linear constraints
5840 - flatzinc reader is now capable to read cumulative constraints
5841 - changed opb(/wbo) reader which now creates pseudoboolean constraints instead of linear- and and-constraints, only a
5842 non-linear objective will create and-constraints inside the reader and while reading a wbo file the topcost constraint
5844 - added clock for determine the time for reading
5845 - added reader for variable bounds (reader_bnd.{c,h})
5846 - Removed method SCIPreadSol(); call solution reading via SCIPreadProb() which calls the solution reader for .sol files.
5849 - Major extensions for nonlinear CIP, new option for n-ary branching on nonlinear variables (within pseudocost branching rule)
5850 - added BETA version of constraint handler for nonlinear constraints (cons_nonlinear.{c,h}) to handle nonlinear
5851 equations given by algebraic expressions using operands like addition, multiplication, power, exp, log, bivariate
5852 nonlinear constraints; currently no trigonometric functions
5853 - added BETA version of constraint handler for bivariate nonlinear constraints (cons_bivariate.{c,h}) to compute tight
5854 estimators for 1-convex and convex-concave bivariate nonlinear functions (given as expression tree)
5855 - the gams writer can now write nonlinear, abspower and bivariate constraints
5856 - Extended writer for GAMS and pip format to write more types of nonlinear constraints
5857 - the pip and zimpl reader now create nonlinear constraints for polynomials of degree > 2
5860 - new dual presolving methods in cons_setppc and cons_logicor
5861 - new presolving step `removeConstraintsDueToNegCliques` in locigor constraint handler which updates logicor constraints
5862 to setppc constraints if a negated clique inside this constraint exist, by default is off
5863 - new presolving step in cons_knapsack (detectRedundantVars, deleteRedundantVars) which determines redundant variables
5864 in knapsack constraint with or without using clique information
5865 - cons_logicor is now able to replace all aggregated variables in presolving by there active or negation of an active
5866 variable counterpart
5867 - prop_pseudoobj is now working in presolving as well
5868 - implement presolving in exitpre() in cons_orbitope and cons_indicator
5871 - added counter for number calls and timing for resolve propagation calls for constraint handler and propagators
5872 - Propagators are now also called in node presolving
5873 - the probing presolver presol_probing.{c.h} is now a propagator prop_probing.{c,h}, all corresponding parameters moved as well
5874 - the redcost separator sepa_redcost.{c.h} is now a propagator prop_redcost.{c,h}, all corresponding parameters moved as well
5875 - outsourced propAndSolve() method in solve.c which calls domain propagation and solving of the lp and relaxation
5878 - solutions which are given by the user from the outside are now marked by `#` in the output
5879 - the `Solving Time` is now spitted into presolving, solving and reading time
5880 - Presolvers section has new column `AddCons` which states the number of added constraint
5881 - Constraints section has new column named \#ResProp which show the number of resolve propagation calls of certain
5883 - Constraint Timing section has a new column \#ResProp which states the time spend in resolve propagation method of the
5885 - improved output of propagators in display statistics
5886 - new section `Propagator Timing` which shows the time spend in different callbacks of the propagator
5887 - rearranged first two columns of Propagators section; \#Propagate and \#ResProp stating the number of call for
5888 propagation and resolve propagation; the Time column is moved into the new section Propagator Timings
5889 - Constraints section has new column named `MaxNumber` which the maximum number of active constraint of a certain
5891 - added two columns `Time-0-It` and `Calls-0-It` in the LP section which states the number of LP call and time spend for
5892 solving LPs with zero iterations (only refactorization)
5893 - The display of statistics for presolvers, propagators, constraints and LP solving has changed.
5895Performance improvements
5896------------------------
5898- Reorganized filtering process of separation storage (allows adding cuts for different solutions)
5899- Improved presolving for various constraint handlers
5900- Improved propagation methods for variable bound constraints
5901- Improved performance for quadratic constraints
5902- performance improvements in prop_vbounds
5903- child selection rules now get also applied when the relaxation value is equal to the bound changed in branching
5904- added dual reduction to cons_cumulative.c
5905- for continuous variables, the pseudo costs update and the pscost branching rule now use the same strategies for
5906 updating the pseudo costs and estimating the improvement in the LP bound
5907- only perform probing if the variables are locked
5908- performance and memory consumption improvements in xmlparse.c
5909- Improved knapsack cover cuts
5910- avoid very long separation times of LEWIs in cons_knapsack for very large minimal covers
5911- used SCIPallocMemoryArray() instead of SCIPallocBlockMemoryArray() which leads to fewer memory consumption in
5912 getLiftingSequence() in cons_knapsack, also improved cache use bei using an extra array instead blockmemory chunks
5913- switched FASTMIP from 1 to 2 for CPLEX and changed default pricing rule back to steepest edge pricing instead of
5914 quickstart steepest edge pricing
5915- made sorting method more robust
5916- LNS heuristics now use SCIPcopy() by default
5917- considering inactive variables in undercover heuristic; limiting effort for solving covering problem
5918- if during probing mode the LP relaxation is solved from scratch, e.g., when calling the shiftandpropagate heuristic
5919 before root node solving, then we clear the resulting LP state, since it might be a bad starting basis for the next
5920 solve of the LP relaxation (controlled by new parameter `lp/clearinitialprobinglp`)
5921- included LP simplifier into SoPlex LP interface, applied when solving from scratch (lpi_spx.cpp)
5922- new presolving steps in varbound constraint handler, tightening bounds, coefficients, sides and pairwise presolving
5928 - The emphasis setting types now distinguish between plugin-type specific parameter settings (default, aggressive, fast, off),
5929 which are changed by SCIPsetHeuristics/Presolving/Separating(), and global emphasis settings (default, cpsolver, easycip,
5930 feasibility, hardlp, optimality, counter), which can be set using SCIPsetEmphasis().
5932### New and changed callbacks
5934- added propagator timings `SCIP_PROPTIMING_BEFORELP`, `SCIP_PROPTIMING_DURINGLPLOOP` and `SCIP_PROPTIMING_AFTERLPLOOP` for
5935 all propagation callbacks (see propagators and constraint handlers) which lead to calling the propagation methods of a
5936 propagator before the lp is solved, during the lp loop and after the lp solving loop
5939 - Added parameter `separate` to conflict handler callback method SCIP_DECL_CONFLICTEXEC() that defines whether the conflict
5940 constraint should be separated or not.
5942- Constraint Handler:
5943 - The new constraint handler callback SCIP_DECL_CONSDELVARS() is called after variables were marked for deletion.
5944 This method is optional and only of interest if you are using SCIP as a branch-and-price framework. That means,
5945 you are generating new variables during the search. If you are not doing that just define the function pointer
5947 If this method gets implemented you should iterate over all constraints of the constraint handler and delete all
5948 variables that were marked for deletion by SCIPdelVar().
5950- NLP Solver Interface:
5951 - The callbacks SCIP_DECL_NLPIGETSOLUTION() and SCIP_DECL_NLPISETINITIALGUESS() got new parameters to get/set values of
5953 - The callback SCIP_DECL_NLPICOPY() now passes the block memory of the target SCIP as an additional parameter.
5956 - New parameters `isunbounded` and `isinfeasible` for presolving initialization (SCIP_DECL_CONSINITPRE(),
5957 SCIP_DECL_PRESOLINITPRE(), SCIP_DECL_PROPINITPRE()) and presolving deinitialization (SCIP_DECL_CONSEXITPRE(),
5958 SCIP_DECL_PRESOLEXITPRE(), SCIP_DECL_PROPEXITPRE()) callbacks of presolvers,
5959 constraint handlers and propagators, telling the callback whether the problem was already declared to be
5960 unbounded or infeasible. This allows to avoid expensive steps in these methods in case the problem is already
5963 Note, that the C++ methods
5964 - scip::ObjConshdlr::scip_presol() corresponding to SCIP_DECL_CONSPRESOL()
5965 - scip::ObjConshdlr::scip_initpre() corresponding to SCIP_DECL_CONSINITPRE()
5966 - scip::ObjPresol::scip_initpre() corresponding to SCIP_DECL_PRESOLINITPRE()
5967 - scip::ObjProp::scip_initpre() corresponding to SCIP_DECL_PROPINITPRE()
5968 - scip::ObjConshdlr::scip_exitpre() corresponding to SCIP_DECL_CONSEXITPRE()
5969 - scip::ObjPresol::scip_exitpre() corresponding to SCIP_DECL_PRESOLEXITPRE()
5970 - scip::ObjProp::scip_exitpre() corresponding to and SCIP_DECL_PROPEXITPRE()
5971 are virtual functions. That means, if you are not adding the new parameters, your code will still compile, but these methods are not executed.
5972 - Propagators are now also called in during presolving, this is supported by the new callback methods SCIP_DECL_PROPINITPRE(),
5973 SCIP_DECL_PROPEXITPRE(), and SCIP_DECL_PROPPRESOL().
5974 - The new parameters `nnewaddconss` and `naddconss` were added to the constraint handler callback method SCIP_DECL_CONSPRESOL()
5975 and the presolver callback method SCIP_DECL_PRESOLEXEC(). These parameters were also added to corresponding C++ wrapper
5976 class methods (scip_presol() in objconshdlr.h and scip_exec() in objpresol.h)
5979 - The callback SCIP_DECL_PROBCOPY() got a new parameter `global` to indicate whether the global problem or a local version is copied.
5981### Deleted and changed API methods
5983- implemented SCIPlpiGetPrimalRay() in SoPlex interface that has become available with SoPlex version 1.5.0.2
5984- allowed calling SCIPgetRowSolActivity() in `SCIP_STAGE_SOLVED`, since LP is still available
5985- various extensions and modifications for expressions and expression trees (too much to state here)
5986- The result value `SCIP_NEWROUND` has been added, it allows a separator/constraint handler to start a new separation round
5987 (without previous calls to other separators/conshdlrs).
5988- SCIPcalcNodeselPriority() got a new parameter `branchdir`, which defines the type of branching that was performed: upwards, downwards, or fixed.
5990- Constraint Handlers:
5991 - Method SCIPincludeQuadconsUpgrade() of quadratic constraint handler got new parameter `active` to indicate whether the upgrading method is active by default.
5992 - Method SCIPseparateRelaxedKnapsack() in knapsack constraint handler got new parameter `cutoff`, which is a pointer to store whether a cutoff was found.
5994- Nonlinear expressions, relaxation, and solver interface:
5995 - SCIPcreateNLPSol() now creates a `SCIP_SOL` that is linked to the solution of the current NLP relaxation
5996 - Various types and functions dealing with polynomial expressions have been renamed to use the proper terms `monomial` and
5997 `polynomial` in nonlinear expressions (nlpi/∗expr*); results in many renamings of types, structs and methods.
5998 - The methods SCIPnlpGetObjective(), SCIPnlpGetSolVals(), and SCIPnlpGetVarSolVal() have been removed, use SCIPgetNLPObjval(),
5999 SCIPvarGetNLPSol() and SCIPcreateNLPSol() to retrieve NLP solution values instead.
6000 SCIPcreateNLPSol() now returns an error if NLP or NLP solution is not available
6001 - Removed methods SCIPmarkRequireNLP() and SCIPisNLPRequired(), because the NLP is now always constructed if nonlinearities
6003 - SCIPgetNLP() has been removed and NLP-methods from pub_nlp.h have been moved to scip.h, which resulted in some renamings, too.
6004 - renamed SCIPexprtreeEvalSol() to SCIPevalExprtreeSol() and now located in scip.h.
6005 - renamed SCIPexprtreeEvalIntLocalBounds() to SCIPevalExprtreeLocalBounds() and now located in scip.h.
6006 - renamed SCIPexprtreeEvalIntGlobalBounds() to SCIPevalExprtreeGlobalBounds() and now located in scip.h.
6007 - The functions SCIPnlpiGetSolution() and SCIPnlpiSetInitialGuess() got additional arguments to get/set dual values.
6008 - The method SCIPgetNLPI() got a new parameter `nlpiproblem`, which is a pointer to store the NLP solver interface problem.
6011 - SCIPincludeProp() got additional parameters to set the timing mask of the propagator and the new callbacks and parameters
6012 related to calling the propagator in presolving.
6013 - SCIPincludeConshdlr() got additional parameters to set the variable deletion callback function and the timing mask for
6015 - removed parameters timelimit and memorylimit from SCIPapplyRens()
6016 - The parameters `timelimit` and `memorylimit` were removed from SCIPapplyRens().
6019 - The method SCIPcopyProb() got a new parameter `global` to indicate whether the global problem or a local version is copied.
6021- Writing and Parsing Constraints:
6022 - The methods SCIPwriteVarName(), SCIPwriteVarsList(), and SCIPwriteVarsLinearsum() got a new boolean parameter `type`
6023 that indicates whether the variable type should be written or not.
6024 - The methods SCIPparseVarName() and SCIPparseVarsList() got a new output parameter `endptr` that is filled with the position
6025 where the parsing stopped.
6026 - The method SCIPwriteVarsList() got additionally a new parameter `delimiter` that defines the character which is used for delimitation.
6029 - SCIPmarkDoNotMultaggrVar()/SCIPvarMarkDoNotMultaggr() now allow to mark negated and aggregated variables
6030 - SCIPgetVarCopy() got a new parameter `success` that will be FALSE if method is called after problem creation stage and no hash map is
6031 given or no image for the given variable is contained in the given hash map.
6032 - SCIPchgVarType() got an extra boolean parameter to store if infeasibility is recognized while upgrading a variable from continuous
6033 type to an integer type.
6034 - SCIPdelVar() got a new parameter `deleted`, which stores whether the variable was successfully marked to be deleted.
6036### New API functions
6038- information about the quality of the solution of an LP (currently the condition number of the basis matrix) can now be:
6039 + requested from the LPI (currently only available for CPLEX): methods SCIPlpiGetRealSolQuality() and
6040 + SCIPprintLPSolutionQuality() command display lpsolquality in interactive shell display column lpcond to show
6041 + estimate on condition number, if available
6042- SCIPround() and SCIPfeasRound() to round to nearest integer
6043- SCIPsortRealRealIntInt() and corresponding sorting/inserting/deleting methods in pub_misc.h and necessary defines in misc.c
6044- SCIPsortRealIntLong(), SCIPsortPtrPtrRealInt() and corresponding sorting/inserting/deleting methods in
6045 pub_misc.h and necessary defines in misc.c
6046- SCIPcomputeLPRelIntPoint() to compute relative interior point of the current LP
6047- SCIPstartSolvingTime() and SCIPstopSolvingTime() which can be used to start or stop the solving time clock
6048- SCIPstrToRealValue() and SCIPstrCopySection() in pub_misc.h; these methods can be used to convert a string
6049 into a `SCIP_Real` value and to copy a substring.
6050- SCIPgetBinvarRepresentatives() which gets binary variables that are equal to some given binary variables,
6051 and which are either active, fixed, or multi-aggregated, or the negated variables of active, fixed, or multi-aggregated variables
6052- SCIPhasPrimalRay() and SCIPgetPrimalRayVal() that return whether a primal ray is stored and which value a
6053 given variable has in the primal ray, respectively
6054- SCIPsetConsModifiable()
6055- SCIPsetParam() which is a generic parameter setter method, independent of the parameter type
6056- SCIPpropInitpre(), SCIPpropExitpre(), SCIPpropPresol() which initializes, exists and executes the presolving phase
6057- SCIProwGetAge() to access the age of a row (pub_lp.h/lp.c)
6058- SCIPsolGetOrigObj() in pub_sol.h which returns for a solution in the original problem space the objective value
6059- SCIPretransformSol() in scip.h that allows to retransform a solution to the original space
6060- SCIPlpiClearState() to LP interfaces for clearing basis information in the LP solver
6061- SCIPgetSubscipDepth() to access the depth of the current SCIP as a copied subproblem
6062- SCIPdebugAddSolVal() and SCIPdebugGetSolVal() to add/get values to/from a debug solution
6063- SCIPsepastoreRemoveInefficaciousCuts() to remove non-efficious cuts from the separation storage
6066 - SCIPnodeGetParent() to get parent node of a node
6067 - SCIPnodesSharePath() in pub_tree.h that determines whether two nodes are on the same leaf-root path
6068 - SCIPnodesGetCommonAncestor() in pub_tree.h that finds the common ancestor node for two given nodes
6071 - SCIPgetReadingTime() which returns the time for reading in seconds
6072 - SCIPparseVarsLinearsum(), SCIPparseVarsPolynomial() and SCIPwriteVarsPolynomial() and for writing and
6073 parsing polynomials in constraint handler writing/parsing methods
6076 - SCIPcreateMesshdlrPThreads() and SCIPfreeMesshdlrPThreads() for allocating and deleting necessary memory
6077 for message handlers for parallel pthread version
6078 - SCIPallocClearMemoryArray() and BMSallocClearMemoryArray() for allocating cleared memory arrays in scip.h and memory.h
6081 - SCIPintervalPowerScalarInverse() to solve an equation y = x^p for given bounds on y and scalar exponent p
6082 - SCIPintervalQuadBivar() to compute tight bounds on a bivariate quadratic form
6083 - SCIPintervalSolveBivariateQuadExpressionAllScalar() to compute tight bounds on the solutions of a bivariate quadratic equation
6086 - SCIPcomputeVarCurrent{L,U}b{Local,Global}() to compute local or global lower or upper bounds of a
6087 multiaggregated variable from the bounds of the aggregation variables
6088 - SCIPbranchVarValNary() for n-ary variable branching
6089 - SCIPgetNegatedVars() which returns all negated variables for a given array of variables, if the negated
6090 variables are not existing yet, they will be created
6091 - SCIPgetNTotalVars() that returns the total number of created vars, icluding variables that were deleted in the meantime
6092 - SCIPvarGetHashkey(), SCIPvarIsHashkeyEq(), SCIPvarGetHashkeyVal() in pub_var.h which can be used for `SCIP_HASHTABLE` of variables
6093 - SCIPvarGetNBdchgInfosLb() and SCIPvarGetNBdchgInfosUb() in pub_var.h returning the number of lower or upper bound changes on the active path
6094 - SCIPvarGetBdchgInfoLb() and SCIPvarGetBdchgInfoUb() returning the bound change information at the given position
6095 - SCIPvarMarkDeletable() to mark a variable to be deletable completely from the problem (for
6096 branch-and-price); can only be called before the variable is added to the problem
6097 - SCIPvarMarkNotDeletable() that marks a variable to be non-deleteable (used within SCIP for forbidding
6098 deletion of variables contained in solution, LP bases, (multi)aggregation, ...)
6099 - SCIPvarIsDeletable() that returns whether a variable is marked to be deletable (each variable is per default non-deletable)
6102 - SCIPgetNLPVarsNonlinearity() to get for each variable in the NLP the number of NLP rows in which this variable appears in a nonlinear way
6103 - SCIPnlrowGetDualsol(), SCIPgetNLPVarsLbDualsol(), SCIPgetNLPVarsUbDualsol() to retrieve dual values from an NLP solution
6104 - SCIPgetNLPFracVars() to get the fractional variables in an NLP solution
6107 - SCIPpropSetPresolPriority() which changes the presolving priority of a given propagator
6108 - SCIPpropGetPresolPriority(), SCIPpropGetPresolTime(), SCIPpropWasPresolDelayed(), SCIPpropGetNFixedVars(),
6109 SCIPpropGetNAggrVars(), SCIPpropGetNChgVarTypes(), SCIPpropGetNChgBds(), SCIPpropGetNAddHoles(), SCIPpropGetNDelConss(),
6110 SCIPpropGetNAddConss(), SCIPpropGetNUpgdConss(), SCIPpropGetNChgCoefs(), SCIPpropGetNChgSides(), SCIPpropGetTimingmask(),
6111 SCIPpropDoesPresolve() which return corresponding presolving information
6112 - SCIPpropGetNRespropCalls() and SCIPconshdlrGetNRespropCalls() which return the number of times a
6113 propagator or a constraint handler was called for resolving a propagation
6114 - SCIPpropGetRespropTime() and SCIPconshdlrGetRespropTime() which return time spent for resolving a
6115 propagation within a propagator or a constraint handler
6116 - SCIPcheckCumulativeCondition(), SCIPpropCumulativeCondition() and SCIPrespropCumulativeCondition() in
6117 cons_cumulative.h; these methods can be used to check, propagate, or resolve the propagation of a cumulative condition
6118 - SCIPpropagateCutoffboundVar() in prop_pseudoobj.h which can be used to propagate the cutoff bound for the given variables
6121 - added to linear constraint handler SCIPsetUpgradeConsLinear(), which (de-)activates the possibility to
6122 upgrade a linear constraint to a specialized linear constraint (e.g. knapsack)
6123 - SCIPconvertCutsToConss() and SCIPcopyCuts() to scip.{c,h} for copying cuts to linear constraints
6124 - SCIPaddCoefLogicor() to add a variable to a logic or constraint
6125 - SCIPfindOrigCons() which return a original constraint with the given name or `NULL`
6126 - SCIPconshdlrGetNAddConss() which returns the number of added constraints during presolving by a given constraint handler
6127 - SCIPpresolGetNAddConss() which returns the number of added constraints during presolving by a given presolver
6129### Command line interface
6131- New funtionalities in the interactive shell (modify current CIP instance, write NLP relaxation)
6132- added dialog `write nlp` to write current NLP relaxation to a file
6133- new dialog `change freetransproblem` to free transformed problem in the interactive shell before changing the problem
6134- it is possible to change bounds of a variable in the interactive shell
6135- it is possible to add a constraint to a problem in the interactive shell
6137### Interfaces to external software
6139- Improved SOPLEX interface (LP simplifier)
6140- Improved CPLEX interface, including measures for numerical stability
6142### Changed parameters
6144- change default value of parameter `nodeselection/restartdfs/selectbestfreq` 100
6145- moved parameters for pseudoboolean constraints from opb-reader to pseudoboolean constraint handler
6146- changed possible parameter values of `branching/pscost/strategy` from `bri` to `cdsu`: default is now `u`, i.e., to
6147 estimate the LP gain by a branching for external branching candidates (esp. continuous variables) the same way as
6148 their pseudo costs are updated
6149- added possible value `d` for `constraints/soc/nlpform` to choose a convex division form for SOC constraint
6150 representation in NLP
6151- renamed parameter `constraints/quadratic/linearizenlpsol` to `constraints/quadratic/linearizeheursol` and do
6152 linearizations in every solution found by some heuristic
6153- renamed parameter `constraints/quadratic/mincutefficacyenfo` to `constraints/quadratic/mincutefficacyenfofac` and
6154 interpret it as a factor of the feasibility tolerance
6155- removed fastmip setting 2, which means the dualsolution would not be calculated but because SCIP always asks for the
6156 dual solution, the lp would be reoptimized to calculate them; so it had no real effect
6157- all parameters in cons_indicator and cons_sos1 have been converted to lower case!
6158- changed default value of parameter `separating/gomory/maxroundsroot` to 10
6159- changed default value of parameter `separating/gomory/maxsepacutsroot` to 50
6160- removed parameter `heuristics/subnlp/nlpsolver`, use `nlp/solver` instead
6164- `branching/delaypscostupdate` to delay the update of pseudo costs for continuous variables behind the separation round: default is TRUE
6165- `branching/lpgainnormalize` to set the strategy how the LP gain for a continuous variable is normalized when updating the
6166 variables pseudocosts: default is to divide LP gain by reduction of variable's domain in sibling node
6167- `branching/pscost/nchildren` and `branching/pscost/nary*` to enable and customize n-ary branching on
6168 external branching candidates (e.g., in spatial branching for MINLP)
6169- `conflict/bounddisjunction/continuousfrac` which defines the maximum percantage of continuous variables
6170 within a conflict create by the bounddisjunction conflict handler
6171- `conflict/separate` which enables or disables the separation of conflict constraints
6172- `constraints/{nonlinear,quadratic,soc,abspower}/sepanlpmincont` to specify minimal required fraction
6173 of continuous variables in problem to enable linearization of convex constraints in NLP relaxation solution in root
6174- `constraints/indicator/forcerestart` and `constraints/indicator/restartfrac` to control forced restart in cons_indicator
6175- `constraints/indicator/generatebilinear` to generate bilinear (quadratic) constraints instead of indicator constraints
6176- `constraints/indicator/maxconditionaltlp` to enable a quality check for the solution of the alternative LP
6177- `constraints/indicator/removeindicators` to remove indicator constraints if corresponding vub has been added
6178- `constraints/linear/nmincomparisons` and `constraints/linear/mingainpernmincomparisons` to influence
6179 stopping criterium for pairwise comparison of linear constraints
6180- `constraints/pseudoboolean/decompose`, for pseudoboolean constraints to transform pseudoboolean constraints into linear- and and-constraints
6181- `constraints/quadratic/binreforminitial` to indicate whether linear (non-varbound) constraints added due to reformulation of products with
6182 binary variables in a quadratic constraints should be initial (if the quadratic constraint is initial), default is FALSE
6183- `constraints/quadratic/checkfactorable` to disable check for factorable quadratic functions (xAx = (ax+b)*(cx+d)) in quadratic constraints
6184 and not to use of this information in separation (generates lifted tangent inequalities according to Belotti/Miller/Namazifar if also
6185 linear vars are present)
6186- `constraints/quadratic/disaggregate` to split a block-separable quadratic constraint into several quadratic constraint
6187- `constraints/quadratic/maxproprounds` and `constraints/quadratic/maxproproundspresolve` to limit the
6188 number of propagations rounds for quadratic constraints within one propagation round of SCIP solve or during SCIP presolve
6189- `constraints/varbound/presolpairwise` that allows pairwise presolving of varbound constraints, default is TRUE
6190- `heuristics/shiftandpropagate/onlywithoutsol` to switch whether the heuristic should be called in case a primal solution is already present
6191- `limit/maxorigsol` which defines the size of the solution candidate store (default value is 10)
6192- `lp/resolverestore` controlling how LP solution is restored after diving: if TRUE by resolving them,
6193 if FALSE by buffering them; if `lp/freesolvalbuffers` is TRUE, we free the buffer memory each time (FALSE by default)
6194- `lp/clearinitialprobinglp` to clear LP state at end of probing mode, if LP was initially unsolved
6195- `lp/resolveitermin` and `lp/resolveiterfac` to limit the number of LP iterations in resolving calls:
6196 resolveiterfac is a factor by which the average number of iterations per call is multiplied to get the limit, but the
6197 limit is at least resolveitermin; default is -1 (no limit) for resolveiterfac and 1000 for resolveitermin
6198- `lp/resolverestore` and `lp/freesolvalbuffers` possibility to buffer and restore LP solution after diving without
6199 having to resolve the LP; currently turned off, because performance impact is unclear;
6200- `misc/improvingsols` which states whether only solutions which have a better (or equal) primal bound
6201 as the best known are checked; this is of interest if the check of a solution is expensive; default value is FALSE
6202- `misc/resetstat` which state if the statistics should be reseted if the transformed problem is freed
6203 (in case of a benders decomposition this parameter should be set to FALSE) default value is TRUE
6204- `nodeselection/restartdfs/countonlyleafs` in node selector restart dfs which can be used to select the counting process of processed nodes
6205- `presolving/donotaggr` to deactivate aggregation of variables globally
6206- `pricing/delvars` and `pricing/delvarsroot` that define, whether variables created at a node / the
6207 root node should be deleted when the node is solved in case they are not present in the LP anymore
6208- `propagating/%s/maxprerounds` for all propagators which allows to change to maximal number of rounds
6209 of presolving where this propagator participates in
6210- `propagating/%s/presoldelay` for all propagators which allows to change if the presolving call of the given propagator should be delayed
6211- `propagating/%s/presolpriority` for all propagators which allows to change the priority of calling the given propagator
6212- `propagating/pseudoobj/propfullinroot` for allowing to propagate all variables in the root node,
6213 instead of stopping after `maxcands` which is set by a parameter as well
6214- `reading/gmsreader/bigmdefault` and `reading/gmsreader/indicatorreform` reader_gms is now able to write indicator
6215 constraints (reformulated either via big-M or sos1)
6216- `reading/gmsreader/signpower` to enable writing sign(x)abs(x)^n as the rarely used gams function signpower(x,n)
6217- `separating/closecuts/maxunsucessful` to turn off separation if we can not find cuts
6218- `timing/reading` to add reading time to solving time
6222- split off `PARAMEMPHASIS` from `PARAMSETTING` (in pub_paramset.c/paramset.c)
6223- new data structure `SCIP_STAIRMAP`
6224- add expression graph data structures and methods for reformulation, domain propagation, simple convexity check on
6225 nonlinear expressions and simplification for expression trees and graphs
6230- New scripts for running tests with GAMS
6231- added scripts check_gams.sh, evalcheck_gams.sh and check_gams.awk and target `testgams` in Makefile
6232- adjusted all test scripts to use the same new optimality gap computation as in SCIP
6233- added Makefile option `VALGRIND=true` to enable running the SCIP checks (make test) through valgrind; valgrind errors
6234 and memory leaks are reported as fails
6235- moved *.test and *.solu files to subdirectory testset in check directory and adjusted test scripts
6243 - via `PARASCIP=true` as a `Makefile` option it is possible to compile SCIP threadsafe in DEBUG-mode, (in OPT-mode it's
6244 only necessary if non-default messagehandler or CppAD is used)
6245 - the `make` parameter `PARASCIP=true` leads to threadsafe message handlers where you need to call
6246 SCIPcreateMesshdlrPThreads() and SCIPmessageSetHandler()/SCIPmessageSetDefaultHandler() and SCIPfreeMesshdlrPThreads();
6247 therefore we need to link with pthread library
6248 - new variable $(INSTALLDIR) in Makefile which define installation directory for the libraries, $(INSTALLDIR)/lib/,
6249 binary, $(INSTALLDIR)/bin and include headers, $(INSTALLDIR)/include, the default value is the empty string
6252 - Linking against Clp and Ipopt has been simplified. Only the directory where the
6253 package has been installed need to be provided now. For details see the INSTALL file.
6254 - to link against IPOPT, only the base directory of an Ipopt installation need to be specified now; additionally, if
6255 building with gnu compilers, the Ipopt libraries directory is stored in the SCIP binary, which should make it easier
6256 to run with Ipopt shared libraries
6257 - to link against Clp, only the base directory of an Clp installation needs to be specified now
6260 - New targets `(un)install` in Makefile, support for valgrind in testing environment
6261 - new target `make libs` which compiles only the libraries
6262 - new target in Makefile `install` performs `make` and copies using the install command the include headers, binary, and
6264 - new target in Makefile `uninstall` removes libraries, binary and include headers form `INSTALLDIR`
6265 - removed target `lintfiles`, this target is now imitated by the `lint` target and a none empty variable `FILES`
6270- fixed bug in copying if the target SCIP already is in solving stage: it might be that the copy of a variable cannot be found/created
6271- fixed bug trying to print big messages bigger than `SCIP_MAXSTRLEN`
6272- fixed bug w.r.t. counting feasible solutions and turned of sparse solution test
6273- LP solution status is now checked when checking root LP solution. Otherwise, due to different time measurements, it
6274 might happen that the LP solving was stopped due to the time limit, but SCIP did not reach the limit, yet.
6275- fixed bug trying to tighten multiaggregated variables, which have only one active representation and this variable is already tightened
6276- fixed possible buffer overrun in tclique_graph.c
6277- fixed issue with interactive shell in case (user) plugins are included after the default plugins
6278- fixed bug where mutiaggregating leads to an aggregation and both variables were of implicit or integral type
6279- fixed bug in conflict.c, where LPi was manipulated, but not marked as not solved
6282 - fixed assertion in tree.c w.r.t. node estimation
6283 - fixed bug in debug.c: removed tree nodes had not been checked if they were pruned due to an incumbent solution found by a diving heuristic
6286 - fixed bug which occured when changing a bound in the solving stage when this variables got upgraded from continuous to
6287 a integer type, where the bounds of this variable were still not integral; due to that SCIPchgVarType() has changed (see above)
6288 - fixed bug in handling of lazy bounds that resulted in putting the bounds explicitly into the LP
6291 - fixed assert in sepa_clique.c which is currently not valid because implicit binary variables in cliques are ignored
6292 - fixed bug in sepa_zerohalf.c concerning inconsistent construction of solution array of variables and fixed wrong assert about variable bounds
6295 - fixed not correct merging of variable in logicor constraint handler and changed the name of the method to a common
6296 name used by other constraint handlers too(findPairsAndSets->mergeMultiples)
6297 - fixed bugs in changing the initial and checked flags for constraints in original problem
6298 - fixed bug in cons_linear.c, when scaling a constraint maxabscoef was not set correctly, furthermore the correction of
6299 maxabscoef was not handled correctly
6300 - fixed bug in cons_indicator.c trying to copy a constraint where the pointer to the linear constraint did not point to
6301 the already transformed linear constraint (, happend when SCIPcopy() is used after transforming before presolving)
6302 - fixed numerical bug in linear constraint handler: polishing of coefficients after fixing variables led to wrong
6303 results for continuous variables fixed to a close-to-zero value.
6304 - fixed bug in cons_bounddisjunction where branching on multiaggregated variables was tried while all aggregation variables are fixed
6305 - fixed bug in presolving of cons_logicor.c: adding variable implications can lead to further reductions; added call to applyFixings()
6306 - fixed bug in cons_countsols.c w.r.t. none active variables
6307 - fixed bug in cons_linear.c, scaling could have led to wrong values
6310 - fixed bug in reader_fzn.c w.r.t. cumulative constraints
6311 - fixed bug in reader_mps.c: if a variables first occurence is in the bounds section, then the corresponding variable bound was lost
6312 - fixed several issues in flatzinc reader
6313 - deactived checking of zero solution in Zimpl reader when no starting values are provided
6314 - reader_lp is now able to read lines longer than 65534 characters
6317 - fixed bug in copying NLPI interfaces that use block-memory (NLPI copy used block memory from source SCIP)
6318 - fixed memory leak in reader_pip.c
6319 - fixed memory leak in coloring part of maximum clique algorithm (tclique_coloring.c)
6320 - fixed memory leak in coloring part of maximum clique algorithm (tclique_coloring.c) in a better way
6323 - fixed bug which occured when the dual farkas multipliers were not available in the lpi because the LP could only be
6324 solved with the primal simplex due to numerical problems
6325 - fixed bug in ZI round heuristic that led to infeasible shiftings for numerically slightly infeasible rows with close-to-zero coefficients
6326 - fixed numerical issue in octane heuristic: close-to-zero values for ray direction could have led to bad computations
6329 - fixed bug in propagation of indicator constraints: cannot fix slack variable to 0 if linear constraint is disabled/not active
6330 - fixed bug in cons_linear.c while sorting the eventdatas during the binary variable sorting for propagation
6331 - fixed bug and wrong assert in heur_shiftandpropagate.c when relaxing continuous variables from the problem
6332 - fixed bug in cons_orbitope:resprop() for the packing case
6333 - fixed wrong changing of wasdelayed flag for propagators
6334 - fixed bug using wrong sign in infinity check in prop_pseudoobj
6335 - fixed bug in redcost propagator: can only be called if the current node has an LP
6336 - fixed bug w.r.t. infinity loop during propagation
6341- The interface contains several additional callback functions and parameters for plugins. Some effort may be required to compile your old
6342 projects with SCIP 2.1. For details see section `Changes between version 2.0 and 2.1` in the doxygen documentation.
6344@page RN20 Release notes for SCIP 2.0
6346@section RN202 SCIP 2.0.2
6347*************************
6349Performance improvements
6350------------------------
6352- improved twoopt-heuristic by considering larger search domains
6353- the SoPlex interface now has the capability to provide a primal ray, provided it is compiled against the next SoPlex release (>= 1.5.0.2)
6354- calculation of node priority now also works when variable's relaxation value is equal to a bound
6355- fixed issue w.r.t. calling primal heuristics after presolving detected infeasibility
6358 - fasten propagation in cons_knapsack.c due to negated clique partitions
6359 - recalculating only needed partitions in cons_knapsack.c, not always both
6362 - reduced memory usage of shift-and-propagate heuristic
6363 - knapsack constraints are now separated faster; SCIPsolveKnapsackExactly() now works faster and requires less memory
6364 - fasten knapsack separation by replacing SCIPallocBuffer(Array) through SCIPallocBlockMemory(Array)
6365 - improved runtime and memory consumption in SCIPsolveKnapsackExactly() in cons_knapsack.c
6370- fixed `make/make.project`
6371- fixed wrong assert in plugins that use SCIPcopy()
6372- fixed bug in DINS w.r.t. column generation
6373- fixed bug in var.c where a possible multiaggregation was resolved to an aggregation but the variables types were not
6374 checked to prefer more general types for aggregating; possible memory loss removed
6375- fixed bug in prop_vbounds.c w.r.t. infinity lower and upper bound of variable bound variables
6376- fixed bug w.r.t. setting wall clocks
6377- fixed wrong assert in var.c (replaced `==` through SCIPsetIsEQ()), real values do not have to be exactly the same when
6378 computed in different function
6379- fixed bug in SCIPsolveIsStopped() where it could happen that TRUE was reported if a nodelimit was reached but
6380 checknodelimits had been set to FALSE
6381- fixed three bugs when writing in fzn format (wrongly splitted writing buffer, wrong variables was used, floats were printed to short)
6382- fixed bug in conflict.c, infeasibility analysis with big values led to wrong result
6385 - fixed bug in DINS heuristic that occured when the incumbent solution value is outside the variable's current domain
6386 - fixed behavior of LNS heuristics when the subproblem aborts: continue in optimized mode, stop in debug mode
6387 - fixed segmentation fault in heur_subnlp.c which occured if resolving the NLP with a tighter feasibility tolerance
6388 failed with a solver error
6389 - fixed bug in heur_subnlp.c where constraints forbidding variable fixations where added if a cutoff was used in the subproblem
6390 - fixed bug in heur_subnlp.c where wrong constraints forbidding variable fixations where added in case of general integers
6393 - fixed bug in changing quadratic coefficients of a row in the NLP
6394 - fixed various small bugs in nonlinear expressions code
6395 - fixed removal of fixed linear variables from a nonlinear row: a fixed variable may have not been removed if there was
6396 also a multiaggregated variable
6399 - implemented SCIPlpiGetPrimalRay() in SoPlex interface that has become available with SoPlex version 1.5.0.2
6400 - fixed two bugs at nodes with unbounded LP relaxation: don't check lp rows of infinite solution; don't analyze conflict
6401 due to primal cutoff bound of -infinity
6402 - fixed wrong assumption that an optimal LP solution in the root is optimal for the problem if there are no active
6403 pricers, need to check also whether all variables are in the LP
6406 - fixed bug in reader_cip regarding reading of very long constraints
6407 - fixed bug while after restarting possible the aggregted variables were not removed in setppc constraints
6408 - fixed bug in cons_knapsack: in seldom circumstances the relaxation of a linear constraint can detect infeasibility,
6409 which was not handled properly
6410 - fixed bug w.r.t. to pricing variables in case new initial constraints come in during the price and cut loop
6411 - fixed bug in cons_soc.c w.r.t. upgrading from quadratic constraints with finite left-hand-side
6412 - fixed bug caused by not (correctly) counting boundchanges in cons_varbound.c
6413 - fixed bug in sorting mechanism in cons_xor.c
6414 - fixed wrong (neg)cliquepartition check in cons_knapsack.c when deleting a coefficient
6415 - fixed bug in cons_quadratic: in seldom cases, fixed variables may have been substituted out wrongly in presolve
6416 - fixed bugs in cons_countsols.c w.r.t. collecting feasible solutions and forbidding a found solution
6417 - fixed bug in cons_linear.c: multiaggregated variables were not removed when adding during solve, leading to a failing
6418 assert in tightenBounds due to an unsuccessful bound tightening
6421 - fixed bug concerning overflow in memsize calculation in set.c
6422 - fixed memory leak in SoPlex LP interface when requesting an unbounded solution
6423 - fixed memory leak in SoPlex LP interface when solving with LP scaling
6424 - fixed memory leaks in reader of TSP example
6426@section RN201 SCIP 2.0.1
6427*************************
6429Performance improvements
6430------------------------
6432- SCIP with SoPlex as LP solver now uses auto pricing by default (start with devex, switch to steepest
6433 edge after some iterations); this fixes timeouts on instances where devex converges very slowly
6434- fixing lifting of new knapsack items which are negated items of already included items, this could lead to very long presolving
6435- fixed performance issue in presolving w.r.t. to computing the number of new fixings, aggregated,
6436 and so on before a constraint handler presolver is called
6437- in case of adding constraints during pricing with initial flag set to
6438 TRUE, we add now these constraints after the pricing round to the LP
6439- changed parameter values in clique separator in order to avoid very large branch-and-bound trees
6444### New and changed callbacks
6446- allow access of transformed constraints in `SCIP_STAGE_TRANSFORMED`
6448### Changed parameters
6450- replaced parameter `constraints/quadratic/minefficacy` by `constraints/quadratic/minefficacysepa` and `constraints/quadratic/minefficacyenfo`
6451- added possible values `a` and `e` for `constraints/soc/nlpform` to enable automatic choice and convex exponential-sqrt
6452 form for SOC constraint representation in NLP
6457- fixed bug w.r.t. looseobjval; the counting of number of loose variables in the LP data structure was incorrect in case
6458 a variable got aggregated or multi-aggregated
6459- fixed bug in copy method of objvardata which should only create a new `SCIP_VARDATA` if the implemented subclass create
6460 a copy of the given objvardata object
6461- fixed bug in lp.c where in case of objlimit reached and fastmip not all variables where priced because of an incorrect
6463- fixed bugs in binpacking example w.r.t. empty struct and not initializing an array
6464- fixed bugs in sepa_clique.c concerning incorrect way to ignore implicit binary variables in cliques and non-active
6465 variables in implications
6466- fixed some bugs w.r.t. to casting pointer arrays
6467- fixed bug in vars.c which handled arrays with parts of original variables during resolving to active variables (using
6468 SCIPvarsGetProbvarBinary) wrong
6469- fixed bug in nlp.c: nlrowSearchQuadElem was using SCIPquadelemSortedFind() incorrectly
6472 - fixed assertion w.r.t. to probing during the propagation round of a branch-and-bound node
6473 - fixed computation of node's objective value estimate when branching on continuous variables (see
6474 SCIPtreeCalcChildEstimate(), SCIPtreeBranchVar())
6475 - fixed bug in statistic w.r.t. number of calls for external branching candidates
6476 - fixes to branching on continuous variables
6479 - fixed bug in reader_gms.c: linear coefficients for quadratic variables were not printed if they had no
6481 - fixed bug in reader_mps: indicator constraints do not output the slack variables anymore
6484 - fixed bugs in SCIPcopyConss: copy all active constraints (including disabled ones), *valid was not initialized to TRUE
6485 - fixed bug in debug.c w.r.t. checking of constraints and continuous variables
6486 - fixed bug in cons.c which didn't allow the changing of the separation and enforcement flag of a constraint in the
6488 - corrected behavior of the copy function in cons_indicator.c: create artificial linear constraint if linear constraint
6490 - fixed bug in cons_indicator.c: presolving cannot delete linear constraints; several other minor bugfixes
6491 - fixed bugs in cons_bounddisjunction where the branching during the constraint enforcement was done incorrectly
6492 - fixed bugs in cons_orbitope.c: orbitopal fixing for the packing case had two bugs; also fixed one wrong assert
6493 - fixed bugs in cons_sos?.c: take average of objestimate
6494 - fixed bug in cons_logicor, implications on none `SCIP_VARTYPE_BINARY` variable were handled wrong
6495 - fixed bug in cons_linear while trying to add a conflict without any variables
6496 - fixed bug in cons_indicator.c: creating constraints in transformed stage is now possible
6499 - fixed bug w.r.t. memory allocation for all values of a column in lpi_cpx.c
6500 - fixed bugs in SCIPnlpiOracleChgLinearCoefs() and SCIPnlpiOracleChgQuadCoefs() for the case where new coefficients where
6502 - fixed bugs in lpi_none.c w.r.t. debug and opt mode
6503 - fixed bug in lpi_cpx.c w.r.t. to wrong handling in case the crossover did not succeed
6506 - fixed bug in heur_subnlp when initialized starting values of a fixed variable in the NLP of the subscip
6507 - fixed bug in heur_undercover: removed option globalbounds, since we are not allowed to relax bounds at a probing node
6508 - fixed bug in heur_shiftandpropagate where some variables were initialized too late
6509 - fixed numerical issue in some heuristics: nearly-integral values that are between the feasibility and the integrality
6510 tolerance might not have been rounded correctly
6511 - fixed bug in heur_guideddiving: best solution is now copied to avoid deletion in case of many new solutions
6512 - fixed bug in DINS heuristic, information storage for binary variables could lead to bad memory access in column
6513 generation applications
6514 - fixed bug in heur_shiftandpropagate.c: Now, the heuristic checks rows for global infeasibility at the beginning. This
6515 check is only relevant if presolving is disabled.
6516 - fixed bug in heur_subnlp when forbidding a particular combination of integer variables in the main problem
6518@section RN200 SCIP 2.0.0
6519*************************
6524- added relaxation structure to SCIP, it represents global relaxation information independent from a specific relaxator;
6525 at the moment, it contains information about the relaxation solution stored in the variables: objective value and
6527- SCIP may now be manually restarted
6528- SCIPsolveKnapsackExactly() got a new 12. parameter `SCIP_Bool* success` which stores if an error occured during
6529 solving(normally a memory problem)
6530- SCIP can now handle problems with continuous variables w.r.t. to counting (the projection to the integral variables
6532- an XML-parser is available in the src/xml subdirectory
6533- We do not distinguish between block memory for the original and the transformed problem anymore. The same
6534 block memory is now used in both problem stages.
6535- added new sorting method SCIPsortLongPtr(), SCIPsortDownLongPtr() and all corresponding methods
6536- added new sorting method SCIPsortRealIntPtr(), SCIPsortDownRealIntPtr() and all corresponding methods
6539 - SCIP can now copy instances (e.g. for heuristics)
6540 - new undercover heuristic for MINLPs: fixes variables such as to obtain a linear or convex subproblem and solves this
6541 - primal heuristics may now already be called before presolving, using the new timing point
6542 `SCIP_HEURTIMING_BEFOREPRESOL`. Note that solutions that are added before/during presolving, will be retransformed to
6544 - primal heuristics may now be called during presolving, using the new timing point `SCIP_HEURTIMING_DURINGPRESOLLOOP`
6545 - added heuristic zirounding (heur_zirounding.{c,h})
6546 - added heuristic twoopt (heur_twoopt.{c,h})
6547 - added new NLP heuristic (heur_subnlp.{c,h}) which solves the sub-NLP that is obtained by fixing all discrete variables
6548 in the CIP and applying SCIP's presolving
6549 - feasibility pump heuristic now implements all functionality for feasibility pump 2.0
6552 - can now read XML-solution files as used by CPLEX
6553 - the MPS reader can now read MIQPs and MIQCPs where a quadratic objective function can be specified by a QMATRIX or
6554 QUADOBJ section and the quadratic part of a quadratic constraint by a QCMATRIX
6555 - the MPS reader can now write quadratic and SOC constraints
6556 - the GAMS reader can now write SOC constraints
6557 - added support for bool_gt, bool_lt, bool_ge, bool_le, bool_ne, bool_not, int_times, int_minus, int_plus, int_negate,
6558 float_times, float_minus, float_plus, float_negate constraints to flatzinc reader
6559 - the LP reader (.lp files) can now read MIQPs and MIQCPs and write quadratic and SOC constraints
6560 - the LP reader (.lp files) and MPS reader can now read semicontinuous variables, they are handled by creating bound
6561 disjunction constraints
6562 - added new reader for polynomial mixed-integer programs (reader_pip.{c,h}) as used in the POLIP
6564- Indicator constraints:
6565 - SCIP can now handle indicator constraints (reading (from LP, ZIMPL), writing, solving, ...) see \ref cons_indicator.h.
6566 - the indicator constraint can now decompose the problem, i.e., not add the linear constraint to the problem if all of
6567 its variables are continuous
6568 - can now read and write indicator constraints in the (extended) MPS format
6569 - cons_indicator tries to adapt solutions to get feasible during check
6570 - cons_indicator allows to store information on other linear constraints that might help to separate cuts
6572- Constraint handlers:
6573 - Solution counting extended to constraint integer programs, this also
6574 includes constraint integer programs which contain continuous variables
6575 - The solution behavior of SCIP can be diversified by randomly permuting constraints and variables or randomly
6576 determining a set of branching variables with a unique high priority
6577 - `negated cliques` (1<=i<=n : sum (x_i) >= n-1) were added and we are using them now inside the knapsack constraint
6578 handler, the cliquepartitioning which is returned by SCIPcalcCliquePartition() contains now integer != 0, negatives ones
6579 indicates a negated clique and positive ones indicates a normal clique
6580 - SCIP is now able to detect in DEBUG-mode whether a constraint or variables which will be added, was also created in
6581 the same scip instance, if not an error is thrown
6582 - cons_knapsack is now able to detect negated cliques due to negated cliques on knapsack constraints
6583 - SCIP is now able to write non-linear opb-files(linear instances with and-constraints)
6584 - New constraint handlers for linking constraints (only Beta), cumulative constraints, and for breaking orbitopal symmetries
6585 - `negated cliques` handling in knapsack constraint handler got changed due to the new method
6586 SCIPcalcNegatedCliquePartition() resulting in new consdata members `negcliquepartition`, `negcliquepartitioned` and
6587 `nnegcliques`; changed SCIPcalcCliquePartition() so all cliquepartitions (calculated by SCIPcalcCliquePartition() or
6588 SCIPcalcNegatedCliquePartition(), which uses the first one) contain again not negative integers
6589 - `and`, `knapsack`, `linear`, `logic`, `or`, `quadratic`, `setpp`, `varbound`, `xor` and `clique` constraint handlers
6590 can handle implicit binary variables
6591 - knapsack constraint handler is now able to pairwise presolving constraints
6592 - constraint handlers `logicor`, `and`, `or` can parse their output
6593 - constraint handler `or` can copy its constraints
6594 - added packing/partitioning orbitope constraint handler for symmetry handling (cons_orbitope.{c,h})
6595 - added constraint handler for second order cone constraints (cons_soc.(c|h))
6596 - added constraint handler cons_linking.{c,h} (see cons_linking.c for more details)
6597 - cons_quadratic can make solutions in CONSCHECK feasible for the quadratic constraints by moving values of linear
6598 variables and passing the modified solution to the trysol heuristic
6599 - constraint handler can now register their upgrade functions for quadratic constraints to cons_quadratic (similar to
6603 - New separators for oddcycle cuts and Chvatal-Gomory cuts using sub-MIPs
6604 - modified implementation of separation algorithms in cons_knapsack.c according to results of diploma thesis; including
6605 super-additive lifting (disabled)
6606 - uncommented decomposeProblem() in sepa_zerohalf.c (in default settings, not used anyway): was not adapted to the case
6607 that contiuous variables are allowed in a row
6608 - new separator rapid learning (sepa_rapidlearning.{c,h}) that produces conflicts, global bound changes, primal
6609 solutions and initializes inference values for branching
6610 - added Chvatal-Gomory cuts separated with a sub-MIP (sepa_cgmip.{c|h})
6611 - added reader for 'Weigted Boolean Optimization': problems (reader_wbo.{c,h}), this reader needs the reader_opb files
6612 - new separator oddcycle (sepa_oddcycle.{c,h}) separates oddcycle inequalities using the implication/conflict graph and
6613 dijkstra-algorithm based on binary heaps (dijkstra/dijkstra_bh.{c,h})
6616 - Branching on externally given candidates, the \ref BRANCH 'branching rules' have a second new callback method
6617 (see type_branch.h for more details): SCIP_DECL_BRANCHEXECEXT(x) can be used to branch on external branching candidates,
6618 which can be added by a user's `relaxation handler` or `constraint handler` plugin, calling SCIPaddExternBranchCand().
6619 - added branchcands for relaxator solution, that can be added by the relaxator and used by branching rules
6620 - added relaxsol to variables, s.t. a relaxator can store a solution on which branching or separation can be done
6621 - SCIP can now branch on relaxation solutions that are either installed to the relaxsol field of the variables or added
6622 to the list of relaxation candidates, e.g., by constraint handlers. Branching on relaxation solutions is performed if
6623 the enforcement resulted in an unresolved infeasibility and there are no LP branching candidates, but before pseudo
6624 solution branching. The branching rules leastinf, mostinf, random and pscost implement the callback for branching on
6625 relaxation candidates.
6626 - SCIP can branch on continuous variables. The branching value x' must not be one of the bounds. Two children (x <= x',
6627 x >= x') will be created.
6628 - the vbc visualization adds the branching type (lower or upper bound change) and the new bound to the node information
6629 - the vbc visualization adds the new bound of the branched variable to the node information
6632 - added statistic information about the first primal solution to SCIP statistic; in the statistic output a new line
6633 appears with this information
6634 - now the statistic displays the number of calls of the feasibility checking method of each constraint handler and the
6638 - New rounding and propagation heuristics
6639 - New propagator for variable bounds
6640 - primal heuristics may now be called directly after the node's propagation loop, using the new timing point
6641 `SCIP_HEURTIMING_AFTERPROPLOOP`
6642 - following methods SCIPinferVarUbProp(), SCIPinferVarLbProp(), SCIPinferVarLbCons(), SCIPinferVarUbCons() have a new 6th
6643 parameter `SCIP_Bool force` which allows bound tightening even if the difference to the newbound is below bound
6644 strengthening tolerance
6645 - added propagator for variable lower and upper bounds (prop_vbounds.{c,h}); adjusted cons_varbound.c, var.c, and,
6646 implics.c to work correctly with the new propagator
6649 + Improved constraint handler for quadratic constraints
6650 + New constraint handler for second order cone constraints
6651 + New MINLP heuristics (undercover, subnlp)
6652 + Preliminary support for non-linear relaxations (via expression trees)
6653 + Automatic branching on solutions from arbitrary relaxations and on continuous variables
6655Performance improvements
6656------------------------
6658- improved `settings/emphasis/cpsolver.set` to decrease time per node
6659- reworked access to pseudo solution and inference value of variables in order to reduce function calls
6660- changed default value of parameter `nodeselection/restartdfs/selectbestfreq` to 0; this means if the current node has
6661 no children the node with the best bound is selected (SCIPgetBestboundNode())
6662- added a dual reduction step in cons_knapsack.c
6663- fasten check for common cliques in SCIPcliquelistsHaveCommonClique
6664- SCIP with CPLEX as LP solver now uses quickstart steepest edge pricing as default instead of steepest edge pricing
6665- avoid unnecessary domain propagation and LP resolve at nodes with infeasible LP relaxation
6666- improved zerohalf cut separator: more than one delta is tested for MIR cuts, better handling of dense base
6667 inequalities, faster scaling of fractional coefficients in rows (now enabled), improved parameter settings (presolving)
6670 - in root node, first LP solution is checked for feasibility to avoid expensive setup
6671 - avoided restarting if LP solution is feasible
6672 - separators are not called any longer for an integral initial LP solution
6674Examples and applications
6675-------------------------
6677- New branch-and-price example which includes Ryan/Foster branching (binpacking example)
6678- New example illustrating the use of an event handler (`example/Eventhdlr`)
6683- Enhanced user interface for callable library: manual restarts, predefined settings and many other features
6684- Support of wbo format for weighted PBO problems, IBM's xml-solution format and pip format for polynomial mixed-integer programs
6685- Extended reader for Flatzinc models
6686- new API for 'expressions interpreter': code that evaluates expression trees, including first and second derivatives
6687- NLP solver interface (NLPI) now independent of SCIP like LPI
6688- SCIP can now maintain a central NLP relaxation of the problem (similar to LP)
6689- SCIP can now manage a list of external codes (e.g., LP or NLP solver, ZIMPL)
6690- lp.h/lp.c and the lpi's were changed according to the changes mentioned below.
6691- adding and deletion of rows to the separation storage and to the LP can now be catched by events
6692 (`SCIP_EVENTTYPE_ROWADDEDSEPA`, `SCIP_EVENTTYPE_ROWDELETEDSEPA`, `SCIP_EVENTTYPE_ROWADDEDLP`, `SCIP_EVENTTYPE_ROWDELETEDLP`)
6694### New and changed callbacks
6696- new callback SCIP_DECL_BRANCHEXECRELAX(), together with new parameter in SCIPincludeBranchrule() for branching on a
6699- Copying a SCIP instance:
6700 - Constraint handlers have two new callback methods. One for copying the constraint handler plugins
6701 SCIP_DECL_CONSHDLRCOPY() and the other for copying a constraint itself, SCIP_DECL_CONSCOPY().
6702 - All plugins, like \ref BRANCH `branching rules` and \ref HEUR `primal heuristics`, have a new callback method (see, e.g.,
6703 type_branch.h and type_heur.h for more details):
6704 - SCIP_DECL_BRANCHCOPY(x), SCIP_DECL_HEURCOPY(x) etc.
6705 - When copying a SCIP instance, these methods are called to copy the plugins.
6706 - The main problem has a new callback method (see type_prob.h for more details) SCIP_DECL_PROBCOPY(x) when copying a
6707 SCIP instance, this method is called to copy the problem's data.
6708 - Variables have a new callback method (see type_var.h for more details) SCIP_DECL_VARCOPY(x) when copying a SCIP
6709 instance, this method is called to copy the variables' data.
6712 - The callback SCIP_DECL_PROBEXITSOL(x) in the main problem has one new parameter (see type_prob.h for more details):
6713 - The parameter `restart` is `TRUE` if the callback method was triggered by a restart.
6715### Deleted and changed API methods
6717- All C++ objects and constructors have a SCIP pointer, now.
6718- added parameter scip to ObjCloneable::clone()
6719- changes in a row can now be catched via row events (SCIPcatchRowEvent(), SCIPdropRowEvent(),
6720 `SCIP_EVENTTYPE_ROWCOEFCHANGED`, `SCIP_EVENTTYPE_ROWCONSTCHANGED`, `SCIP_EVENTTYPE_ROWSIDECHANGED`)
6721- added new parameter `varcopy` to SCIPcreateVar() to add the function for copying variable data
6722- in case of using SCIPwriteTransProblem() the currently (locally) valid problem is written this now also includes the
6726 - The predefined setting files like `settings/cuts/off.set,aggressive.set,fast.set` have been replaced by
6727 interface methods like SCIPsetHeuristics(), SCIPsetPresolving(), SCIPsetSeparating(), and SCIPsetEmphasis() in
6728 \ref scip.h and by user dialogs in the interactive shell like
6729 `SCIP> set {heuristics|presolving|separating} emphasis {aggressive|fast|off}` or
6730 `SCIP> set emphasis {counter|cpsolver|easycip|feasibility|hardlp|optimality}`
6731 - All functions for setting user parameters of different types like SCIPparamSetBool(), SCIPparamSetChar(),
6732 SCIPparamSetInt(), SCIPparamSetLongint(), and SCIPparamSetString() in pub_paramset.h have a new parameter
6733 `quiet` it prevents any output during the assign to a new value.
6736 - NLPIs can now be used without generating a SCIP instance (i.e., do not require a SCIP pointer), code moved into src/nlpi
6737 - NLPIs can now be managed like other SCIP plugins, i.e., they can be included into the SCIP core and accessed by
6738 methods SCIPincludeNlpi(), SCIPfindNlpi(), SCIPgetNNlpis(), SCIPgetNlpis(), SCIPsetNlpiPriority()
6740- Intervalarithmetic:
6741 - method SCIPgetVarPseudocostCurrentRun() now returns the pseudocost value of one branching direction, scaled to a unit
6742 interval, old method now called SCIPgetVarPseudocostValCurrentRun()
6743 - renamed SCIPintervalScalarProductRealsIntervals()/SCIPintervalScalarProduct() by
6744 SCIPintervalScalprodScalars()/SCIPintervalScalprod() and redesigned them in intervalarith.c including new methods
6745 SCIPintervalScalprodScalarsInf/Sup()
6748 - The usage of strong branching changed. Now, SCIPstartStrongbranch() and SCIPendStrongbranch() must be
6749 called before and after strong branching, respectively.
6750 - The methods SCIPgetVarPseudocost() and SCIPgetVarPseudocostCurrentRun() in \ref scip.h now return the pseudocost value of
6751 one branching direction, scaled to a unit interval. The former versions of SCIPgetVarPseudocost() and
6752 SCIPgetVarPseudocostCurrentRun() are now called SCIPgetVarPseudocostVal() and SCIPgetVarPseudocostValCurrentRun(), respectively.
6753 - The methods SCIPgetVarConflictScore() and SCIPgetVarConflictScoreCurrentRun() in \ref scip.h are now called
6754 SCIPgetVarVSIDS() and SCIPgetVarVSIDSCurrentRun(), respectively.
6755 - The methods SCIPvarGetNInferences(), SCIPvarGetNInferencesCurrentRun(), SCIPvarGetNCutoffs(), and
6756 SCIPvarGetNCutoffsCurrentRun() are now called SCIPvarGetInferenceSum(), SCIPvarGetInferenceSumCurrentRun(),
6757 SCIPvarGetCutoffSum(), and SCIPvarGetCutoffSumCurrentRun(), respectively. Furthermore, they now return
6758 `SCIP_Real` instead of `SCIP_Longint` values.
6759 - The method SCIPgetVarStrongbranch() has been replaced by two methods SCIPgetVarStrongbranchFrac() and
6760 SCIPgetVarStrongbranchInt().
6762- Copying a SCIP instance:
6763 - Every new callback method resulted in a new parameter of the include function for the corresponding plugin,
6764 e.g., SCIPincludeBranchrule() has two new parameters `SCIP_DECL_BRANCHCOPY((*branchcopy))` and
6765 `SCIP_DECL_BRANCHEXECREL((*branchexecrel))`. In the same fashion, the new callbacks
6766 `SCIP_DECL_VARCOPY` and `SCIP_DECL_PROBCOPY` led to new parameters in SCIPcreateVar() and SCIPcreateProb() in
6767 scip.c, respectively.
6768 - W.r.t. to copy and the C++ wrapper classes there are two new classes. These are `ObjCloneable` and `ObjProbCloneable`.
6769 The constraint handlers and variables pricers are derived from `ObjProbCloneable` and all other plugin are derived from `ObjCloneable`.
6770 Both classes implement the function `iscloneable()` which return whether a plugin is clone able or not. Besides that each class has a
6771 function named `clone()` which differ in their signature. See objcloneable.h, objprobcloneable.h, and the TSP example for more details.
6772 - SCIPincludeHeur() and SCIPincludeSepa() in \ref scip.h, as well as scip::ObjSepa() and scip::ObjHeur(), have a new parameter:
6773 `usessubscip`: It can be used to inform SCIP that the heuristic/separator to be included uses a secondary SCIP instance.
6774 - The argument success in `SCIP_DECL_CONSCOPY` has been renamed to valid.
6777 - SCIPcutGenerationHeuristicCmir() in sepa_cmir.h has three new parameters:
6778 - `maxmksetcoefs`: If the mixed knapsack constraint obtained after aggregating LP rows contains more
6779 than `maxmksetcoefs` nonzero coefficients the generation of the c-MIR cut is aborted.
6780 - `delta`: It can be used to obtain the scaling factor which leads to the best c-MIR cut found within
6781 the cut generation heuristic. If a `NULL` pointer is passed, the corresponding c-MIR cut will already be
6782 added to SCIP by SCIPcutGenerationHeuristicCmir(). Otherwise, the user can generate the cut and add it to SCIP
6783 on demand afterwards.
6784 - `deltavalid`: In case, the user wants to know the best scaling factor, i.e., `delta` passed is not `NULL`,
6785 `deltavalid` will be `TRUE` if the stored scaling factor `delta` will lead to a violated c-MIR cut.
6787### New API functions
6789- added SCIPcalcNegatedCliquePartition() to scip.c to calculate a clique partition on negations of all given binary
6791- SCIPpermuteArray() that randomly shuffles an array using the Fisher-Yates algorithm
6792- SCIPgetRandomSubset() that draws a random subset of disjoint elements from a given set of disjoint elements
6794- SCIPlpiGetSolverDesc() to get a descriptive string of an LP solver (developer, webpage, ...)
6795- SCIPholelistGetNext() to get the next hole of the hole list
6796- SCIPlpRecalculateObjSqrNorm() which is used when the old calculated square norm was unreliable
6797- SCIPpricerIsDelayed() which returns if the pricer is delayed (see pub_pricer.h)
6800 - SCIPvarIsBinary() which checks if a variable is (implicit) binary (see var.c for more details)
6801 - SCIPvarGetHolelistOriginal(), SCIPvarGetHolelistGlobal(), SCIPvarGetHolelistLocal() to get the original, global and local holes, respectively
6802 - SCIPvarGetProbvarHole() to tranform a given domain hole to the corresponding active, fixed, or multi-aggregated variable
6805 - allow user to trigger a restart during presolving SCIPrestartSolve()
6806 - SCIPrestartSolve() that allows the user to manually restart the solving process
6807 - SCIPisInRestart() to detect whether we are currently restarting
6810 - for heuristics SCIPheurSetFreq() to change the frequency of the heuristic (pub_heur.h, heur.c)
6811 - SCIPsepaUsesSubscip(), SCIPheurUsesSubscip()
6813- Intervalarithmetic:
6814 - SCIPeventGetHoleLeft() and SCIPeventGetHoleRight() for accessing the left right interval bound of a domain hole added or removed event
6815 - SCIPholelistGetLeft() and SCIPholelistGetRight()to get the left and right interval bounds of the open hole interval
6816 - SCIPintervalAddInf/Sup/Vectors(), SCIPintervalMulInf/Sup() in intervalarith.c
6819 - added SCIPsortPtrPtrLongIntInt(), SCIPsortLongPtrPtrIntInt() and corresponding sorting/inserting/deleting methods in
6820 pub_misc.h and necessary defines in misc.c
6821 - added SCIPsortLongPtrInt() and corresponding sorting/inserting/deleting methods in pub_misc.h and necessary defines in misc.c
6822 - added SCIPsortPtrPtrInt() (and various other) and corresponding sorting/inserting/deleting methods in pub_misc.h and
6823 necessary defines in misc.c
6824 - SCIPsortPtrBool() and corresponding sorting/inserting/deleting methods in pub_misc.h and necessary defines in misc.c
6826- Constraint Handlers:
6827 - SCIPconshdlrGetEnfoConss(), SCIPconshdlrGetNEnfoConss()
6828 - can now forbid upgrading of individual linear constraints (SCIPmarkDoNotUpgradeConsLinear())
6829 - SCIPpermuteProb() that randomly permutes constraints and variables
6830 - SCIPgetResultantOr() which returns the resultant of an `or` constraint
6831 - SCIPmarkDoNotUpgradeConsLinear() in cons_linear.?, which allows to forbid upgrading of linear constraints
6832 - SCIPgetNUpgrConss() which returns the number of upgraded constraints
6833 - SCIPconshdlrGetCheckTime() and SCIPconshdlrGetNCheckCalls() which returns the running time in the feasibility checking of the
6834 corresponding constraint handler respectively the number of calls of the checking method (implemented in cons.c)
6837 - SCIPcopy() to clone a SCIP instance
6838 - SCIPcopyPlugins(), SCIPcopyParamSettings(), SCIPcopyVars(), SCIPcopyConss(), SCIPgetVarCopy() to copy
6839 individual parts of a SCIP instance separately.
6840 - SCIPcopyProbData() and SCIPprobCopyProbData() which copies the probdata from a sourcescip to a targetscip
6843 - two new functions SCIPgetVarsStrongbranchesFrac()/SCIPgetVarsStrongbranchesInt() for computing strong branching
6844 information for several variables
6845 - SCIPbranchruleGetNRelaxCalls() to get the total number of times, a particular branching rule was called on a relaxation solutions
6846 - SCIPbranchRelax() to branch on a relaxation solution
6847 - SCIPbranchVarVal() to branch on an arbitrary value within the variable's bounds
6848 - SCIPbranchGetBranchingPoint() and SCIPgetBranchingPoint() to select branching point for a variable, e.g.,
6849 ensure branching point is inside the interval for a continuous variable
6850 - SCIPexecRelpscostBranching() in branch_relpscost.{c,h}; this method allows of calling the reliability
6851 pseudo cost branching algorithm for given set of branching candidates from the outside
6852 - SCIPinitVarBranchStats() to initialize the branching statistics (such as pseudo costs, VSIDS, inference values) of a variable
6853 - SCIPselectBranchVarPscost() in branch_pscost.{c,h}; this method selects from a given candidate array a
6854 branching variable w.r.t. pseudo cost branching for relax candidates
6856- Reading, Writing and Parsing:
6857 - SCIPparseVarName() which parses a string in cip-format as a variable name
6858 - SCIPparseVarList() which parses a string as a variable list in cip-format
6859 - the Flatzinc reader can now handle the output annotations of the Flatzinc format; the method SCIPprintSolReaderFzn()
6860 outputs the given solution in Flatzinc format w.r.t. the output annotations
6861 - SCIPprintSolReaderFzn() which prints the best solution in Flatzinc format w.r.t. to the output annotations
6862 in the input file of the flatzinc model
6863 - SCIPwriteVarName() which writes a variable in cip-format to given stream
6864 - SCIPwriteVarsList() which writes an array of variables in cip-Format to given stream
6865 - SCIPwriteVarsLinearsum() which writes an array of variables and coefficients as linear sum in cip-Format to given stream
6867- Copying a SCIP instance:
6868 - SCIPapplyRens() in \ref heur_rens.h has a new parameter `uselprows`. It can be used to switch from LP rows
6869 to SCIP constraints as basis of the sub-SCIP constructed in the RENS heuristic.
6872 - SCIPsetParamsCountsols() which sets the parameter for a valid counting process
6873 - SCIPsetEmphasis() which sets parameter to detect feasibility fast, handle hard LP, solves easy CIPs fast, behaves like a
6874 CP solver, set parameter for a valid counting process; the desired behavior is triggered via a parameter of the function
6875 - SCIPresetParam() to reset the value of a single parameter to its default value
6878 - added SCIPsortRealRealRealPtr() and corresponding sorting/inserting/deleting methods in pub_misc.h and necessary defines in misc.c
6879 as basis for the subSCIP, setting ist to TRUE (uses LP rows) will lead to same version as before
6880 - SCIPsetHeuristics(), SCIPsetSeparating(), SCIPsetPresolving() which set the heuristics to aggressive, fast, off, or
6881 default settings, depending on the `SCIP_PARAMSET` parameter
6882 - SCIPsetSubscipsOff() which disables all plugins that uses subscips
6883 - SCIPsepaSetFreq() to set the calling frequency of a separator
6885### Command line interface
6887- added new dialog for setting the SCIP parameters for hardlp, optimality, easy CIP, CP like search
6888- added new dialog for setting the SCIP parameters for feasibility problems `SCIP> set emphasis feasibility`
6889- added new dialog for setting the SCIP parameters for counting `SCIP> set emphasis counting`
6890- added new dialog for setting presolving to aggressive, fast, or off in interactive shell
6891- added new dialog for setting separation to aggressive, fast, or off in interactive shell
6892- added new dialog for writing all solutions which are collected during the counting process (see cons_countsols.{c,h})
6893- added new dialog for setting heuristics to aggressive, fast, or off in interactive shell
6894- added new dialog `display pricers` which displays all included pricers
6896### Interfaces to external software
6898- added interface to CppAD (nlpi/exprinterpret_cppad.cpp)
6899- Improved Xpress, CPLEX, SoPlex interfaces
6900- the SoPlex interface now includes equilibrium scaling on lp's solved from scratch without starting basis
6901- the SoPlex interface can now double check each SoPlex result against CPLEX (lpi_spx.cpp)
6902- the SoPlex interface has the option to restore basis only after entire strong branching phase instead of after each
6903 strong branch (off, because it mostly appears to increase strong branching time and iterations) (lpi_spx.cpp)
6905### Changed parameters
6907- removed parameter `constraints/knapsack/maxnumcardlift` and adapted setting files
6908- changed parameter `lp/fastmip` from boolean to integer, possible values are 0 (off), 1 (medium, default), 2 (full,
6909 must not be used with branch-and-price).
6913- `branching/clamp` to set the minimal fractional distance of a branching point to a continuous variable' bounds
6914- `branching/random/seed` to change the initial seed value of the branching rule random
6915- `constraints/indicator/addCouplingCons` that allows to add variable upper bounds if addCoupling is true
6916- `constraints/indicator/enforceCuts` that allows to check for violated cust in enforcement
6917- `constraints/indicator/maxCouplingValue` for the maximal value of the coefficient in a coupling inequality/constraint
6918- `constraints/indicator/noLinconsCon` which controls whether the linear constraint is not explicitly
6919 added to the problem. default is FALSE
6920- `constraints/knapsack/dualpresolving` to switch dualpresolving on/off inside the knapsack constraint handler, default is TRUE
6921- `constraints/knapsack/presolpairwise` that allows pairwise presolving of knapsack constraints, default is TRUE
6922- `constraints/knapsack/presolusehashing` that allows fast pairwise presolving of knapsack constraints, default is TRUE
6923- `heuristics/crossover/dontwaitatroot` that allows to call crossover at root node independently from nwaitingnodes
6924- `heuristics/rens/uselprows` that allows to switch between LP row and SCIP constraints as basis for the
6925 subSCIP, default is TRUE (uses LP rows)
6926- `lp/rowrepswitch` telling simplex solver to switch to row representation of the basis (if possible),
6927 if number of rows divided by number of columns exceeds this value (default value infinity, i.e. never switch)
6928- `lp/threads` to change the number of threads used to solve the LP relaxation (default is 0: automatic)
6929- `misc/lexdualstalling` that turns on the lex dual algorithm if the separation process is stalling
6930- `misc/usevartable` and `misc/useconstable` which turns on/off the usage of hashtables mapping from
6931 variable/constraint names to the variables/constraints; when turned off, SCIPfindVar() and SCIPfindCons() may not be
6932 used; the hashtables can be turned off for subMIPs to improve the performance, default value TRUE
6933- `misc/usesmalltables` which results in using smaller tables for names, cliques and cuts and improves
6934 the performace for smaller instances, default value FALSE
6935- `misc/permutationseed` to change the permutation seed value for permuting the problem after the
6936 problem is transformed (-1 means no permutation)
6937- `reading/zplreader/usestartsol` which allows to switch ZIMPL start solutions off, default value TRUE
6938- `vbc/dispsols` to propose if the nodes where solutions are found should be visualized in the branch and bound tree
6942- implemented the data structure and events for global and local domain holes added and removed
6943- new data structures and methods to handle nonlinear expressions in NLPI ({type_, struct_, pub_}expression.{h,c}):
6944 nlpioracle can store and evaluate general NLPs now, nlpi_ipopt can solve general NLPs now
6949- minor changes on several evaluation scripts (new statuses: better, solved, sollimit, gaplimit) and short-mode for cmpres.awk
6950- support for FreeBSD (32- and 64-bit) including minor changes in several scripts in the check-directory
6957- added scripts check_*.sh, evalcheck_*.sh and check_*.awk for blis, glkp, gurobi and symphony (including targets in
6958 Makefile) and slightly modified scripts for cplex, cbc and mosek and cmpres-script
6959- added target `lintfiles` which allows to call flexelint with a list of file, for example, make lintfiles
6960 `FILES=src/scip/prop_vbounds.c`
6961- the NLP solver interfaces and expression interpreter are located in a separate library (libnlpi.*; similar to the lpi
6962 library) and is required to link against the SCIP library also projects that use SCIP via `make/make.project` need to
6963 change their Makefile (!!!): in the $(MAINFILE) target, add $(NLPILIBFILE) behind $(LPILIBFILE) in the dependencies
6964 and add $(LINKCXX_l)$(NLPILIB)$(LINKLIBSUFFIX) to the linker flags
6965- The additional NLPI library requires a change in the Makefile of SCIP's project:
6966 The $(MAINFILE) target now has $(NLPILIBFILE) as additional dependency and the linking
6967 command requires $(LINKCXX_l)$(NLPILIB)$(LINKLIBSUFFIX) as additional argument.
6968- A bug in the Makefiles of older versions of the SCIP examples may cause
6969 data loss. If you have a custom Makefile, please ensure that the target
6970 `clean` is changed as described here:
6971 http://scipopt.org/download/bugfixes/scip-1.2.0/make.txt.
6976- fixed bug in conflict.c in the method conflictsetAddBound()
6977- fixed `bug` in projects Makefiles w.r.t. `make clean`
6978- fixed bug in rapid learning with wrong ordering of dual and primal bound update, primal bound is now updated inside
6980- fixed potential bug in rapid learning with dual reductions
6981- fixed potential bug where SCIPselectSimpleValue() returns a value slightly outside of the given bounds due to rounding
6982 errors (probably cancelation in subtraction in SCIPfindSimpleRational), now use rounding control and check result
6983- fixed bug that SCIP could not be continued after it has been stopped due to a limit
6984- fixed bug in var.c: SCIPvarChgLbOriginal() and SCIPvarChgUbOriginal() cannot access original bounds if the variable is
6986- fixed potential bug with pseudo solution branching on free variables
6987- fixed bug with multiaggregations whose infimum and supremum are both infinite: in such a case multiaggregation is now
6989- fixed numerical issue with multiaggregations which are infinite in one direction: value of multiaggregated variable
6990 could have been larger then inifinity
6991- fixed bug w.r.t. of adding a variable bound variable to its self
6992- fixed bug concering the incorrect assumption that every solution computed in SCIPlpGetUnboundedSol() is integral (we
6993 will not branch but return `infeasible or unbounded` like in presolving)
6994- fixed bug while breaking an clique down to their impications (in SCIPcliquetableCleanup() in implics.c) where the
6995 variable was not of vartype `SCIP_VARTYPE_BINARY`, instead of adding an implication we add a variable bound
6996- fixed bug with debugging a solution: during restarts erroneously it was claimed that the primal solution is cut off
6999 - fixed bug w.r.t. ObjDialog and displaying the description of the dialog
7000 - fixed bug when aborting pricing with Ctrl-C
7003 - fixed bug in scip.c w.r.t. to call of conflict analysis for LPs which reached the objective limit in case of diving
7004 - fixed bug with resolving LPs at infeasible root node
7005 - fixed bug in lp.c: in sumMIRRow() rowtoolong was not set correctly
7006 - fixed bug in lp.c w.r.t. objective limit reached and the chosen comparison (fixed buglist entry 40)
7007 - fixed bug in lp.c: if in SCIPlpSolveAndEval() the LP has to be solved from scratch due to numerical troubles, reset
7008 `SCIP_LPPARAM_FROMSCRATCH` to `FALSE` afterwards
7009 - fixed bug in lp.c SCIProwGetObjParallelism() due to a wrong parallelism value which arised from cancellations during
7010 calculation of squared euclidean norm of objective function vector of column variables
7011 - fixed bug in lp.c: SCIPlpGetUnboundedSol() did not ensure that unbounded solution lies withing the bounds of the
7013 - fixed bug in lp.c w.r.t. to the number of `active` pricer
7016 - fixed bug in solve.c where relaxation branching candidates were cleared, but the relaxation was still marked solved
7017 and not called again, furthermore, adjusted criterions for solving a relaxation again
7018 - fixed bugs in solve.c: even with LP solving disabled, the root LP was solved in case continous variables are
7019 contained; setting pricing/maxvars(root) to 1 resulted in not calling the pricers
7020 - fixed bug in solve.c: make sure SCIP terminates correctly also when a user interrupt or gap limit is reached, i.e.,
7021 avoid error `pricing was aborted, but no branching could be created!`
7024 - fixed bug in tree.c: if an explicit branching point is given, we may not recompute a better centering point
7025 - fixed bug in tree.c: propagate implications on multi-aggregated should not be performed
7028 - corrected several asserts in linear and quadratic constraint handler concerning parsing of CIP format
7029 - fixed bug while deleting redundant variables, which have no influence on changing the feasibility of the linear
7030 constraints, we need to update the sides of the constraint at each step, bug number 51 in bugzilla
7031 - fixed bug in copy procedure of AND constraint handler, negated variables have been copied to their originals
7032 - fixed bug when deleting a constraint where the update was delayed and not processed yet (in cons.c)
7033 - fixed bug in cons_linear.c: binary variables should not be multi-aggregated
7034 - fixed bug in cons_quadratic.c: curvature of bivariate quadratic constraints was not detected correctly
7035 - fixed bug in cons_sos2.c: the branching position was sometimes mistakenly increased
7036 - fixed bug in propagation of cons_sos2.c: the node can be cut off at more places: the previous version was not
7037 sucessfull in this respect
7038 - fixed bug in cons_linear.c:applyFixings() which could lead to lhs/rhs smaller/larger than -/+infinity
7039 - fixed bug in cons_linear.c in detectRedundantConstraints() and corrected old bug fix in SCIProwCreate(): we want lhs
7040 <= rhs to be satisfied without numerical tolerances in order to avoid numerical problems in the LP solver
7042- Knapsack Constraint Handler:
7043 - fixed bug in cons_knapsack.c: mergeMultiples() now detects whether a node can be cut off
7044 - fixed bug in cons_knapsack.c w.r.t. to items with zero weight
7045 - fixed bug in cons_knapsack.c: In SCIPseparateRelaxedKnapsack() not all variables need to be active in deeper regions
7047 - fixed bug in cons_knapsack.c and sepa_clique.c: the assumption that implications are always nonredundant and contain
7048 only active variables is not correct anymore as the corresponing vbound might be missing because of numerics
7050- Separation and Cuts:
7051 - fixed bug in cutpool.c: the hashkey computation was not constant over time
7052 - fixed bug in cutpool.c: hashkey of a row changed during the solving process (if a row is made integral after creation,
7053 maxabsval can be invalid when adding it to the pool, but might be recomputed later on)
7054 - fixed bug in sepa_rapidlearning.c, stop processing if there are no binary variables left
7055 - fixed bug in sepa_rapidlearning.c, corrected computation of right dualbound
7056 - fixed bugs in sepa_zerohalf.c, e.g., handling of intscaling and substitution of variable bounds
7057 - fixed bug in sepastore.c in sepastoreApplyLb/Ub being to hard on feasibility decisions
7058 - fixed bug in sepa_flowcover.c: numerical issues while computing candidate set for lambda
7061 - fixed bug in SoPlex autopricing due to which autopricing had behaved like steepest edge pricing so far
7062 - fixed bug in lpi_clp.cpp: SCIPlpiChgBounds() checks if the column status exists in Clp before using it
7063 - fixed wrong assert in Cplex LPI: Due to numerical inaccuracies, a few pivots might be performed after refactorization
7064 - fixed bug concerning assert(!SCIPlpDivingObjChanged(lp)) which was caused by wrong infinity double parameters for
7066 - fixed makefile system for `OSTYPE=darwin` w.r.t. to CPLEX as LP solver
7069 - fixed bug in cons_setppc: aggregated variables were not correctly removed in presolving
7070 - fixed bug in presolving of linear constraint handler: in redundancy detection, two different numerical epsilons were used
7071 - fixed bug in presolving while not applying a bound change on a variable in a single-variable constraint (e.g. x1 =
7072 0.03) in cons_linear which is too small, that lead to another bound change in presol_trivial which is not allowed, so
7073 now this bound change will be forced
7074 - fixed SCIPvarIsTransformedOrigvar() in var.c (variables generated by presol_inttobinary returned false)
7075 - fixed bug w.r.t. an assert in presol_inttobinary.c; it was assumed that the aggregation which is performed there will
7076 never lead to an infeasibility, this is not true, see comment in presol_inttobinary.c
7077 - fixed bug in presol_trivial.c trying to fix continuous variables, now uses a less stricter comparison to fix variables
7078 - fixed bug in cons_bounddisjunction.c: presolve may have tried to tighten bounds on a multiaggregated variable (now
7079 upgrades to linear constraint)
7081- Reading, Writing and Messages:
7082 - fixed bug while trying to write a MIP where SCIP needs to flush the lp changes first
7083 - fixed potential resource leak when running out of memory while writing files
7084 - fixed bug in reader_zpl.c which appeared using the parameter `reading/zplreader/parameters`
7085 - fixed bugs in flatzinc readers with constraints that exclusively consist of constants
7086 - fixed bug in reader_gms: correct handling of nonstandard bounds on general integer variables
7087 - fixed buglist entry 35, which was caused by a wrong read in correction when the reading buffer was full in
7089 - fixed bugs in reader_fzn.c w.r.t. parsing and solution output in Flatzinc format
7090 - fixed bug in reader_fzn.c w.r.t. comment lines
7091 - fixed bug in reader_opb.c w.r.t. comment lines
7092 - fixed bug in message handler w.r.t. to messages which are longer then `SCIP_MAXSTRLEN`
7095 - fixed bugs do to `HEUR_TIMING SCIP_HEURTIMING_AFTERPROPLOOP` which appeared during repropagation
7096 - fixed bug in trivial heuristic: the locking solution might have falsely initialized some values to zero
7097 - fixed bug in heur_oneopt.c w.r.t. to SCIPtrySol(); it is necessary that the bound of the solution is check otherwise,
7098 infeasible solution could be accepted as feasible
7099 - fixed bug in heur_trivial.c w.r.t. to debug messages after a solution was freed
7100 - fixed bug for `HEUR_TIMING SCIP_HEURTIMING_BEFOREPRESOL` and modifiable constraints
7101 - corrected wrong assert in DINS heuristic when called for an empty problem
7102 - fixed potential bug in OCTANE heuristic with nonbasic solutions
7103 - fixed bug in sub-MIP heuristics with parameter change if some default plugins are not included
7104 - fixed bug in trivial heuristic with bounds that are greater than the heuristic's infinity value
7109- As the interface contains several additional callback functions and
7110 parameters for plugins, some effort may be required to compile your
7111 own projects with SCIP 2.0. See also `Changes between version 1.2 and 2.0` in the doxygen
7112 documentation for additional information.
7114@page RN12 Release notes for SCIP 1.2
7116@section RN120 SCIP 1.2.0
7117*************************
7122- adjusted hard memory limit to (soft memory limit)*1.1 + 100mb in check.sh, checkcount.sh, check_cplex.sh,
7123 check_cluster.sh and check_cbc.sh
7124- new presolving step in cons_knapsack.c, same like `simplifyinequalities` in cons_linear.c
7125- now it's possible to write strings with more than `SCIP_MAXSTRLEN` amount of characters in all message.c functions
7126- the current/root lp can be marked to be no relaxation of the current/root problem
7127- added new preprocessing step (mergeMultiples) in cons_setppc.c where equal variables are merged
7128- Black-box lexicographic dual simplex algorithm; can now run lexicographical dual algorithm (parameter `lp/lexdualalgo`)
7131 - SCIP now has `lazy bounds`, which are useful for column generation: see @ref PRICER_REMARKS `pricer remarks` for an explanation.
7132 Each variable has now two additional `SCIP_Real` parameter which define a lazy lower and upper bound; lazy means that
7133 there exists constraints which implies these (lazy) bounds. If the lazy lower or upper bound is greater or less than
7134 the local lower or upper bound, respectively, then the corresponding bound is not put into the LP. The bounds are set
7135 to minus and plus infinity per default which yields the same behavior as before. With the methods SCIPchgVarLbLazy()
7136 and SCIPchgVarUbLazy() these bounds can be set. This is of interest if SCIP gets used as a branch-and-price
7137 framework. Attention! The lazy bounds need to be valid for each feasible LP solution. If the objective function
7138 implies bounds on the variables for each optimal LP solution, but these bounds may be violated for arbitrary LP
7139 solutions, these bounds must not be declared lazy!
7140 - interval arithmetic functions can work with unbounded intervals added new functions to allow more operations on
7141 intervals, including solving quadratic interval equations
7144 - extended hybrid relpscost branching rule by usage of the average length of conflicts a variable appears in
7145 - `early branching`-functionality added: in a branch-and-price code, the user can stop pricing at a node although there
7146 may exist variables with negative reduced costs. In this case, the lp-lowerbound will not be used. The pricer has,
7147 however, the option to return a lower bound. This can be useful for column generation.
7150 - Copy constructors and i/o functionality for constraints: all linear type constraint handlers are able to copy
7151 constraints using the function SCIPgetConsCopy() in scip.h
7152 - the linear constraint handler is able to parse a string in CIP format and create a corresponding linear constraint
7153 - Constraint handler for indicator constraints and parsing them from *.lp and *.zpl files
7154 - the indicator constraint can now try to produce a feasible solution (via heur_trysol)
7155 - one can now write indicator constraints in LP-format
7156 - added constraint handler for quadratic constraints
7159 - added new version of zerohalf cuts from Manuel Kutschka
7160 - added multi-commodity-flow cut separator
7163 - Heuristics which are applied before root LP
7164 - added heuristic that performs a local search in an NLP (takes only linear and quadratic constraints into account so far)
7165 - added heuristic that gets a solution from other components and tries it (heur_trysol.?)
7166 - new trivial heuristic: tries zero solution, lower and upper bound solution and some variable lock based fixing
7167 - added new timing point, `SCIP_HEURTIMING_DURINGPRICINGLOOP`, for calling heuristics; If this timing point is used the
7168 corresponding heuristics is called during the pricing loop of variables; we also added this timing point to
7169 heur_simplerounding.{h,c} which has the effect that a LP solution which satisfies all integrality conditions during
7170 the pricing loop is detected
7173 - added first version of an interface to NLP solvers (type_nlpi.h, struct_nlpi.h, nlpi.h, nlpi.c, nlpi_oracle.h, nlpi_oracle.c)
7174 - Preliminary support of non-convex MIQCPs: Constraint handler for quadratic constraints, NLP heuristic and
7175 Ipopt interface, see \ref cons_quadratic.h.
7176 - There are LP-interfaces to QSopt and Gurobi (rudimentary).
7179 - added reader and writer for FlatZinc models (reader_fzn.{c,h})
7180 - added writer for GAMS models (reader_gms.{c,h})
7182Performance improvements
7183------------------------
7185- Enhanced MCF cuts: stable version, used by default
7186- replaced some function calls in loop conditions
7187- in sepa_cmir.c, if mksetcoefs is invalid for delta=1 no other values of delta are tested anymore
7188- changed the timing of the feasibility pump in case of pricing
7189- removed changing of update rule to `ETA` from standard soplex update `Forrest-Tomlin` in lpi_spx.cpp
7190- improved memory usage in heur_octane.c
7191- improved reading time of opb-files, due to using a hashtable for all `and`-constraints
7192- improved performance of merging variables in mergeMultiples() in cons_knapsack.c
7193- improved performance in tightenWeightsLift() and SCIPseparateRelaxedKnapsack() in cons_knapsack.c, due to now
7194 sparse-cleaning `global` arrays instead of using BMSclearMemory... functions for cleaning local arrays each time
7195- improved performance in SCIPcliquelistRemoveFromCliques()
7196- improved performance in SCIPcalcCliquePartition()
7197- improved performance in SCIPvarGetActiveRepresentatives() in var.c
7200 - improved pairwise presolving in cons_and.c due to using a hashtable
7201 - improved pairwise presolving in cons_xor.c due to using a hashtable
7206- A significant change for C++ users is that all include files of SCIP
7207 automatically detect C++ mode, i.e., no `extern `C`` is needed anymore.
7208- Reader for Flatzinc and GAMS models
7210### New and changed callbacks
7212- The callback SCIP_DECL_PRICERREDCOST(x) in the \ref PRICER `pricers` has two new parameters:
7213 + A `result` pointer determines whether the pricer guarantees that there exist no more variables. This allows for early branching.
7214 + A pointer for providing a lower bound.
7216- The \ref CONS `constraint handlers` have two new callback methods (see type_cons.h for more details):
7217 + SCIP_DECL_CONSCOPY(x): this method can be used to copy a constraint.
7218 + SCIP_DECL_CONSPARSE(x): this method can be used to parse a constraint in CIP format.
7220### Deleted and changed API methods
7222- SCIPcalcMIR() in scip.h has two new parameter `mksetcoefsvalid` and `sol`. The parameter `mksetcoefsvalid` stores
7223 whether the coefficients of the mixed knapsack set (`mksetcoefs`) computed in SCIPlpCalcMIR() are valid. If the mixed
7224 knapsack constraint obtained after aggregating LP rows is empty or contains too many nonzero elements the generation of the
7225 c-MIR cut is aborted in SCIPlpCalcMIR() and `mksetcoefs` is not valid. The input parameter `sol` can be used to separate a
7226 solution different from the LP solution.
7227- new parameter `set` in SCIPconsSetInitial().
7228- some interval arithmetic method take an additional argument to denote which value stands for infinity in an interval
7231 - SCIPgetVarClosestVlb() and SCIPgetVarClosestVub() in scip.h have a new parameter `sol`. It can be used to obtain the closest
7232 variable bound w.r.t. a solution different from the LP solution.
7233 - new parameters `lowerbound` and `result` in type_pricer.h: lowerbound can save a lower bound computed by the pricer,
7234 result indicates whether the pricer guarantees that there exist no more variables if no variable was found
7236### New API functions
7238- new methods to deactivate a pricer SCIPdeactivatePricer() in scip.c
7239- new methods in pub_misc.h/misc.c to access hash map lists and elements of a hash map list and to clear all entries in a hash map
7240- SCIPsetProbName() to set problem name in scip.h/c (SCIPprobSetName() in prob.h/c)
7243 - SCIPgetTransObjscale() and SCIPgetTransObjoffset() in scip.c
7244 - SCIPaddObjoffset() in scip.h; sets offset of objective function
7245 - SCIPgetOrigObjoffset() in scip.h; returns the objective offset of the original problem
7246 - SCIPgetOrigObjscale() in scip.h; returns the objective scale of the original problem
7249 - detectRedundantConstraints() in cons_xor.c and necessary hash-functions for fast pairwise presolving
7250 - SCIPparseCons() in scip.h; parses constraint information (in cip format) out of a string
7251 - SCIPgetConsCopy() in scip.h; which copies a constraint of the source SCIP
7254 - SCIPisLPRelax() and SCIPisRootLPRelax() in scip.c and scip.h returning whether the current/root LP is a
7255 relaxation of the current/root problem and thus defines a valid lower bound
7256 - SCIPlpSetIsRelax() and SCIPlpSetRootLPIsRelax() in lp.c and lp.h to set the information, whether the lp is a valid relaxation;
7257 this information is per default set to true and constraint be used. The aggregated version has only 2 linear constraints the
7258 default linearization has nvars + 1
7261 - extended the sort template functions in sorttpl.c with a `five` array; now it possible to used this template to sort
7263 - new interface methods SCIPcolSort(), SCIProwSort(), SCIPcolGetIndex()
7264 - added SCIPsortPtrPtrLongInt() and corresponding sorting/inserting/deleting methods in pub_misc.h and necessary defines
7268 - SCIPprintNodeRootPath() in scip.h This method prints all branching decisions on variables from the root to the given node
7269 - SCIPnodeGetParentBranchings(), SCIPnodeGetAncestorBranchings(), SCIPnodeGetAncestorBranchingPath(); These methods return
7270 the set of variable branchings that were performed in the parent node / all ancestor nodes to create a given node
7271 - SCIPchgVarLbLazy() and SCIPchgVarUbLazy() in scip.h; These methods can be used to change the lazy lower or
7272 upper bound of a variable; This might has the consequences that the bounds of the corresponding variable is not in
7273 LP. This is the case if the lazy lower or upper bound is greater or less than the local lower or upper bound, respectively
7274 - SCIPvarGetLbLazy() and SCIPvarGetUbLazy() in pub_var.h; These methods return the lazy lower or upper bound, respectively
7275 - SCIPvarCompareActiveAndNegated() and SCIPvarCompActiveAndNegated() in pub_var.h for comparing variables
7276 negated, active or fixed the same way
7277 - SCIPparseVars() in scip.h; parses variable information (in cip format) out of a string
7278 - SCIPgetNFixedonesSetppc() and SCIPgetNFixedzerosSetppc() in cons_setppc.{h,c}; these methods returns
7279 current (local) number of variables fixed to one/zero in the given setppc constraint
7280 - SCIPgetVarConflictlengthScore(), SCIPgetVarAvgConflictlength(), SCIPgetAvgConflictlengthScore() and their pendants for the current run
7281 - added function SCIPvarsGetProbvarBinary() in pub_var.h; gets active, fixed, or multi-aggregated problem variables of
7282 binary variables and corresponding negated status
7284### Interfaces to external software
7287 - heavily revised Mosek interface
7288 - new interface to QSopt due to Daniel Espinoza
7289 - First version of LP interfaces to Gurobi and QSopt
7290 - Major performance improvements in LP interfaces to Clp, Mosek and SoPlex
7293 - adjusted interface to ZIMPL (reader_zpl.{c,h} for ZIMPL version 2.10; this interface should also work with older ZIMPL versions
7294 - Adjusted interface to Zimpl version 3.0.0
7295 - added first version of an interface to Ipopt (only QCP, no deletion of vars/cons allowed; nlpi_ipopt.(h|c))
7298 - On http://code.google.com/p/python-zibopt/source/checkout you find a beta
7299 version of a python interface to SCIP implemented by Ryan J. O'Neil.
7301### Changed parameters
7303- removed parameter `constraints/and/initiallp` since it is not needed anymore;
7304- set parameter `constraints/and/sepafreq` default value to 1
7305- display character of oneopt heuristic changed to `b`
7309- `branching/relpscost/advanced/conflenscore`, default value 0.001
7310- `constraints/and/aggrlinearization` in cons_and.c, aggregated version of the linearization
7311- `constraints/and/enforcecuts` in cons_and.c, should cuts be separated during LP enforcing?
7312- `constraints/and/presolusehashing` in cons_and.c, should pairwise presolving use hashing?, default TRUE
7313- `constraints/countsols/sollimit` in cons_countsols.c, counting stops, if the given number of solutions were found (-1: no limit)
7314- `constraints/xor/presolusehashing` in cons_xor.c, should pairwise presolving use hashing?, default TRUE
7315- `heuristics/oneopt/duringroot`, default value TRUE
7322- extend Makefile to link against Ipopt if `IPOPT=true` is set
7327- fixed wrong use of pointer in lp.c
7328- fixed bug with array dimension not reset to zero when array is freed in pseudoobj propagator
7329- fixed bug with enforcement of pseudo solutions: if pseudo solution is choosen because LP hit a limit, it has to be
7330 enforced in any case
7331- fixed potential bug in coloring example: SCIPcreateChild() is now given an estimate in terms of the transformed
7332 problem by SCIPgetLocalTransEstimate(), no longer the estimated original problem value. Also clarified this in the
7333 comments for SCIPcreateChild()
7334- fixed compiler warning `warning: dereferencing type-punned pointer will break strict-aliasing rules` which resuts in
7335 scip-crashes with gcc version 4.4.0
7336- adjusted assert in var.c
7337- fixed bug in SCIPvarGetActiveRepresentatives() in var.c
7338- fixed bug with objective limit in lp.c: previously the infinity value of SCIP was used as default - now the value of
7339 LPI is used. In the earlier version in many cases the problems where never infeasible.
7340- added and adjusted some asserts, initialized some values
7341- increased the numerical stability of coefficient tightening for Big M formulations
7342- fixed bug with incorrect pseudo activities when objective of a variable switches sign in linear constraint handler
7343- fixed bug with empty constraints in several writing routines
7344- fixed `GGT-Kaibel-Bug` in var.c, prop_pseudoobj.c and cons_varbound.c that occured while computing new values using
7348 - fixed bug in coefficient tightening with infinite bounds
7349 - fixed bug in solve.c: in case lowerbound >= upperbound, SCIPsolveIsStopped() returned `SCIP_STATUS_GAPLIMIT`
7352 - fixed bug in SCIPsolveNode() concerning the case that the time limit was hit while solving the LP relaxation of a
7353 subproblem which is already an LP (branching on pseudo solution is not possible)
7354 - fixed bug in vbc tools concerning of marking probing nodes
7355 - fixed bug in solve.c with nodes which are marked to be repropagated while enforcement
7358 - fixed possible infinite loop while multiaggregating a variable in var.c
7359 - fixed bug in SCIPgetSolVals() similar to SCIPgetSolVal(): try to get original variables of transformed ones if the
7360 solution lives in original space
7363 - fixed potential bug: restarts are now only done if no active pricers exist
7364 - fixed bug in SCIPlpSolveAndEval(): if fastmip and pricers enabled and objlimit was reached but CPLEX did not perform
7365 the final pivot step in order to exceed the objlimit, do one additional simplex step with pricing strategy steepest
7366 edge, if this doesn't suffice, turn off fastmip temporarily and solve again. Also consider solstat of the new
7368 - fixed bug with invalid pseudo solution (lower bound was always >= 0) when using pricing.
7369 - fixed bug in SCIPfreeProb() in scip.c: all pricers are deactivated now
7372 - now frees debug memory
7373 - fixed bug with exponential complexity for reallocating memory in SCIPvarGetActiveRepresentatives() in var.c
7374 - fixed casting of void* pointers in memory.h for C++, adjusted the same for C in memory.h and due to that adjusted all
7375 header files(set whole files in extern `C`) and cpp-files(removed unnecessary extern `C` lines)
7376 - removed memory leak in connection with freeing branch and bound nodes: focusnode was not freed if both children could
7377 be cut off due to bounding
7379- Reading and Writing:
7380 - corrected bug in reader_lp.c: earlier read bounds were thrown away (implementation was not conforming to standard)
7381 - fixed bug in reader_lp.c with respect to constraint and variable names which start with two or more dots `..`
7382 - fixed bug in all readers w.r.t. SCIPgetProbvarLinearSum()
7383 - fixed bug in reader_mps.c with respect to corrupted files
7384 - fixed bug in reader_mps.c with respect to writing transformed problems
7385 - changed wrong writing of mps files due to constraints without any name
7386 - fixed a bug during reading debug solution file
7387 - fixed bug in case of reading an objective function in opb format with multiple occurrences of the same variable
7388 - fixed bug in case of reading an objective function in lp format with multiple occurrences of the same variable
7389 - fixed a wrong fix of a reading bug, which was in reality a writing bug in MPS format; integer variables in mps format
7390 without bounds are binary variables, if the bound of an integer variable is infinity you have to write this bound
7393 - fixed bug in sepa_cmir.c, sepa_mcf.c and sepa_flowcover.c: sol different to LP solution is now separated
7394 - corrected two asserts in sepa_redcost.c (reduced costs can be negative for fixed variables: qsopt uses this)
7395 - fixed bug in sepa_zerohalf.c; replacement of own sorting functions by template functions was incorrect
7396 - fixed bug in var.c, cons_knapsack.c and sepa_flowcover.c: variable bounds corresponding to implication are not
7397 generated if coefficient is large, variable bounds with large coefficients are ignored for construction of knapsack
7399 - fixed bug in sepa_impliedbound.c concerning redundant implications
7402 - fixed bug in sepa_cmir.c concerning uninitialized mksetcoefs (if MIR-cut generation is aborted because the aggregated
7403 constraint is empty or contains too many nonzero elements mksetcoefs is invalid)
7404 - interrupts optimization process if a node will be cutoff, which allows the solution
7405 - fixed bug in sepa_impliedbounds.c and sepa_intobj.c: if separating a sol, this sol is now also given to SCIPaddCut()
7406 so that the efficacy of the cut is now computed correctly
7407 - fixed bug in solve.c caused by integer overflow due to setting the number of cuts to INT_MAX
7410 - fixed wrong result in check.awk, if infeasible problems are stopped in presolving
7411 - fixed exponential calculation of solution values during check of original solution, therefore changed
7412 SCIPvarGetActiveRepresentatives() in var.c and flattened all multiaggregated vars at the end of presolving in
7414 - fixed bug with wrong abort criterion in presolving
7415 - fixed bug in presol.c caused by not reseting presolver-wasdelayed status
7416 - fixed bug in SCIPconsSetInitial() that occurred in pairwise presolving: add or delete constraint in initconss when
7417 changing the initial flag
7420 - fixed bug in cons.c caused by not resetting conshdlr data after restart
7421 - fixed memory error in cons_countsols.c
7422 - fixed assert in cons_and.c method SCIP_DECL_CONSINITSOL(consInitsolAnd)
7423 - fixed bug in cons_countsols.c we respect to warning message that `The current parameter setting might cause ...`
7425- Knapsack Constraint Handler:
7426 - fixed wrong assert in cons_knapsack.c and handled a special this case in simplifyInequalities()
7427 - fixed some bugs in simplifyInequalities() in cons_knapsack.c
7428 - fixed bug in mergeMultiples() in cons_knapsack.c
7429 - adjusted ConsData and ConsHdlrData in cons_knapsack.c
7430 - fixed compiler warning caused by no initialization of two integer in cons_knapsack.c
7431 - fixed bug in cons_knapsack.c caused by having a multi-aggregated variable in a knapsack constraint, now applyFixing is
7432 able to resolve a binary multi-aggregation with integral values
7434- Linear Constraint Handler:
7435 - fixed infinity loop in simplify inequalities in cons_linear.c
7436 - fixed bug in cons_linear.c: do not select variable as slack variable for multiaggregation in convertLongEquality if it
7437 has been marked as not-multiaggregable
7438 - fixed bug in cons_linear.c: also do not multiaggregate variables in dual preproccessing if it has been marked as
7440 - fixed bug in cons_linear.c: slight decrease of epsilon in order to make sure that scaled coefficients are really
7442 - fixed bug in chgRhs() and chgLhs() of cons_linear.c: after changing lhs or rhs of a constraints lhs <= rhs has to be
7443 satisfied without numerical tolerances
7446 - added and changed some SCIPisStopped() calls in several heuristics
7447 - fixed bug in oneopt heuritic with start solution which has become infeasible due to global bound changes
7450 - corrected several bugs in the Clp-interface concerning return values
7451 - fixed potential interface bug: time limits of 0.0 are not anymore passed to the LP solver, which may have caused
7454@page RN11 Release notes for SCIP 1.1
7456@section RN110 SCIP 1.1.0
7457*************************
7462- SCIP can now count integer feasible solutions for IPs/CIPs (without continuous variables) (see SCIPcount())
7463- check.awk now uses TeX package supertabular which supports automatic pagebreak
7464- struct `SCIP_Stat` has now two additional variables: `nprobboundchgs`, `nprobholechgs`; these are used to fix the domain
7465 reduction counts in sepa.c, cons.c, branch.c and prop.c; this means, that now the domain reduction counts are reduced
7466 by those domain reduceds which are preformed during probing
7467- added capabilities to flatten the (multi)-aggregation graph of variables
7468- pseudoobj propagator now also propagates the global lower (dual) bound
7469- new heuristic DINS (distance induced neighborhood search by Ghosh)
7472 - SCIP can now output a picture of the constraint matrix in PPM format.
7473 - output of real values is now done with 15 digits after the decimal point
7474 - Extended the capabilities of SCIP to output problems in different formats (LP, MPS, CIP, ...). You can output the original and
7475 transformed problem. Furthermore, generic names can be given to the variables and constraints.
7476 - The feasibility test for solutions at the end of the execution now outputs more useful information.
7477 This made some changes in the interface of constraint handlers necessary.
7480 - added predefined settings file presolving/aggressive.set
7481 - new presolver boundshift (presol_boundshift.{c,h}); this presolver is currently turned off with default parameter setting
7484 - linear constraint handler now detects continuous variables that are implicit integer in dual presolve
7485 - replaced some old sorting methods in cons_knapsack.c, heur_octane.c, sepa_flowcover.c and presol_probing.c through
7486 SCIPsort...() interfaces, adjusted misc.{c,h} and pub_misc.h for these changes
7487 - cons_countsols.c is now able to store the collected solution if required
7488 - added first version of SOS type 1 constraint handler (cons_sos1.{c,h})
7489 - added first version of SOS type 2 constraint handler (cons_sos2.{c,h})
7490 - less aggressive scaling in linear constraint handler presolve to improve numerics
7491 - added first version of constraint handler cons_countsols.{c,h}
7494 - added ccg-reader (weighted column connectivity graph)
7495 - added reader for pseudo-Boolean problems (reader_opb.{c,h})
7496 - the ZPL reader is now able to pass a starting solution to SCIP
7497 - the MPS reader is now able to write a problem in MPS format
7498 - the ZIMPL reader now understands SOS type 1 and 2 constraints
7499 - the LP reader reads SOS constraints of type 1 and 2
7500 - the MPS reader reads the SOS section (but cannot yet handle `MARKERS`)
7503 - The SoPlex LPI can now write basis files.
7504 - revised lpi_clp.cpp (many small changes, in particular writing and reading of bases)
7505 - added FASTMIP settings in lpi_clp.cpp that try to improve the performance of Clp as much as possible
7507- Cuts and Separation:
7508 - the c-MIR separator now also tries to get rid of implicit integer variables by aggregation
7509 - allow cut selection based on support of inequality in orthogonality computation
7510 - disabled zerohalf cuts by default
7511 - adjusted all predefined settings files, e.g., `settings/cuts/fast.set`, such that they are consistent wrt removed,
7512 added and changed parameter values of scip.
7513 - New cutting plane separator MCF (beta version).
7514 - new separator sepa_zerohalf.{c,h}; separates {0,1/2}-Cuts according to Caprara and Fischetti
7516Performance improvements
7517------------------------
7519- heavily decreased the usage of SCIPisStopped(), which costs system time
7520- small performance improvement of c-MIR aggregation heuristic
7521- reworked strong branching in lpi_clp.cpp (scaling works now, bounds can be trusted)
7524 - The preprocessing has been revised. It now applies bound computations in a numerically more stable way. The pairwise
7525 comparison of linear, logicor, and setppc constraints has been improved.
7526 - better branching in SOS1/SOS2 constraints
7527 - fixed performance bug with large number of unnamed constraints that will kill the name hash table (now, unnamed
7528 constraints are not put into the hash table)
7530- Cuts and Separation:
7531 - improved the performance of SCIPcalcMIR() and SCIPcalcStrongCG() by exploiting sparsity
7532 - improved performance of SCIPvarGetLPSol(), which affects many parts of the code, in particular Gomory and strong CG cuts
7533 - do not calculate MIR and StrongCG cut aggregations if number of nonzeros in aggregated row is too large
7536 - improved pairwise presolving in cons_linear.c: reduced cache misses, reduced number of SCIPisStopped() calls and
7537 included detecting of redundant constraints with hash table in advance
7538 - tighter memory limits in knapsack presolve lifting procedure to avoid overly expensive presolving
7539 - included detecting of redundant constraints with hash table in advance in cons_logicor.c and limit other pairwise
7541 - included detecting of redundant constraints with hash table in advance in cons_setppc.c and limit other pairwise
7543 - limit pairwise presolving in cons_linear.c
7545Examples and applications
7546-------------------------
7548- Added an example for the graph coloring problem in `examples/Coloring`, showing the usage of column generation.
7550- extended TSP example
7555### New and changed callbacks
7557- New callback method SCIP_DECL_READERWRITE(x) in type_reader.h; this method is called to write a problem to file
7558 stream in the format the reader stands for; useful for writing the transformed problem in LP or MPS format. Hence,
7559 also SCIPincludeReader() has changed.
7560- The callback \ref CONSCHECK (SCIP_DECL_CONSCHECK()) in the constraint handlers now has a new parameter `printreason` that tells
7561 a constraint handler to output the reason for a possible infeasibility of the solution to be checked using
7562 SCIPinfoMessage(). Have a look at one of the constraint handlers implemented in SCIP to see how it works. This
7563 methodology makes it possible to output the reason of a violation in human readable form, for instance, for the check
7564 at the end of a SCIP run, where the obtained best solution is checked against the original formulation.\n This change
7565 often has little effect on C-implementations, since this parameter can be safely ignored with respect to the
7566 correctness of the code. The corresponding C++ method scip::ObjConshdlr::scip_check(), however, has to be extended
7567 and will not compile otherwise.
7568- added new LPI pricing option `SCIP_PRICING_LPIDEFAULT`, such that every LP interface can set the default pricing
7569 strategy on its own (`auto` is not useful for this, because for CPLEX, for example, SCIP seems to be worse with `auto`
7570 then with `steepest edge`)
7571- Added user pointer to callback methods of hash table, see pub_misc.h.
7573### Deleted and changed API methods
7575- SCIPgetVarRedcost() now returns 0 for variables that have been aggregated out or removed in presolving.
7576 reduced cost in case of infeasible LPs)
7577- new parameter `maxfrac` for SCIPcalcStrongCG()
7578- new parameter `maxmksetcoefs` for SCIPcalcMIR() and SCIPcalcStrongCG() methods
7579- new parameter `conshdlrname` in SCIPincludeLinconsUpgrade()
7582 - new parameters `extension` in SCIPreadProb() defining a desired file format or `NULL` if file extension should be use
7583 - New parameters `extension` and `genericnames` in SCIPprintTransProblem(), SCIPprintOrigProblem(),
7584 SCIPwriteOrigProblem(), and SCIPwriteTransProblem() defining the requested format or `NULL` for default CIP format
7585 and using generic names for the variables and constraints. Examples are
7586 - SCIPprintTransProblem(scip, NULL, NULL, TRUE) displays the transformed problem in CIP format with
7587 generic variables and constraint names
7588 - SCIPprintOrigProblem(scip, NULL, `lp`, FALSE) displays the original problem in LP format with
7589 original variables and constraint names.
7592 - expand sorttpl.c by some parameters
7593 - changed some names for sorting methods
7594 - replaced sorting methods SCIPbsort...() by faster (quicksort/shellsort) algorithms SCIPsort...() Note that the order
7595 of the parameters has been changed to simplify the template code in sorttpl.c!
7598 - SCIPcheckSolOrig() is restructured. The last two parameters have changed. They are now bools indicating
7599 whether the reason for the violation should be printed to the standard output and whether all violations should be
7600 printed. This reflects the changes in the constraint handlers above, which allow the automation of the feasibility
7601 test. The pointers to store the constraint handler or constraint are not needed anymore.
7602 - the parameter list of the method SCIPcheckCons() (scip.h) has changed; the new advatage is, that SCIP can print the
7603 reason for the violation of a constraint as for as the constraint handler supports that
7604 - the parameter list of the method scip_check() (objconshdlr.h) has an additional parameter `printreason` see for
7605 explanation the previous point
7607### New API functions
7609- LPI now has a function SCIPlpiGetSolverPointer() that returns a solver dependent pointer. This can be used to directly
7610 access the LP solver. This should, of course, only be used by people that know exactly what they are doing.
7611- added capabilities to avoid multi-aggregation of a single variable by setting a corresponding flag (SCIPmarkDoNotMultaggrVar())
7612- SCIPgetProbvarLinearSum()
7613- SCIPgetResultantAnd() which returns the resultant variable of an `and` constraint
7614- SCIPchgChildPrio() to change the node selection priority of the given child
7616- SCIPrepropagateNode() to mark a node for repropagation
7617- SCIPcount() (in cons_countsols.h) for counting all feasible solution of a given CIP
7618- SCIPcreateRootDialog() (in dialog_default.h) which creates a root dialog
7619- SCIPgetVectorEfficacyNorm()
7620- SCIPseparateRelaxedKnapsack() in cons_knapsack.h
7621- SCIPgetCutoffdepth() which returns the depth of first node in active path that is marked being cutoff
7622- SCIPflattenVarAggregationGraph()
7623- SCIPclockGetLastTime()
7624- SCIPcalcHashtableSize() to get a reasonable hash table size
7625- SCIPgetVarFarkasCoef() and SCIPgetColFarkasCoef() to get the farkas coefficient of a variable (analogon of
7626- SCIPgetRepropdepth() to get the depth of first node in active path that has to be propagated again
7627- SCIPmajorVersion(), SCIPminorVersion() and SCIPtechVersion() returning the corresponding version
7629- Read, Write and Print:
7630 - SCIPprintSysError() which encapsulates the strerror_r calls, the NO_STRERROR_R flag switches between the use
7631 of strerror_r and strerror inside
7632 - SCIPsnprintf() safe version of snprintf (and sprintf)
7633 - SCIPreaderCanRead() and SCIPreaderCanWrite() in pub_reader.h, these return TRUE if the corresponding
7634 reader is capable to read or write, respectively
7635 - SCIPwriteOrigProblem(), e.g., SCIPwriteOrigProblem(scip, `orig.lp`, NULL, FALSE) prints the original
7636 problem in LP format in the file `orig.lp`
7637 - SCIPwriteTransProblem(), e.g., SCIPwriteTransProblem(scip, NULL, NULL, FALSE) displays the transformed problem in CIP format
7640 - SCIPcutGenerationHeuristicCmir() in sepa_cmir.h
7641 - SCIPheurGetTimingmask() and SCIPheurSetTimingmask()
7644 - added some downwards-sorting methods
7646 - SCIPsortedvecInsert...(), SCIPsortedvecInsertDown...(), SCIPsortedvecDelPos...(),
7647 SCIPsortedvecDelPosDown...(), SCIPsortedvecFind...() and SCIPsortedvecFindDown...() to manage sorted vectors or
7648 groups of vectors of various data types that are sorted w.r.t. the first vector
7650### Command line interface
7652- advanced reading and writing dialog in interactive shell
7654### Interfaces to external software
7656- Many changes in the SoPlex interface: The current one is tailored towards SoPlex 1.4 (aka 1.3.3). All SoPlex functions
7657 (where applicable) should now have an exception handling. The Bugfix for adding columns has been moved to SoPlex. One
7658 can use ROW representation. Reading/writing of a basis has been implemented.
7660### Changed parameters
7662- changed default frequency parameters for RINS, Local Branching, Crossover and Mutation heuristic This should not
7663 change the performance but happened just for consistency reasons
7664- changed parameter default values for the priority of presolver `dualfix` and `inttobinary`
7665- removed parameter `separating/cmir/maxtestdeltaroot`
7666- new value `l` for parameter `lp/pricing`, which is the new default
7670- `constraints/and/linearize` to enable linearization of all <and> constraints (in presolving),
7671- `constraints/and/initiallp` to turn on, off, or `auto` that the LP relaxation of the AND constraints are in the initial LP;
7672- `constraints/countsols/collect` to enable the storing of the solutions; default value FALSE;
7673- `constraints/indicator/addCoupling` to enable generation of relaxation
7674- `constraints/indicator/branchIndicators` to decide whether it is branched on indicator constraints in enforcing
7675- `constraints/indicator/genLogicor` to decide whether logicor constraints instead of cuts are generated
7676- `constraints/indicator/sepaAlternativeLP` to decide whether separation takes place using the alternative LP
7677- `constraints/linear/aggregatevariables` to search for aggregations in equations in the presolving step
7678- `constraints/linear/dualpresolving` to disable dual presolving step in the linear constraint handler; default value is TRUE
7679- `constraints/linear/simplifyinequalities` to enable a simplification step for inequalities; default value is set to FALSE = disabled
7680- `constraints/linear/upgrade/binpack` to enable or disable the linear upgrading process
7681- `constraints/linear/upgrade/eqknapsack` to enable or disable the linear upgrading process
7682- `constraints/linear/upgrade/invarknapsack` to enable or disable the linear upgrading process
7683- `constraints/linear/upgrade/knapsack` to enable or disable the linear upgrading process
7684- `constraints/linear/upgrade/logicor` to enable or disable the linear upgrading process
7685- `constraints/linear/upgrade/setppc` to enable or disable the linear upgrading process
7686- `constraints/linear/upgrade/varbound` to enable or disable the linear upgrading process
7687- `constraints/linear/presolusehashing` to use hashing comparison in cons_linear.c; default value is TRUE
7688- `constraints/logicor/presolusehashing` to use hashing comparison in cons_logicor.c; default value is TRUE
7689- `constraints/setppc/presolusehashing` to use hashing comparison in cons_setppc.c; default value is TRUE
7690- `constraints/SOS1/branchNonzeros` to decide whether SOS1 constraint with largest number of nonzero variables is picked for branching
7691- `constraints/SOS1/branchSOS` to enable or disable branching on SOS1 constraints
7692- `heuristics/feaspump/beforecuts` to allow the feaspump to be called before cut separation
7693- `heuristics/mutation/minimprove`
7694- `presol/donotmultaggr` which disables multiaggregation for all variables of the problem
7695- `separating/cmir/densityoffset` to allow for more c-MIR cuts on small models
7696- `separating/orthofunc` to choose function for scalar product computation in orthogonality test
7701- updated mmm.{test,solu}, mittelmann.{test,solu}, miplib3.solu, miplib.solu, shortmiplib.test and added
7702 mittelmann_current.test, mittelmann_old.test
7703- added test scripts for testing counting (make testcount)
7704- removed tag make testpre (useless without corresponding scripts)
7705- added tag testcount (make testcount); this allows for testing counting problem
7706- replaced tcsh by bash and gawk by awk in all check scripts to achieve higher compatibility
7713- added `make/make.project` as default make include for external projects using SCIP
7714- added possibility to compile shared libraries in makefiles (and added `make/make.linux.x86.gnu.opt-shared`)
7715- replaced <string> by <cstring> in all C++-interfaces to get `strlen()` included (gcc-4.3 gave an error)
7716- Moved -rpath option for ld to linux-specific Makefiles.
7717- Re-activated readline library on darwin/ppc.
7720 - added in all `make/make.*` `GMP_FLAGS` and `GMP_LDFLAGS`
7721 - new flag GMP with values (`auto`, `true and `false`); in case of `auto` the library gmp is linked if ZIMPL is
7723 - adapted all makefiles of the examples accordingly
7726 - modified makefiles to accept ZIMPLOPT and LPSOPT flags (with values `opt` or `dbg` and default being `opt`), and
7727 removed `LPS=spxdbg` and `LPS=clpdbg`
7728 - added target spx132 for SoPlex version 1.3.2
7733- fixed CTRL-C if NO_SIGACTION is set (e.g., for MinGW)
7734- added checks whether a plugin (handler) has already been included to avoid later complications e.g. with parameters.
7735- fixed bug with wrong `tightened` return value of some of the change bounds methods
7736- forced full propagation in presolving -> this fixes a bug that implied that variable locks became inconsistent
7737- replaced calls to perror() by SCIP error message using strerror(errno); this avoids problems with the error output
7739- fixed bug in method SCIPgetProbvarLinearSum()
7740- fixed bug with errors occurring in sub-MIPs. Search is only aborted in dbg mode, in opt mode a warning will be printed
7741- fixed bug in tclique-graph datastructure concerning insertion of edges into nonempty graph
7742- corrected bug in SCIPtreeBranchVar() (tree.c): several comparison functions needed a `feas`.
7743- fixed bug in SCIPtightenVarLb/Ub() in scip.c concering forcing a bound change (bound improvement is checked now)
7744- improved stage checking for bound computation
7745- fixed usage of command test for string comparison in check-scripts (now compatible with ubuntu)
7746- replaced sprintf and snprintf by SCIPsnprintf() fixed potential bug with overlong strings
7747- corrected bug in the case when soplex threw an exception in autopricing
7748- fixed bug in SCIPvarGetOrigvarSum() concerning the corner case the a negated variable has no parent variable in
7752 - avoid aggregation of implicit integers with fractional aggregation scalars
7753 - fixed bug in aggregateActiveIntVars(): If a < 0, multiply a*x + b*y == c by -1 (algo for finding initial solution does
7754 only work for a > 0).
7755 - avoiding aggregation that removes information about implicitly integer variables (removes bug)
7756 - fixed bug with exponential running times due to complicated recursive multi-aggregation
7757 - corrected bug in var.c occuring during applying boundchanges in varUpdateAggregationBounds method
7760 - fixed bug that a missing CONSTRANS in constraint handler leads to `NULL` pointer as constraint data for the copied
7761 constraints instead of pointer copies of the consdata (as explained in the constraint handler `HowTo`)
7762 - fixed bugs in second part of consdataTightenCoefs(): Removed min/maxleftactisinfinity (definition was not correct),
7763 fixed calculation of min/maxleftactivity and removed asserts concerning whether all redundant vars were deleted (led
7764 to different behavior in debug and opt mod).
7765 - fixed typo in documentation: default value for `dynamic` parameter is FALSE for all constraint handlers!
7766 - fixed bug in preprocessing of SOS2 constraints (cons_sos2.c)
7767 - fixed bug in cons_countsols.c concerning variable locking
7768 - fixed bug in cons_varbounds.c, concerning SCIPaddVarVlb() and SCIPaddVarVub()
7769 - fixed bug in applyFixings() in cons_varbound.c concerning tightening the bound of a variable left in a redundant
7770 constraint (bound change is forced now)
7773 - fixed bug with useless objective cutoff in LNS heuristics
7774 - removed bug for values greater than (-)infinity, heur_shifting.c, heur_intshifting.c, heur_rounding.c, heur_oneopt.c
7775 - fixed bug with errors occurring in heuristic LPs. In opt mode a warning will be printed, abort in dbg mode
7777- Linear Constraints:
7778 - fixed bug with wrong update of activities in linear constraints after global upper bound changes
7779 - fixed bug in preprocessConstraintPairs() in cons_linear.c concerning updating the flags of the constraint that stayes
7780 in the problem (nonredundant information were lost before)
7781 - fixed bug in cons_linear.c caused by comparing two infinity values during checking of using variable as slackvariable
7782 - removed bug for rhs/lhs greater than (-)infinity, cons_linear.c
7783 - removed bug caused by hashcomparison for non-sorted constraints, cons_linear.c
7784 - fixed bugs with wrong presolving due to cancellation in (res-)activities in cons_linear.c
7785 - removed BOUNDSCALETOL adjustment in cons_linear.c. This fixes bug with slightly infeasible variable fixings in
7786 presolving; reliable resactivities should make the BOUNDSCALETOL relaxation redundant.
7787 - removed `epsilontic` bug in cons_linear.c due to adjusting left/right hand side in applyfixing
7788 - fixed bug with multi-aggregated variables in cons_logicor: instead of fixing them, a linear constraint will be created
7789 - corrected bug in cons_linear.c:applyFixings() [if variable was fixed to infinity the rhs/lhs were wrong]
7790 - fixed bugs in pairwise presolving of cons_linear.c concerning deletion of upgraded constraints and inconsistent update
7791 of nchgsides in case of coefsequal and coefsnegated
7792 - fixed false assert and corrected a bug caused by deleting a constraint on `firstchanged` position in pairwise
7793 presolving with hashing in cons_linear.c
7796 - fixed handling of unbounded variables with 0 objective in SCIPlpGetModifiedPseudo[Proved]Objval() (lp.c)
7797 - fixed bug with uncatched LPSOLSTAT after hitting a time or iteration limit
7798 - corrected bug in SCIPlpGetState() if the LP is empty
7799 - fixed bug in SCIPlpSolveAndEval(): added extra simplex step if objlimit reached, fastmip and pricers enabled in order
7800 to get dual solution for pricing.
7801 - weakened two too strong asserts in lp.c concerning the LP result OBJLIMIT
7802 - fixed bug in SCIPlpSolveAndEval(): allow more than one extra simplex step for getting an objlimit exceeding solution
7806 - corrected invalid memory access in tcliqueIsEdge: added check whether node1 has no neighbors (tclique_graph.c)
7807 - removed memory leak detected with the help of coverity in dialog.c
7808 - fixed bug with memory reallocation in SCIPgetProbvarLinearSum()
7809 - tried to fix memory leak in dialog.c occuring from different versions of the readline/history libraries
7810 - removed possible memory leak in objdialog.cpp
7813 - fixed numerical issue in linear constraint propagation: need slightly more aggressive tightening such that probing
7814 does not choose a wrong value for fixing inside an epsilon interval
7815 - fixed numerical bug in dual presolving of linear constraint handler
7816 - avoid fixing variables to infinity in order to get rid of numerical inconsistencies in the original model
7819 - added handling of the case of roundable variables with 0 objective in presol_dualfix.c
7820 - fixed bug with writing the MIP relaxation to a file concerning the objective function; in case the original objective
7821 function is requested, the transformed objective function gets re-transformed (scaling, offset)
7822 - fixed bug with wrong objective sense output for transformed problem. The transformed problem is always a minimization
7824 - fixed bug with objective scaling after restart
7827 - fixed bug with reading empty lines in TSP example
7828 - fixed bug with non-conformal parameter name in reader_ppm
7829 - fixed infinite loop in LP file reader if a line exceeds the character limit
7830 - fixed bug in reader_ppm while appending strings for output file
7831 - fixed some `SCIP_RETCODE` bugs in reader_fix.c, reader_sol.c, reader_sos.c and reader_zpl.c
7832 - fixed docu in type_reader.h
7833 - fixed bug with multi-aggregated variables which are de facto aggregated or fixed after flattening the aggregation tree
7834 - fixed bug with bound changes of variables in modifiable constraints during full dual presolving of linear conshdlr
7835 - increased compiler compatibility for C++ wrapper classed by adding extern `C` in obj*.cpp files and changing strlen
7836 calls to std::strlen
7839 - corrected bug in priceAndCutLoop(): separation was aborted if domain reduction was applied
7840 - fixed bug in sepa_mir.c: size of testeddeltas-array was too small
7841 - corrected imlementation of SCIPlpiGetBasisInd() in lpi_clp.cpp (this fixes the bug that almost no Gomory cuts are
7845 - fixed bugs in sorttpl.c: fixed wrong arraysize in shellsort; in case an has at most one element, then no sorting is
7847 - fixed wrong if condition for function call in sorttpl.c
7848 - fixed obvious bug in linear constraint data sorting. Most part of the code assumed pure index sorting, but in fact, it
7849 was sorted by variable type as first criterion and index as second criterion.
7851@page RN10 Release notes for SCIP 1.0
7853@section RN100 SCIP 1.0.0
7854*************************
7859- SCIP now has a couple of specialized settings, all called scip_*.set
7860- SCIP is now compatible to the Exception branch of SoPlex
7861- if possible, objective function is scaled to make objective value integral with gcd 1
7862- slightly modified automatic constraint aging strategy
7863- new C templates disp_xxx.h and dialog_xxx.h and C++ wrapper classes objdisp.h and objdialog.h, respectively
7864- modified reader `sol`, st. files which where created via typing the order of commands `set log *.sol`,
7865 `disp sol var -`, `set log cplex.log` in Cplex can now be read
7866- new dummy LP interface `lpi_none.c`; useful for running SCIP without a LP solver
7869 - modified probing presolver to do multiple cycles if called in subsequent runs
7870 - changed sort algorithm in probing presolver
7873 - new node selection rule `estimate` (best estimate search)
7874 - new node selection rule `hybridestim`
7877 - the doxygen documentation now has HowTo's for all plugin types
7878 - the doxygen documentation now contains a FAQ
7879 - the documentation has now a TAB Modules; there you can find list of available constraint handles, presolvers,
7880 propagators, lpi interfaces, file readers and so on
7883 - time limit is now forwarded to lp solving algorithm
7884 - presolving, cut separation, primal heuristics and strong branching now better respect time limit
7887 - best estimate search is now used in all large neighborhood search heuristics
7888 - new improvement heuristic `oneopt`
7889 - new heuristic `actconsdiving` following an idea of John Chinneck
7891- Separation and Cuts:
7892 - modified cut selection code
7893 - cut conversion into linear constraints after a restart now works better
7894 - added flow cover separator
7895 - gomory cuts are now also separated for integral slack variables
7896 - less aggressive in Gomory cut separation
7897 - strong CG cuts are now also separated for integral slack variables
7899Performance improvements
7900------------------------
7902- greatly improved performance of LP file reader by replacing string copies with pointer copies
7903- removed performance bottleneck with non-bfs based node selectors and large leaf queues at the cost of a small memory
7904 overhead (2 ints per node in the leaf queue); this improves performance quite a bit on instances that take a large
7905 number of branching nodes
7906- improved performance of linear constraint propagation by delaying some floor/ceil calculations
7907- improved performance of clique cut separator
7912### New and changed callbacks
7914- new callback method SCIPdialogFree()
7916### Deleted and changed API methods
7918- slightly modified bound substitution heuristic in SCIPcalcMIR() and SCIPcalcStrongCG()
7919- slightly less conservative in numerics for SCIPmakeRowIntegral()
7920- linear and knapsack constraint handler may now deal with coefficients of value zero
7921- new parameter `maxbounddist` for SCIPincludeSepa() and constructor ObjSepa()
7922- new parameter `restart` for method SCIPfreeSolve()
7923- calling SCIPwriteLP() is now possible in Solved Stage
7924- SCIPwrite{LP,MIP} may no longer be called after solving, since the LP data structures may not be valid
7925- All functions SCIP<datatype>Param() got a new parameter `isadvanced`.
7926 This does not influence the performance of SCIP, but the position of the parameter in the settings menu.
7927 Hence, if you do not care about this, you can assign any value to it.
7928 You should add the corresponding flag to the SCIP<datatype>Param() calls in your own source code.
7931 - modified `SCIP_SUBVERSION` to be a number instead of a string (to be able to use `SCIP_SUBVERSION >= ...`)
7932 - SCIPsubversion() now returns an int instead of a const char*
7935 - new parameter `estimate` for SCIPcreateChild() giving an estimate for value of best feasible solution in the subtree to
7936 be created. One possibility is to use SCIPgetLocalOrigEstimate() for this value.
7937 - removed method SCIPnodeGetPriority()
7938 - removed parameter `lowestboundfirst` from SCIPincludeNodesel()
7941 - removed parameter `branchdir` from SCIPbranchVar()
7942 - new parameters `leftchild`, `eqchild` and `downchild` for SCIPbranchVar()
7943 - SCIPgetVarStrongbranch() now also returns lperror == TRUE if the solving process should be stopped, e.g., because of a
7946- Variable tightening:
7947 - replaced methods SCIPvarGetClosestVlb() and SCIPvarGetClosestVub() from pub_var.h by new methods
7948 SCIPgetVarClosestVlb() and SCIPgetVarClosestVlb() in scip.h
7949 - new parameter `force` for SCIPtightenVarLb() and SCIPtightenVarUb()
7951### New API functions
7955- SCIPgetLocalOrigEstimate() and SCIPgetLocalTransEstimate()
7957- SCIProwIsInGlobalCutpool()
7959- SCIPgetVarRedcost()
7960- SCIPtightenVarLbGlobal() and SCIPtightenVarUbGlobal()
7961- SCIPsepaGetMaxbounddist()
7962- SCIPboundchgGetNewbound(), SCIPboundchgGetVar(), SCIPboundchgGetBoundchgtype(),
7963 SCIPboundchgGetBoundtype(), SCIPboundchgIsRedundant(), SCIPdomchgGetNBoundchgs(), SCIPdomchgGetBoundchg()
7964- SCIPnodeUpdateLowerboundLP()
7965- SCIPcalcNodeselPriority()
7966- SCIPnodeGetEstimate()
7967- SCIPnodeGetDomchg()
7968- SCIPgetRootNode() (in combination with SCIPcutoffNode(), this allows the immediate finishing of the optimization)
7970### Command line interface
7972- default dialog menu now includes the commands `set default` and `display parameters`
7973- added option to write node LP and MIP relaxations to LP file from interactive shell
7975### Changed parameters
7977- parameters are now separated into basic and advanced, the latter ones have been moved to extra submenus
7978- priority parameters are now restricted to be in [INT_MIN/4,INT_MAX/4] to avoid overflow errors in comparison methods
7979- increased priority of `estimate` node selector, such that this is the new default node selector
7980- changed meaning of parameter setting `nodeselection/childsel = l`; old meaning is now called `r`
7981- changed default value of `conflict/maxvarsfac` to 0.1
7982- changed default value of `conflict/useprop` to TRUE
7983- changed default value of `conflict/useinflp` to TRUE
7984- changed default value of `conflict/usepseudo` to TRUE
7985- changed default value of `conflict/maxlploops` to 2
7986- changed default value of `conflict/lpiterations` to 10
7987- changed default value of `conflict/interconss` to -1
7988- changed default value of `conflict/reconvlevels` to -1
7989- changed default value of `conflict/settlelocal` to FALSE
7990- changed default value of `constraints/linear/propfreq` to 1
7991- changed default values of `heuristics/∗diving/backtrack` to TRUE
7992- changed default value of `nodeselection/restartdfs/stdpriority` to 10000
7993- changed default value of `numerics/boundstreps` to 0.05 in order to avoid very long propagation loops on continuous variables
7994- changed default value of `presolving/restartfac` to 0.05
7995- changed default value of `presolving/restartminred` to 0.10
7996- changed default value of `separating/objparalfac` to 0.01 for performance reasons
7997- changed default value of global `separating/maxbounddist` to 1.0
7998- changed default value of `separating/objparalfac` to 0.0001
8002- `conflict/enable` to globally enable or disable conflict analysis
8003- `constraints/linear/maxcardbounddist` and `constraints/knapsack/maxcardbounddist`
8004- `heuristics/∗diving/backtrack` to activate 1-level backtracking for most of the diving heuristics
8005- `heuristics/feaspump/maxstallloops`
8006- `nodeselection/childsel` to control the child selection
8007- `presolving/immrestartfac`
8008- `separating/∗/maxbounddist` to have individual maxbounddist parameters per separator
8009- `separating/clique/backtrackfreq` to speed up clique cut separation in heuristic fashion
8010- `separating/redcost/continuous`
8017- added version numbers to library files (There will be a softlink generated in the lib/ and bin/ directories without
8018 version number that point to the latest compiled version.)
8019- added .exe extension to binaries of MinGW
8020- removed the `.static` extension associated to the LINK variable from the Makefile system (If you want to build
8021 makefiles for shared library generation, use the OPT variable. For example, you could create a makefile
8022 `make/make.linux.x86.gnu.opt-shared` and compile it with `make OPT=opt-shared`.)
8024- Defaults and Options:
8025 - modified the default LP solver to be SoPlex instead of CPLEX
8026 - added `LPS=none` for compiling SCIP without a LP solver
8027 - made `ZIMPL=true` the default; if you do not want to include ZIMPL support, call `make ZIMPL=false`
8032- fixed bug in rowScale() concerning deletion of almost zero coefficients
8033- weakened assert in primal.c in order to avoid numerical troubles
8034- fixed bug with too long variable names
8035- fixed bug with strange user descriptions of plugins
8036- changed position of some asserts to prevent segmentation faults
8037- SCIPgetAvgPseudocostCount() and SCIPgetAvgPseudocostCountCurrentRun() now return the average over all integer
8038 variables instead of all variables, since pseudo costs are not recorded for continuous variables
8039- fixed wrong sorting of plugins with priorities close to INT_MIN or INT_MAX
8040- replaced `line` by `read` in Makefile, since `line` is non-standard
8041- fixed bug with branching rules that produce only one child with no changes to the problem
8042- fixed bug that external relaxator is not reset appropriately for a new problem instance
8043- removed wrong assert in function paramWrite()
8044- fixed bug with uninitialized in check.awk
8045- fixed bug in ZIMPL file reader for multiple occurrences of a single variable in the objective function
8046- fixed bug with deleting variables from the transformed problem that are contained in the implication graph
8047- fixed bug in root reduced cost fixing propagator that leads to an empty domain for a variable as a proof of optimality
8048 of the current incumbent
8049- fixed bug with fractional coefficients of binary variables in cont --> impl int upgrading
8052 - fixed bug with aggregated variables in debug solution test
8053 - now it is possible to add original solutions
8054 - fixed bugs with SCIPgetBestsol() returning `NULL` after a restart with user objective limit
8055 - fixed wrong status code in presence of user objective limit and a feasible solution that is not better than the limit
8058 - fixed bug with wrong bound changes of loose variables
8059 - changed wrong assert in SCIPnodeAddBoundinfer()
8060 - fixed bug in variable bounds search and insertion method
8061 - fixed bug regarding modifying bounds in original problem if negated original variables exist
8062 - fixed bug with multiple pending bound changes on some variable
8065 - fixed bug in integer objective separator with restarts
8066 - fixed bug in integer objective separator with dynamic columns
8069 - fixed bug that cut age was not reset to zero for violated cuts
8070 - fixed bug in SCIPcutpoolAddNewRow() concerning update of minidx and maxidx of added row
8071 - fixed numerical bug in rowScaling of lp.c, which possibly cut off feasible solutions
8072 - significantly improved performance of c-MIR and Gomory cuts by caching closest VLB and VUB info
8075 - fixed numerical buf with slightly different LP optimum after resolving due to probing/diving
8076 - fixed bug in cmir and flowcover separator with variables which are currently not in the LP
8077 - fixed bug with LP size management in probing if column generation is used
8078 - fixed bug in LP file reader with row names identical to section keywords
8079 - fixed potential bugs due to errors in resolving the LP after diving or probing
8080 - fixed potential bugs in SCIPpriceLoop() and priceAndCutLoop(), st. now all LP solution stati are handled appropriately
8081 - fixed potential bug with non-existent LP in SCIPwrite{LP,MIP}
8083- Constraint handler:
8084 - removed wrong assert in bounddisjunction constraint enforcement
8085 - fixed numerical bug in propagator of varbound constraint handler
8086 - fixed bug in variable bound constraint handler with changing bounds on multi-aggregated variables
8087 - fixed bug in linear constraint handler: only tight cuts are transformed into linear constraints after restart
8088 - fixed bug in bounddisjunction constraint handler with propagation of multi-aggregated variables
8089 - fixed bug with numerics in linear constraint handler due to non-representable `BOUNDSCALETOL`
8090 - fixed bug with almost integral multi-aggregation in dual presolve of linear constraint handler
8091 - fixed bug with numerics in update of min/maxactivity in linear constraint handler
8094 - fixed bug in intshifting and oneopt heuristic with variables which are currently not in the LP
8095 - fixed bug with primal heuristics reducing the cutoff bound such that the current node is cut off
8096 - fixed bug in oneopt heuristic: must not be called on pseudo nodes if continuous variables are present
8098@page RN09 Release notes for SCIP 0.9
8100@section RN090 SCIP 0.9.0
8101*************************
8106- the EXITSOL callback of the plugins is now called before the LP and the global cut pool are freed
8109 - new primal heuristics `rens`, `mutation` and `veclendiving`
8110 - primal heuristics that run before the node is solved now know already whether the LP will be solved at the current
8114 - new heuristic `intshifting` (ID character `i`)
8115 - in the root node of the very first run, heuristics with timing `AFTERNODELPNODE`, `AFTERLPPLUNGE`, `AFTERPSEUDONODE`, and
8116 `AFTERPSEUDOPLUNGE` are now called before the enforcement of the constraint handlers, in particular before the branching
8117 rules; in this way, the branching rule can already benefit from a tighter primal bound
8118 - if a heuristic found a better solution after the LP loop (and in particular the `AFTERNODE` heuristics in the root node
8119 of the very first run, see above), domain propagation and LP solving is triggered again; this allows for additional
8120 reduced cost tightening and other dual propagations
8121 - slightly modified `crossover` and `rins` heuristics
8122 - improved performance of intdiving heuristic
8123 - improved heuristic `octane` and `shifting`
8124 - slightly modified rens and localbranching heuristics
8125 - modified guided diving heuristic such that it equals the original version of the heuristic (i.e., round in direction of the
8126 current incumbent solution instead of the average of all primal feasible solutions)
8127 - ID character for intdiving heuristic is now `I`
8129- Separation and Cuts:
8130 - c-MIR cuts try now to scale the cut to integral values; however, cuts are still generated if this fails
8131 - hard-coded relative objective gain to consider a separation loop to be stalling is now changed from 1e-3 to 1e-4,
8132 which means that separation is not aborted as early as before
8133 - modified c-MIR cut separator to more closely resemble the original version of Marchand and Wolsey
8136 - possibility of SAT-like restarts after a number of conflict constraints have been found
8137 - improved presolving of and, or and xor constraints
8138 - implemented additional dual presolving in linear constraint handler
8139 - slightly modified presolving of varbound constraint handler
8144### New and changed callbacks
8146- new parameter `solinfeasible` for constraint handler callback methods `ENFOLP` and `ENFOPS`
8147- replaced callback parameter `inlploop` and `inplunging` by `heurtiming` in `SCIP_DECL_HEUREXEC`
8148- slightly changed the meaning of the result codes returned by external relaxators: if they modify the LP or tighten
8149 bounds of variables, they are not automatically be called again (it is assumed that they already made use of these
8150 changes). They are only called again, if they returned `SCIP_SUSPENDED` or if some other plugin modified the LP.
8152### Deleted and changed API methods
8154- new parameter `escapecommand` for SCIPdialoghdlrAddHistory()
8155- removed method SCIPgetVarData(); use SCIPvarGetData() from pub_var.h instead
8156- new calls SCIPgetLPBInvCol() and SCIPgetLPBInvACol() to access the basis inverse and simplex tableau columnwise
8157- new parameter `ndomredsfound` of SCIPpropagateProbing()
8158- new parameters `fixintegralrhs`, `maxfrac`, `mksetcoefs` and `fracnotinrange` in SCIPcalcMIR()
8159- modified SCIPfixVar() such that in problem creation stage it will change the bounds as requested even if the fixing
8160 value is outside of the current bounds
8161- replaced parameters `pseudonodes`, `duringplunging`, `duringlploop` and `afternode` by `timingmask` in
8162 SCIPincludeHeur() and constructor of ObjHeur() class use the following table to translate old settings into the new
8165| PSEUDONODES | DURINGPLUNGING | DURINGLPLOOP | AFTERNODE | timingmask |
8166|-------------|----------------|--------------|-----------|---------------------------------------------------------------|
8167| FALSE | FALSE | FALSE | FALSE | SCIP_HEURTIMING_BEFORENODE |
8168| TRUE | FALSE | FALSE | FALSE | SCIP_HEURTIMING_BEFORENODE |
8169| FALSE | TRUE | FALSE | FALSE | SCIP_HEURTIMING_BEFORENODE |
8170| TRUE | TRUE | FALSE | FALSE | SCIP_HEURTIMING_BEFORENODE |
8171| FALSE | FALSE | TRUE | FALSE | SCIP_HEURTIMING_BEFORENODE \| SCIP_HEURTIMING_DURINGLPLOOP |
8172| TRUE | FALSE | TRUE | FALSE | SCIP_HEURTIMING_BEFORENODE \| SCIP_HEURTIMING_DURINGLPLOOP |
8173| FALSE | TRUE | TRUE | FALSE | SCIP_HEURTIMING_BEFORENODE \| SCIP_HEURTIMING_DURINGLPLOOP |
8174| TRUE | TRUE | TRUE | FALSE | SCIP_HEURTIMING_BEFORENODE \| SCIP_HEURTIMING_DURINGLPLOOP |
8175| FALSE | FALSE | FALSE | TRUE | SCIP_HEURTIMING_AFTERLPPLUNGE |
8176| TRUE | FALSE | FALSE | TRUE | SCIP_HEURTIMING_AFTERPLUNGE |
8177| FALSE | TRUE | FALSE | TRUE | SCIP_HEURTIMING_AFTERLPNODE |
8178| TRUE | TRUE | FALSE | TRUE | SCIP_HEURTIMING_AFTERNODE |
8179| FALSE | FALSE | TRUE | TRUE | SCIP_HEURTIMING_AFTERLPPLUNGE \| SCIP_HEURTIMING_DURINGLPLOOP |
8180| TRUE | FALSE | TRUE | TRUE | SCIP_HEURTIMING_AFTERPLUNGE \| SCIP_HEURTIMING_DURINGLPLOOP |
8181| FALSE | TRUE | TRUE | TRUE | SCIP_HEURTIMING_AFTERLPNODE \| SCIP_HEURTIMING_DURINGLPLOOP |
8182| TRUE | TRUE | TRUE | TRUE | SCIP_HEURTIMING_AFTERNODE \| SCIP_HEURTIMING_DURINGLPLOOP |
8185 - renamed all occurences of `removeable` by the correct English word `removable`: SCIPconsIsRemovable(),
8186 SCIPsetConsRemovable(), SCIPvarIsRemovable(), SCIPcolIsRemovable(), SCIProwIsRemovable()
8187 - new parameter `sticktonode` in SCIPcreateCons(), SCIPcreateConsAnd(), SCIPcreateConsBounddisjunction(),
8188 SCIPcreateConsKnapsack(), SCIPcreateConsLinear(), SCIPcreateConsLogicor(), SCIPcreateConsOr(),
8189 SCIPcreateConsVarbound(), SCIPcreateConsXor(), SCIPcreateConsSetpart(), SCIPcreateConsSetpack(),
8190 SCIPcreateConsSetcover(): usually, you should set this to FALSE; if you want to add constraints as node markers with
8191 node data and, e.g., use the `activate` and `deactivate` callbacks to get informed about the activation and
8192 deactivation of the node, you should set this flag to TRUE in order to make sure, that the constraint will always be
8193 associated to the node and not moved to a more global node if this would be possible
8194 - slightly changed semantics of SCIPaddConsNode() and SCIPaddConsLocal(), such that a constraint which is added to the
8195 root node now enters the global problem (and is still existing after a restart)
8197### New API functions
8201- SCIPgetGlobalCutpool(), SCIPgetPoolCuts(), SCIPcutpoolGetCuts(), SCIPcutGetRow() and SCIPcutGetAge()
8202- SCIPconsGetNLocksPos() and SCIPconsGetNLocksNeg()
8204### Command line interface
8206- command shell now understands escape characters `\``,`'` and `\` which makes it possible to read in files with spaces in the
8209### Interfaces to external software
8211- updated XPress interface to XPress-MP 17 (contributed by Michael Perregaard)
8213### Changed parameters
8215- changed default value of `heuristics/octane/usediffray` to FALSE
8216- removed parameter `heuristics/octane/usediffbwray`
8217- renamed parameter `heuristics/octane/useavgray` to `heuristics/octane/useavgnbray`
8218- changed default value of `heuristics/rens/binarybounds` to TRUE
8219- changed default value of `heuristics/octane/freq` to -1 in order to deactivate Octane
8220- parameter `heuristics/feaspump/maxsols` is now strict, i.e., if n solutions were already found, the feasibility pump
8221 starts to work only if `maxsols <= n`, instead of `maxsols < n`
8225- `conflict/restartnum` and `conflict/restartfac`
8226- `heuristics/octane/useavgray`
8227- `heuristics/octane/useavgwgtray`
8228- `limits/absgap` to define an absolute gap limit
8229- `separating/cmir/aggrtol`
8230- `separating/cmir/densityscore`
8231- `separating/cmir/fixintegralrhs`
8232- `separating/maxruns`
8233- `presolving/restartminred` which forbids another restart if the last one was not successful enough
8234- `propagating/abortoncutoff`
8235- `reading/zplreader/changedir` to control behavior of path switching of ZIMPL file reader
8236- `reading/zplreader/parameters` to pass additional parameters to ZIMPL
8243- added ncurses to the readline entries in the `make/make.*` files
8244- added quotes to sed expressions in Makefile (needed under Windows)
8245- modified makefiles for Windows/Intel
8246- added automatic query script in the Makefile for soft-link names
8251- fixed bug with string pointer copy instead of string content duplication in constructors of C++ wrapper classes
8252- fixed bug in CPLEX interface with basis access methods that dualopt has to be called for more error status codes
8253- fixed bug with inserting two variable bounds of the same type on the same variable with the same bounding variable but
8254 with different sign of coefficient (e.g., `x <= 10*z + 5` and `x <= -5*z + 10`); in previous version, one of the two was
8255 removed, although both have a useful meaning; now, we keep both and detect a stronger global bound in the implication graph presolving
8256- objective function is now also checked for integrality after problem transformation (fixed a bug that a solution which
8257 was generated between transformation and presolving for an integral objective function did not reduce the cutoff bound by one)
8258- fixed a bug with cmir cut efficacy calculation (however, on my first tests, the performance reduced slightly!)
8259- fixed bug that SCIPvarGetAvgSol() always returned the upper bound (affected guided diving heuristic)
8260- fixed bug in RENS, RINS, Local Branching, Crossover and Mutation heuristics with wrong variable-subvariable assignments
8261- fixed bug in infeasible/bound-exceeding LP conflict analysis if the bounds were relaxed in diving (happens in intshifting heuristic)
8264 - fixed bug with adding constraints with `INITIAL=true` and separating them afterwards, which lead to a second addition of
8265 the constraint's relaxation in the child node
8266 - separation LPs are now immediately resolved after a bound change was generated by a cut separator; before, the
8267 separation round was prematurely aborted, which means that a separation round limit was sometimes reached very quickly
8268 and some of the separators were not even called a single time
8270- Cmir Cut Separator:
8271 - too large deltas are now also rejected in c-MIR cut separation
8272 - fixed bug in cmir cut separator, that 8*delta was not tried
8273 - fixed bug in cmir cut separator with wrong sign of slack in row score function
8274 - fixed bug in cmir cut separator with weights fixed to zero, thus making the current aggregation invalid
8275 - fixed bug in cmir cut separator with wrong calculation of cut efficacies
8277@page RN08 Release notes for SCIP 0.8
8279@section RN082 SCIP 0.8.2
8280*************************
8285- additional flag `delay` for pricers
8286- new propagator `rootredcost` which applies reduced cost fixing at the root node whenever a best new primal solution was found
8287- new separator `redcost` which replaces the internal reduced cost strengthening
8290 - extensions to the LP are kept even if the LP is not solved at the current node; however, if the LP turned out to be
8291 numerically instable, the extensions of the current node are still discarded
8292 - added removal of bound-redundant rows from the LP during root node LP solving loop
8293 - new display column `lpobj`
8296 - slightly changed priorities of constraint handlers
8297 - now, conflict constraints are also created if they were generated in strong branching or diving with insertion depth
8298 equal to the current depth
8299 - new constraint handler `bounddisjunction`
8302 - renamed `sol` file reader to `fix` file reader (reads partial solution files and fixes variables to the given values)
8303 - added `sol` file reader which reads complete solution files and adds the solutions to the solution pool
8304 - LP and MPS file readers are now able to parse lazy constraints and user cuts sections
8307 - knapsack presolver now generates cliques in the clique table (this essentially solves `neos1.mps`)
8308 - new presolver `inttobinary`
8311 - new primal heuristic `shifting`
8312 - diving heuristics abort earlier (did not come back in reasonable time on `fast0507`)
8317- new solution status code `SCIP_STATUS_STALLNODELIMIT`
8319### New and changed callbacks
8321- slightly modified semantics of the `CONSINITLP` callback in the constraint handlers
8323### Deleted and changed API methods
8325- methods SCIPisLbBetter() and SCIPisUbBetter() have an additional parameter and slightly different meaning (they now
8326 compare the bound improvement *relatively* to the width of the domain and the bound itself)
8327- SCIPgetNSols() now returns an int instead of `SCIP_Longint`
8328- method SCIPreadProb() does not call SCIPfreeTransform() anymore; file readers that want to extend the existing problem
8329 must now call SCIPfreeTransform() themselves before modifying the original problem
8330- method SCIPgetBinvarRepresentative() can now also be called in problem creation stage
8331- additional parameter `maxpricerounds` in method SCIPsolveProbingLPWithPricing()
8332- changed name of method SCIPpresolGetNVarTypes() to SCIPpresolGetNChgVarTypes()
8333- method SCIPsplitFilenames() now treats both versions of slashes, `/` and `\`, as directory delimiters (under MinGW and
8334 CygWin, both are valid; so, we cannot treat file names anymore where the other slash is used as a regular character)
8337 - marking a constraint to be `initial` now means in addition, that if the constraint is added to a local node it will
8338 enter the LP at the time the node is first processed, even if parameters forbid separation at this node
8339 - changed name of method SCIPconshdlrGetNVarTypes() to SCIPconshdlrGetNChgVarTypes()
8342 - method SCIPgetNConflictClausesFound() renamed to SCIPgetNConflictConssFound()
8343 - method SCIPgetNConflictClausesFoundNode() renamed to SCIPgetNConflictConssFoundNode()
8344 - method SCIPgetNConflictClausesApplied() renamed to SCIPgetNConflictConssApplied()
8346### New API functions
8348- SCIPsolveProbingLPWithPricing()
8349- SCIPchgVarLbRoot() and SCIPchgVarUbRoot()
8350- SCIPinRepropagation()
8351- SCIPaddDialogInputLine() and SCIPaddDialogHistoryLine()
8352- SCIPtransformProb() to create the transformed problem; enables the user, e.g., to add primal solutions before the presolving begins
8353- SCIPcreateSolCopy()
8357 - SCIPgetRowKnapsack(), SCIPgetRowLinear(), SCIPgetRowLogicor(), SCIPgetRowSetppc(), and
8358 SCIPgetRowVarbound() for obtaining the linear relaxation of a corresponding constraint
8359 - SCIPgetLhsVarbound(), SCIPgetRhsVarbound(), SCIPgetVarVarbound(), SCIPgetVbdvarVarbound(), and
8360 SCIPgetVbdcoefVarbound()
8361 - SCIPgetLPRootObjval(), SCIPgetLPRootColumnObjval() and SCIPgetLPRootLooseObjval()
8362 - SCIPcolGetMinPrimsol() and SCIPcolGetMaxPrimsol()
8363 - SCIPgetFocusDepth()
8366 - SCIPgetAvgPseudocostScore()
8367 - SCIPgetAvgPseudocostScoreCurrentRun()
8368 - SCIPgetAvgConflictScore()
8369 - SCIPgetAvgConflictScoreCurrentRun()
8370 - SCIPgetAvgInferenceScore()
8371 - SCIPgetAvgInferenceScoreCurrentRun()
8372 - SCIPgetAvgCutoffScore()
8373 - SCIPgetAvgCutoffScoreCurrentRun()
8376 - SCIPgetColRedcost()
8377 - SCIPvarGetRootRedcost()
8380 - SCIPgetNVarsAnd() and SCIPgetVarsAnd()
8381 - SCIPgetWeightsKnapsack(), SCIPgetNVarsKnapsack(), SCIPgetVarsKnapsack() and SCIPgetWeightsKnapsack()
8382 - SCIPgetNVarsLinear(), SCIPgetVarsLinear() and SCIPgetValsLinear()
8383 - SCIPgetNVarsOr() and SCIPgetVarsOr()
8384 - SCIPgetNVarsXor() and SCIPgetVarsXor()
8386### Command line interface
8388- command line syntax changed to support batch modus without piping stdin with `<` or `|` operators
8389- advanced command line syntax:
8390 - `-l <logfile> `: copy output into log file
8391 - `-q `: suppress screen messages
8392 - `-s <settings> `: load parameter settings (.set) file
8393 - `-f <problem> `: load and solve problem file
8394 - `-b <batchfile>`: load and execute dialog command batch file (can be used multiple times)
8395 - `-c <command> `: execute single line of dialog commands (can be used multiple times)
8397### Interfaces to external software
8399### Changed parameters
8401- removed parameter `propagating/redcostfreq`, because reduced cost strengthening is now an external separator plugin
8402- removed parameter `conflict/maxunfixed`
8403- parameter `conflict/maxclauses` renamed to `conflict/maxconss`
8404- parameter `conflict/interclauses` renamed to `conflict/interconss`
8405- parameter `conflict/reconvclauses` replaced by `conflict/reconvlevels`
8406- parameter `conflict/uselp` replaced by `conflict/useinflp` and `conflict/useboundlp`
8407- changed default value of `constraints/obsoleteage` to -1
8408- changed default value of `branching/relpscost/conflictweight` to 0.01
8409- changed default value of `branching/relpscost/inferenceweight` to 0.0001
8410- changed default value of `branching/relpscost/cutoffweight` to 0.0001
8411- in bfs node selector, parameter `minplungedepth` is now stronger than `maxplungedepth` if they conflict
8415- `constraints/linear/separateall`
8416- `conflict/lpiterations`
8417- `conflict/keepreprop`
8418- `branching/relpscost/conflictweight`, `branching/relpscost/inferenceweight`,
8419 `branching/relpscost/cutoffweight` and `branching/relpscost/pscostweight`
8420- `conflict/settlelocal`
8421- `conflict/depthscorefac`
8422- `limits/stallnodes`
8429- removed ncurses and pthread libraries from the Makefile; pthread is now only linked if CPLEX is used
8434- fixed numerical bug in SCIPrealToRational() [thanks to Anders Schack-Nielsen]
8435- fixed bug in crossover heuristic with negative timelimit
8436- removed bug in conflict analysis with wrong redundancy check
8437- fixed bug that unexpected end of stdin (Ctrl-D or piped-in file without `quit` command) gives a segmentation fault
8438- fixed bug with inconsistent data structures after a global bound was changed at a local subproblem and the local
8439 bounds are not contained anymore in the new global bounds
8440- fixed dependency generation in example Makefiles
8443 - fixed bug in knapsack presolving with redundancy check after applyFixings() [thanks to Anders Schack-Nielsen]
8444 - fixed bug in knapsack separator with empty initial covers
8445 - fixed bug in knapsack constraint disaggregation that may lead to acceptance of infeasible solutions
8446 - fixed bug in knapsack constraint handler where a modifiable constraint may be declared redundant
8449 - fixed bug with missing LP size updates after pricing or cut separation in probing [thanks to Marc Nuenkesser]
8450 - fixed bug in CPLEX interface with getting basis information after the LP was modified and restored
8451 - fixed bug with updating LP size in probing
8452 - fixed bug that SCIPgetLPSolstat() returns a valid status code even if the LP was not yet constructed for the current node
8455 - fixed bug with invalid lazy updates after a restart where the LP is not solved again (e.g., due to all variables being fixed)
8456 - fixed bugs resulting from inactive general integer variables being member of the variable bounds array of a variable
8457 - fixed bug in updatePseudocost() with wrong lpgain distribution on multiple branching variables [thanks to Anders Schack-Nielsen]
8458 - fixed bug in objconshdlr.h where member variable scip_maxprerounds_ was declared as an `SCIP_Bool` instead of an int
8459 - branching on nearly-integral variables is now avoided in relpscost branching, which lead to a numerical assertion
8462 - fixed bug with adding implications that fix the implication variable to the opposite value (due to the bug, it was
8463 returned that the whole problem is infeasible)
8464 - removed wrong assert in varRemoveImplicsVbs()
8467 - fixed bug in SCIPcliqueSearchVar() [thanks to Anders Schack-Nielsen]
8468 - fixed bug in SCIPcliqueAddVar() [thanks to Anders Schack-Nielsen]
8471 - fixed bug in MPS file reader with `OBJSENSE`
8472 - fixed bug in LP reader with potentially uninitialized pointers [thanks to Martin Mueller]
8475 - it is now possible to branch on constraints without the risk of going into an infinite loop, because constraints marked as `initial`
8476 will be put to the LP relaxation (of the child nodes) even if separation is prohibited by the parameter settings
8477 - fixed bug that locally valid varbound constraints produce VLB/VUB entries [thanks to Anders Schack-Nielsen]
8479@section RN081 SCIP 0.8.1
8480*************************
8485- improved performance of the priority queue in conflict analysis
8486- slightly modified restartdfs node selector
8489 - new presolver `implics` to find bound changes and aggregations out of the implication graph
8490 - modified probing order in probing presolver
8493 - changed handling of added constraints in separation calls
8494 - modified bookkeeping of locally added and disabled constraints such that the order of enabling and disabling constraints stays the same
8495 - logic or constraint handler now adds implications on clauses with 2 literals to the implication graph
8496 - and/or constraint handlers now add implications to the implication graph
8497 - xor constraint handler now uses stronger LP relaxation without auxiliary variable for xor constraint with 2 operands
8500 - added preliminary version of `intdiving` heuristic (disabled in default settings)
8501 - added crossover heuristic
8504 - LP file reader now accepts the keyword `Integer` for defining the start of the integer variables section
8505 - new file reader for (partial) solutions
8507Examples and applications
8508-------------------------
8510- added two small pricer examples (for C and C++)
8511- updated example code (s.t. it compiles again)
8516### New and changed callbacks
8518- callback method `CONSSEPA` of constraint handler was split into two methods `CONSSEPALP` and `CONSSEPASOL`
8519- callback method `SEPAEXEC` of separator was split into two methods `SEPAEXECLP` and `SEPAEXECSOL`
8521### Deleted and changed API methods
8523- replaced method SCIPsepaWasDelayed() by SCIPsepaWasLPDelayed() and SCIPsepaWasSolDelayed()
8524- additional parameter `sol` for methods SCIPaddCut(), SCIPgetCutEfficacy() and SCIPisCutEfficacious()
8525- additional parameter `sol` for method SCIPseparateKnapsackCover()
8526- primal solutions may now contain values marked to be unknown (value is `SCIP_UNKNOWN`); unknown values don't contribute
8527 to the objective value of the solution; an unknown solution value should be treated as an arbitrary value in the
8528 variable's bounds, e.g., in the calculation of the feasibility of a constraint, a value inside the variable's bounds
8529 should be selected that makes the constraint as feasible as possible
8530- new parameter `printzeros` for methods SCIPprintSol(), SCIPprintTransSol(), SCIPprintBestSol() and SCIPprintBestTransSol()
8533 - replaced method SCIPconshdlrWasSeparationDelayed() by two methods SCIPconshdlrWasLPSeparationDelayed() and
8534 SCIPconshdlrWasSolSeparationDelayed()
8535 - renamed method SCIPgetNGlobalConss() to SCIPgetNConss()
8537### New API functions
8540- SCIPgetVarConflictScore() and SCIPgetVarConflictScoreCurrentRun()
8542- SCIPcreateUnknownSol()
8543- SCIPgetNConflictClausesFoundNode()
8544- SCIPvarSetDelorigData(), SCIPvarSetTransData() and SCIPvarSetDeltransData()
8545- SCIPvarHasBinaryImplic()
8546- SCIPgetFixedVars() and SCIPgetNFixedVars()
8547- SCIPgetConss(), SCIPgetNOrigConss() and SCIPgetOrigConss()
8548- SCIPsepaGetNConssFound() and SCIPsepaGetNDomredsFound()
8549- SCIPconstructLP() to force constructing the LP of the current node
8550- SCIPisLPConstructed()
8552### Command line interface
8554- added `write statistics` command to default user dialogs
8556### Changed parameters
8558- modified meaning of parameter `presolving/probing/maxtotaluseless`
8559- heuristics with `freq = 0` and `freqofs > 0` are now called in depth level freqofs instead of being called in the root
8561- added some parameters in local branching and RINS heuristic
8562- new parameter values `p`rimal simplex and `d`ual simplex in `lp/initalgorithm` and `lp/resolvealgorithm`
8566- `branching/inference/conflictweight`
8573- included version number in binary file name
8574- tried to make the code Windows compatible
8579- also removed history_length, if `NO_REMOVE_HISTORY` is defined to support older versions of the readline library
8580- hopefully fixed bug with wrong path slash `/` under Windows
8581- fixed bug with aggregating fixed variables
8584 - fixed bug in transitive implication addition
8585 - fixed wrong assert with implications that imply a fixed variable
8586 - removed bug in implication addition
8589 - fixed bug in ZIMPL model reader with wrong chdir, if .zpl file is in current directory
8590 - fixed bug in LP file reader with signed values without space between sign and value (e.g. `+2x` instead of `+ 2x`)
8591 - fixed various bugs in LP file reader
8592 - fixed bug in LP file reader with explicit zero coefficients
8595 - fixed numerics in probing and linear constraint handler (rentacar was detected to be infeasible in presolving)
8596 - fixed numerics in check method of linear constraint handler
8597 - fixed bug with numerical error in LP resolve after probing or diving
8600 - fixed bug with calling heuristics in depths smaller than their frequency offset
8601 - fixed bugs in local branching and RINS heuristic
8606- if one uses column generation and restarts, a solution that contains variables that are only present in the
8607 transformed problem (i.e., variables that were generated by a pricer) is not pulled back into the original space
8608 correctly, since the priced variables have no original counterpart
8610@section RN080 SCIP 0.8.0
8611*************************
8616- adding variable bounds automatically adds the corresponding implication
8617- changed restart dfs nodeselector to sort leaves by node number instead of node depth to aviod jumping around in the
8618 search tree after a restart was applied and the current dive ended due to infeasibility
8619- new Message Handler plugin
8620- added file reader for LP format
8621- introduced subversion string
8622- replaced all abort() calls by SCIPABORT(); this is defined in def.h to be `assert(FALSE)`
8623- added possibility to disable certain features by using `make USRFLAGS=-DNO_REMOVE_HISTORY`, `make
8624 USRFLAGS=-DNO_SIGACTION`, `make USRFLAGS=-DNO_RAND_R`, or `make USRFLAGS=-DNO_STRTOK_R`
8625- improved preprocessing abort criteria
8629 - conflict clauses are now collected in a conflict store, redundant clauses are eliminated and only the best `conflict/maxclauses`
8630 clauses are added permanently to the problem; the remaining clauses are only added temporarily, if they can be used for repropagation
8631 - modified the influence of the depth level in conflict analysis
8632 - slightly changed LP resolving loop in conflict analysis
8633 - if CPLEX returns that the LP exceeds the bound and if no additional LP solves are allowed in conflict analysis, we
8634 have to perform one additional simplex iteration to get the dual solution that actually violates the objective limit
8637 - reactivated multiaggregation in cons_linear.c on binary variables again (possible due to bug fix below)
8638 - improved preprocessing of variable bounds constraints
8639 - linear constraint handler now catches events of variables after the problem was completely transformed in order to
8640 avoid the whole bunch of `LOCKSCHANGED` events that are generated at problem transformation stage
8641 - added redundancy detection for pairs of constraints in setppc constraint handler
8643- Presolving and Cliques:
8644 - changed linear constraint presolving s.t. redundant sides are not removed if constraint is an equality
8645 - new event type `SCIP_EVENTTYPE_PRESOLVEROUND`
8646 - modified probing presolver to not add implications that are already included in the implication graph and clique table
8647 - incorporated clique and implication information in knapsack constraint presolving
8648 - removed transitive clique generation, because this produces way too many cliques
8651 - diving heuristics now apply propagation at each step
8652 - removed `objfeaspump` heuristic, because the functionality can be achieved by using the `feaspump` heuristic
8653 - diving heuristics are now applying propagation after each bound change
8654 - new primal heuristic `octane`
8655 - slightly changed feaspump heuristic, s.t. after finding a new best solution the target integral solution is modified randomly
8657- Separation and Cuts:
8658 - improved debugging for infeasible cuts and propagations, given a primal feasible solution
8659 - improved knapsack cover separation
8660 - improved performance of c-MIR separator
8661 - cut pool is now also separated in root node (to find cuts again that were removed from the LP due to aging)
8666- new event type `SCIP_EVENTTYPE_VARDELETED`
8667- new event `SCIP_EVENTTYPE_IMPLADDED`
8668- new event types `SCIP_EVENTTYPE_GLBCHANGED` and `SCIP_EVENTTYPE_GUBCHANGED`
8670### New and changed callbacks
8672- new callback parameter `validnode` for the `CONFLICTEXEC` method of conflict handlers, which should be passed to
8675### Deleted and changed API methods
8677- additional parameter `validnode` for SCIPaddConsLocal() and SCIPaddConsNode()
8678- SCIPhashtableRemove() can now also be called, if the element does not exist in the table
8679- SCIPhashmapRemove() can now also be called, if the element does not exist in the map
8680- additional parameter `branchdir` for SCIPbranchVar()
8681- replaced method SCIPmessage() by SCIPverbMessage() with additional parameter `file`
8682- put block memory shell and tclique algorithm into separate subdirectories
8683- new parameter `duringlploop` of SCIPincludeHeur(): heuristics can now run during the price-and-cut loop at a node
8685### New API functions
8687- SCIPgetNConflictClausesApplied()
8688- SCIPgetNConflictClausesApplied()
8689- SCIPhashtableExists()
8690- SCIPhashmapExists()
8691- SCIPnodeGetNumber()
8692- SCIPsolveProbingLP() to solve the LP in a probing node (enables mixing of propagation and LP solving for diving heuristics)
8693- SCIProwGetDualfarkas()
8694- SCIPgetCurrentNode()
8695- SCIPinterruptSolve()
8696- SCIPpropagateProbingImplications()
8697- SCIPgetLPI() which makes all methods in scip/lpi.h available to the user
8698- SCIPgetRandomInt() and SCIPgetRandomReal()
8700- SCIPheurGetNBestSolsFound()
8704 - SCIPgetVarStrongbranchLPAge()
8705 - SCIPvarIsTransformedOrigvar()
8706 - SCIPvarIsDeleted()
8709 - SCIPerrorMessage()
8710 - SCIPwarningMessage()
8711 - SCIPdialogMessage()
8713 - SCIPsetMessagehdlr()
8714 - SCIPsetDefaultMessagehdlr()
8715 - SCIPgetMessagehdlr()
8716 - new file i/o methods SCIPfopen(), SCIPfclose(), SCIPfprintf(), ... that operate on the data type `SCIPFILE`; these
8717 methods automatically use zlib methods if the zlib is enabled
8720 - SCIPvarGetNCliques()
8721 - SCIPvarGetCliques()
8722 - SCIPvarsHaveCommonClique()
8723 - SCIPvarHasImplic()
8724 - SCIPcliqueGetNVars()
8725 - SCIPcliqueGetVars()
8726 - SCIPcliqueGetValues()
8729 - SCIPcalcCliquePartition()
8731- Constraint handler:
8732 - SCIPgetDualfarkasLinear() of linear constraint handler
8733 - SCIPgetDualfarkasLogicor() of logicor constraint handler
8734 - SCIPgetDualfarkasSetppc() of setppc constraint handler
8735 - SCIPgetDualsolKnapsack() of knapsack constraint handler
8736 - SCIPgetDualfarkasKnapsack() of knapsack constraint handler
8737 - SCIPgetDualsolVarbound() of varbound constraint handler
8738 - SCIPgetDualfarkasVarbound() of varbound constraint handler
8739 - SCIPconsGetValidDepth()
8740 - SCIPsetConsInitial()
8741 - SCIPsetConsSeparated()
8742 - SCIPsetConsEnforced()
8743 - SCIPsetConsChecked()
8744 - SCIPsetConsPropagated()
8745 - SCIPsetConsLocal()
8746 - SCIPsetConsDynamic()
8747 - SCIPsetConsRemoveable()
8749### Command line interface
8751- added command `write solution` to default dialog
8752- added commands `write problem` and `write transproblem` to default dialog
8754### Changed parameters
8756- additional setting `SCIP_VERBLEVEL_DIALOG` in `display/verblevel` parameter
8757- additional LP pricing setting `partial`
8758- replaced parameter `presolving/restartbdchgs` with parameters `presolving/maxrestarts` and `presolving/restartfac`
8759- replaced parameter `constraints/linear/maxpresolaggrrounds` with `constraints/linear/maxpresolpairrounds`
8760- parameters `constraints/agelimit` and `constraints/obsoleteage` now iterprete the value 0 as a dynamic setting
8761- number of fractional variables included in parameter `separating/maxstallrounds`
8763- Changed default values:
8764 - changed default values of `heuristics/∗/maxdiveavgquot` and `heuristics/∗/maxdiveavgquotnosol` to 0
8765 - changed default values of `constraints/agelimit` and `constraints/obsoleteage` to 0
8766 - changed default values of `heuristics/objpscostdiving/maxsols` and `heuristics/rootsoldiving/maxsols` to -1
8767 - changed default value of `separating/strongcg/maxroundsroot` to 20
8768 - changed default value of `separating/cmir/maxroundsroot` to 10
8769 - changed default value of `constraints/linear/maxaggrnormscale` to 0.0, which means to not apply aggregation
8770 - changed default value of `separating/maxstallrounds` to 5
8771 - changed default value of `presolving/probing/maxfixings` to 50
8772 - changed default parameter values to MIP settings:
8773 + `conflict/useprop` = FALSE
8774 + `conflict/usepseudo` = FALSE
8775 + `display/verblevel` = 4
8776 + `separating/poolfreq` = 0
8777 + `constraints/linear/sepafreq` = 0
8778 + `constraints/and/sepafreq` = 0
8779 + `constraints/conjunction/sepafreq` = 0
8780 + `constraints/knapsack/sepafreq` = 0
8781 + `constraints/knapsack/sepacardfreq` = 0
8782 + `constraints/logicor/sepafreq` = 0
8783 + `constraints/or/sepafreq` = 0
8784 + `constraints/setppc/sepafreq` = 0
8785 + `constraints/varbound/sepafreq` = 0
8786 + `constraints/xor/sepafreq` = 0
8787 + `separating/clique/freq` = 0
8788 + `separating/cmir/freq` = 0
8789 + `separating/gomory/freq` = 0
8790 + `separating/impliedbounds/freq` = 0
8791 + `separating/strongcg/freq` = 0
8795- `branching/fullstrong/reevalage`
8796- `conflict/maxclauses`
8797- `conflict/allowlocal`
8798- `constraints/knapsack/disaggregation`
8799- `presolving/probing/maxtotaluseless`
8800- `separating/cmir/maxfails`, `separating/cmir/maxfailsroot` and `separating/cmir/trynegscaling`
8804- MAJOR CHANGE: preceeded all data types with `SCIP_`: you may use shell script reptypes_scip.sh to rename the SCIP
8805 data types in your own source code (But use with care! Create a backup copy of your source first!)
8812- modified the Makefile to accept an additional parameter `VERBOSE={true,false}`
8813- added flags `READLINE=true/false`, `ZLIB=true/false`, `ZIMPL=true/false` to Makefile
8818- fixed minor bugs in debug code of primal.c and sol.c
8819- variables that are being multiaggregated are now automatically removed from all other variables' variable bound and
8820 implication arrays; this fixes bugs with methods, that rely on the fact, that the entries in the variable bound and
8821 implication arrays are active variables only
8822- aggregations are now always performed in a way, such that the variable of more general type is aggregated (with type
8823 generality being cont > implint > int > bin); in this way, a binary variable's representant is always binary (which
8824 was not the case before and resulted in a bug in SCIPgetBinvarRepresentative())
8825- removed bug in presol_probing.c: the vars of the sorted variables array have to be captured
8826- fixed bug in the output of solutions with priced variables
8827- fixed bug in propagation with parameters prop_maxrounds and prop_maxroundsroot
8828- conflict analysis can now handle errors in LP solving calls
8829- removed bug in SCIPvarAddVlb() and SCIPvarAddVub() with fractional vlb/vubcoefs
8830- fixed bug that primal or dual rays might not be available because the wrong solver was used
8831- included message.o in LPI library, s.t. one can link this library indepentent of SCIP
8832- fixed bug that if diving heuristic that changes the objective values finds a solution, the cutoff is reinstalled in
8833 the LP solver (although the objective value has no meaning due to the objective function modification)
8836 - LP primal feasibility for bounds is now defined as absolute measure (was relative to the bound before); this fixes a bug (see alu8_9.mps),
8837 that an LP with an integral variable fixed to a large value yields an accepted solution with that variable slightly different than the fixed
8838 value; the integrality feasibility condition is measured with absolute differences, which leads to the fixed integer variable being fractional;
8839 this leads to an error if branching is performed on this variable
8840 - fixed bug with redundant self implications that wrongly lead to the detection of infeasibility
8841 - fixed bug with potential infinite loop if a separator is delayed and the LP is infeasible
8844 - removed wrong asserts from lpi_cpx.c
8845 - removed wrong assertion in varAddImplic()
8848 - locally fixed variables are no longer used as branching candidates even if their LP solution value is fractional (due
8849 to numerical reasons, see above)
8850 - fixed numerical bug in pseudo objective propagator with only slightly tightened bounds
8851 - removed bug that an LP might be declared to be solved even if it was marked erroneous due to numerical problems
8853- Constraint Handlers:
8854 - fixed bug in linear constraint handler with variables fixed to infinity
8855 - fixed bug with constraint handlers that can only enforce their constraints by adding cuts, but the maximal number of
8856 cuts to separate is set to 0; now, cuts that are generated in the constraint enforcement are used in any case
8857 - fixed bug in knapsack constraint presolving with tightening coefficients and capacity
8858 - fixed bug with modifiable constraints in linear constraint handler preprocessing
8859 - fixed bug in linear constraint handler that global activities are not updated after global bound changes
8861- Separation and Cuts:
8862 - global bound changes now lead to the removal of redundant implications (such that the asserts in sepa_implbounds.c are now correct)
8863 - due to usage of variable bounds, SCIPcalcMIR() may return LOOSE variables in the cut -> modified sepa_cmir.c, sepa_gomory.c and
8864 sepa_strongcg.c to use SCIPcreateEmptyRow() and SCIPaddVarsToRow() instead of SCIPcreateRow() which only works for COLs
8865 - fixed bug in clique separator that reduced performance
8866 - increased performance of clique separator by allowing only a certain number of zero-weighted fill ins
8868@page RN07 Release notes for SCIP 0.7
8870@section RN079 SCIP 0.7.9
8871*************************
8876- aging and cleanup now only remove non-basic columns and basic rows, s.t. resolving can be applied with 0 simplex iterations
8877- it is now possible to create subnodes in probing and use backtracking to undo probing changes
8878- bounds of variables are included in the feasibility checks for solutions
8879- support for barrier algorithm
8880- changed implementation of automatic minplungedepth and maxplungedepth calculation in bfs node selector
8883 - new plugin: probing presolver
8884 - probing is now also possible in presolving stage
8885 - it is now possible to interrupt and continue presolving
8887- Separation and Cuts:
8888 - new plugin: clique separator for clique cuts with at least 3 elements
8889 - new plugin: implied bound cuts separator
8890 - included debugging module to check whether cutting planes cut off the optimal solution
8893 - changed implementation of reliability value calculation in reliability branching; slightly modified influence of
8894 maximal total number of strong branching LP iterations in reliability branching
8895 - changed implementation of maximal strong branching iterations calculation in reliability branching
8898 - if verblevel is at least `NORMAL`, an automatical check of the best solution is performed in the original problem, and
8899 an error message is displayed, if it violates an original constraint
8900 - due to the new constraint handler `cons_cumulative.{c,h}` SCIP can resource-constraint scheduling problem
8901 - during probing, propagation of bounds is now always performed in linear constraint handler, ignoring the parameter `tightenboundsfreq`
8902 - new implementation of the clique graph construction method in clique separator
8903 - new constraint handler `cons_cumulative.{c,h}`
8906 - new implementation of the feasibility pump heuristic by Timo Berthold (replaces old implementation); old
8907 implementation is now called `objfeaspump`; parameter names have been changed accordingly
8908 - diving heuristics now compare their number of LP iterations with the number of node LP iterations instead of the total
8909 number (including their own) LP iterations
8910 - modified the automatic objfactor setting of feaspump heuristic to let the objective function have stronger influence
8912Examples and applications
8913-------------------------
8915- added TSP example in `examples/TSP`
8920### New and changed callbacks
8922- new callback methods `INITSOL` and `EXITSOL` for variable pricers, primal heuristics, conflict handlers, relaxators,
8923 separators, propagators, event handlers, node selectors and display columns
8924- callback method `CONFLICTEXEC` of conflict handlers receive additional parameters `dynamic` and `removeable`
8925- constraint handler callback methods `CONSLOCK` and `CONSUNLOCK` are replaced by a single method `CONSLOCK` with the number
8926 of locks being positive or negative
8928### Deleted and changed API methods
8930- calling SCIPaddCut() with `forcecut=TRUE` will add the cut to the LP even if it is redundant
8931- SCIPreadProb() does not free the current problem, this is done in SCIPcreateProb() now, which is usually
8932 called by a problem reader; in this way, a reader can generate `extra information` for the current problem, s.t. the
8933 full problem information can be distributed to different files read by different readers
8934- SCIPgetVarStrongbranch() and SCIPgetVarStrongbranchLast() now have two additional parameters that can be used
8935 to check, whether the returned values are correct dual bounds
8936- SCIPgetBinvarRepresentative() now returns the fixed or multi-aggregated variable instead of returning `NULL` or
8937 aborting with an error message
8938- SCIPdispDecimal() is replaced by SCIPdispInt() and SCIPdispLongint()
8939- additional parameter `maxproprounds` in SCIPpropagateProbing()
8940- changed memory interface (see memory.h), `MEMHDR` is now called `BLKMEM`
8941- source code was moved into subdirectories: replace includes `scip.h` by `scip/scip.h` and
8942 `objscip.h` by `objscip/objscip.h`; This should allow a user to have include files of the same name as the ones
8943 of SCIP, e.g. `tree.h` or `var.h`.
8944- event handlers are now available as C++ wrapper class
8945- new flag `afterrelaxation` for primal heuristics
8948 - removed method SCIPsolGetObj(), use SCIPgetSolOrigObj() or SCIPgetSolTransObj() instead
8949 - additional parameter `checkbounds` for SCIPtrySol(), SCIPtrySolFree(), SCIPcheckSol()
8952 - SCIPvarLock(), SCIPvarLockDown(), SCIPvarLockUp(), SCIPvarLockBoth(), SCIPvarUnlock(), SCIPvarUnlockDown(),
8953 SCIPvarUnlockUp() and SCIPvarUnlockBoth() are replaced by SCIPaddVarLocks() which returns a `RETCODE`
8954 - SCIPvarGetLbGlobal(), SCIPvarGetUbGlobal(), SCIPvarGetLbLocal() and SCIPvarGetUbLocal() now return the
8955 corresponding values of the transformed problem or current subproblem even for original problem variables
8956 - SCIPvarGetProbvar(), SCIPvarGetProbvarBinary() now return the fixed or multi-aggregated variable instead of
8957 returning `NULL` or aborting with an error message; in SCIPvarGetProbvarBinary(), the fixing of a fixed variable does
8958 not influence the negation status anymore
8959 - SCIPvarGetProbvarBound() returns the multi-aggregated variable instead of aborting with an error message
8960 - SCIPvarGetProbvarSum() does not set *var to `NULL` for fixed variables anymore; it may also return a
8961 multi-aggregated variable instead of aborting with an error message
8962 - SCIPaddVarImplication() now also adds variable lower and upper bounds, if the implied variable is non-binary
8963 - additional parameter `aggregated` in SCIPmultiaggregateVars()
8966 - SCIPvarLockDownCons(), SCIPvarLockUpCons(), SCIPvarUnlockDownCons() and SCIPvarUnlockUpCons() are replaced by
8967 SCIPlockVarCons() and SCIPunlockVarCons() which return a `RETCODE`
8968 - SCIPlockConsVars() and SCIPunlockConsVars() replaced with method SCIPaddConsLocks()
8969 - SCIPconshdlrGetNConss() is replaced by SCIPconshdlrGetNActiveConss() (returning the number of active
8970 constraints); method SCIPconshdlrGetNConss() does now return the total number of existing constraints, active and inactive
8971 - SCIPconshdlrGetStartNConss() is now called SCIPconshdlrGetStartNActiveConss()
8972 - SCIPconshdlrGetMaxNConss() is now called SCIPconshdlrGetMaxNActiveConss()
8973 - SCIPdisableConsNode() is replaced by SCIPdelConsNode()
8974 - SCIPdisableConsLocal() is replaced by SCIPdelConsLocal()
8975 - added new parameter `dynamic` to SCIPcreateCons() and all plugin methods SCIPcreateCons...()
8977### New API functions
8980- SCIPcreateOrigSol()
8981- SCIPwriteImplicationConflictGraph()
8984- SCIPgetVarNStrongbranchs()
8985- SCIPcolGetNStrongbranchs()
8986- SCIPfindSimpleRational()
8987- SCIPselectSimpleValue()
8990 - SCIPvarGetLbOriginal()
8991 - SCIPvarGetUbOriginal()
8992 - SCIPvarGetImplIds()
8993 - SCIPvarGetOrigvarSum()
8998 - SCIPenableConsSeparation()
8999 - SCIPdisableConsSeparation()
9000 - SCIPconsIsSeparationEnabled()
9003 - SCIPgetAvgPseudocost()
9004 - SCIPgetAvgPseudocostCurrentRun()
9005 - SCIPgetAvgPseudocostCount()
9006 - SCIPgetAvgPseudocostCountCurrentRun()
9007 - SCIPgetAvgInferences()
9008 - SCIPgetAvgInferencesCurrentRun()
9009 - SCIPgetAvgCutoffs()
9010 - SCIPgetAvgCutoffsCurrentRun()
9013 - SCIPisLPSolBasic() to check, whether the current LP solution is basic (i.e. due to a simplex algorithm or barrier with crossover)
9014 - SCIPgetNPrimalLPs()
9015 - SCIPgetNPrimalLPIterations()
9017 - SCIPgetNDualLPIterations()
9018 - SCIPgetNBarrierLPs()
9019 - SCIPgetNBarrierLPIterations()
9020 - SCIPgetNPrimalResolveLPs()
9021 - SCIPgetNPrimalResolveLPIterations()
9022 - SCIPgetNDualResolveLPs()
9023 - SCIPgetNDualResolveLPIterations()
9026 - SCIPsepaIsDelayed()
9027 - SCIPsepaWasDelayed()
9028 - SCIPpropIsDelayed()
9029 - SCIPpropWasDelayed()
9030 - SCIPpresolIsDelayed()
9031 - SCIPpresolWasDelayed()
9032 - SCIPconshdlrIsSeparationDelayed()
9033 - SCIPconshdlrIsPropagationDelayed()
9034 - SCIPconshdlrIsPresolvingDelayed()
9035 - SCIPconshdlrWasSeparationDelayed()
9036 - SCIPconshdlrWasPropagationDelayed()
9037 - SCIPconshdlrWasPresolvingDelayed()
9039### Command line interface
9041- command line history in interactive shell now only stores useful commands
9043### Interfaces to external software
9045- removed storing of dual norms in LPI state of CPLEX interface (too memory consuming)
9047### Changed parameters
9049- default frequency offset of fracdiving heuristic changed to 3
9050- default frequency offset of (new) feaspump heuristic changed to 0
9051- default frequency offset of objfeaspump heuristic changed to 8
9052- changed default priority of primal heuristics
9053- renamed parameter `limits/sol` to `limits/solutions`
9054- changed default check priority of knapsack constraint handler to -600000
9055- changed default priority of Gomory cut separator to -1000 (will now be called after constraint handlers!)
9056- changed default priority of strong CG cut separator to -2000
9057- changed default priority of cmir cut separator to -3000
9058- changed default of parameter `lp/pricing` to `s`teepest edge pricing
9059- default parameter `branching/relpscost/minreliable` changed to 1.0
9060- default parameter `branching/relpscost/maxlookahead` changed to 8
9061- default parameter `branching/relpscost/sbiterofs` changed to 100000
9062- default parameter `heuristics/coefdiving/maxlpiterquot` changed to 0.05
9063- default parameter `heuristics/fracdiving/maxlpiterquot` changed to 0.05
9064- default parameter `heuristics/guideddiving/maxlpiterquot` changed to 0.05
9065- default parameter `heuristics/linesearchdiving/maxlpiterquot` changed to 0.05
9066- default parameter `heuristics/pscostdiving/maxlpiterquot` changed to 0.05
9067- default parameter `heuristics/feaspump/freq` changed to 20
9068- default parameter `heuristics/objfeaspump/freq` changed to 20
9069- default parameter `heuristics/objpscostdiving/freq` changed to 20
9070- default parameter `heuristics/rootsoldiving/freq` changed to 20
9071- default parameter `separating/clique/maxtreenodes` changed to -1
9075- new parameter delay for presolvers
9076- new parameter delaypresol for constraint handlers
9077- `branching/scorefunc`
9078- `constraints/.../delaypresol`
9079- `constraints/.../delayprop`
9080- `constraints/.../delaysepa`
9082- `conflict/removeable`
9083- `heuristics/coefdiving/maxlpiterofs`
9084- `heuristics/feaspump/maxlpiterofs`
9085- `heuristics/feaspump/maxsols`
9086- `heuristics/fracdiving/maxlpiterofs`
9087- `heuristics/guideddiving/maxlpiterofs`
9088- `heuristics/linesearchdiving/maxlpiterofs`
9089- `heuristics/objfeaspump/maxlpiterofs`
9090- `heuristics/objfeaspump/maxsols`
9091- `heuristics/objpscostdiving/maxlpiterofs`
9092- `heuristics/objpscostdiving/maxsols`
9093- `heuristics/pscostdiving/maxlpiterofs`
9094- `heuristics/rootsoldiving/maxlpiterofs`
9095- `heuristics/rootsoldiving/maxsols`
9096- `heuristics/fixandinfer/proprounds` and `heuristics/fixandinfer/minfixings`
9097- `lp/cleanupcolsroot` and `lp/cleanuprowsroot` to distinguish cleanup settings between root node and other nodes
9098- `lp/checkstability` to disable stability check of LP solver's result code
9099- `lp/initalgorithm` and `lp/resolvealgorithm` for switching between simplex and barrier algorithm
9100- `lp/pricing` to set the pricing strategy used in the LP solver
9101- `numerics/barrierconvtol` to set the convergence tolerance in the barrier algorithm
9102- `presolving/.../delay`
9103- `propagating/.../delay`
9104- `reading/cnfreader/dynamicconss`
9105- `reading/mpsreader/dynamicconss`
9106- `separating/.../delay`
9110- new possible result `SCIP_DELAYED` for `EXEC` method of separators, presolvers and propagators and `SEPA`, `PROP` and
9111 `PRESOL` methods of constraint handlers
9116- fixed bug in MPS file reader
9117- removed bug with applying reduced cost strengthening before pricing in all necessary variables
9118- negated variables must also be reset in SCIPvarInitSolve()
9119- fixed documentation of `CONSLOCK`-method (missing parameter `scip` in SCIPaddVarLocks())
9120- included missing `objrelax.h` in includes of objscip.h
9121- fixed bug that after a resolve and further preprocessing, existing primal solutions may get corrupted due to
9122 aggregations or fixings that are possible due to the primal bound (given by the best solution)
9123- fixed bug with primal bound becoming wrong, if in a prior run the optimal solution was found and the cutoff bound was
9124 thereby reduced due to further domain propagation w.r.t. the objective function
9125- fixed bug in SCIPisObjIntegral()
9126- fixed bug in SCIPprintError() with `file == NULL`
9127- heuristic's display character is now only shown the first time, the new solution was found
9128- fixed bug that SCIPreadProb() doesn't discard the transformed problem
9129- fixed bug with wrong euclidean norm calculation of row, if multiple coefficients for the same variable are added and
9130 the sorting of the row was delayed with SCIProwDelaySort()
9131- fixed bug with adding implications: wrong insertion position, if only the lower bound change was present but not the
9133- fixed bug in SCIPvarAddImplics() with wrong variable used in varAdjustBd()
9134- fixed bug in method reduced() of tclique_branch.c with sorting nodes in V
9137 - removed bug with objective norm calculation and column variables not in the LP (pricing)
9138 - LP error on forced LP resolve (due to 0 unfixed integers) now leads to an error (instead of accepting the pseudo
9139 solution as feasible)
9140 - fixed bug in CPLEX LP interface with dual norms
9143 - fixed bug that presolving time is not counted to solving time, if presolving is called explicitly with SCIPpresolve()
9144 - fixed bug where presolving fixings are counted even if the variable was already fixed
9145 - removed bug with dual presolver, that declared a problem to be unbounded or infeasible, if it could fix a variable to
9146 infinity even if its objective value is zero
9147 - fixed bug in knapsack constraint handler that fixed variables are sometimes not removed in presolving
9150 - fixed bug with unresolved numerical troubles in LP that don't render the LP useless at the current node
9151 - fixed numerical bugs in rounding heuristic and rootsoldiving heuristic
9154 - fixed bugs in separation store with single coefficient cuts that are converted into bound changes
9155 - at least one cut per separation round is added to the LP to avoid cycling, even if the cut is redundant
9156 - fixed bug in SCIProwCalcIntegralScalar() with rows consisting of only continuous variables (appeared in gomory cut
9157 separator on miplib/dcmulti.mps)
9158 - fixed bug in linear constraint handler's knapsack relaxation separator
9159 - fixed bugs in intobj separator
9160 - fixed bug in cmir separator with empty rows
9161 - fixed bug in implied bound cut separator: only implications between binary variables were generated before
9163- Constraint Handlers:
9164 - removed bug in knapsack constraint handler with merging multiple items if more than two items of the same variable
9165 appear in the constraint
9166 - removed bug in knapsack constraint handler with merging negated variables of equal weight at the end of the variables' array
9167 - fixed bug in linear constraint handler with eventdatas, if the original constraint has no variables
9168 - fixed bug that `CONSLOCK` method of constraint handlers that don't need constraints is not called
9169 - fixeg bug in setppc constraint handler with pairs of aggregated variables in the same constraint
9170 - fixed bug with globally deleting constraints, that have attached rows which are therefore not released in exitsol methods
9173 - removed conflict analysis of infeasible diving LP if pricing is activated
9174 - made conflict analysis available in presolving stage (for probing conflicts)
9176@section RN078 SCIP 0.7.8
9177*************************
9182- changed SCIProwCalcIntegralScalar() to a slightly different algorithm
9183- improved knapsack relaxation in linear constraint handler separator to scale the constraint in order to get integral
9184 coefficients instead of just rounding down all coefficients
9185- improved presolving of linear constraint handler: aggregation of two constraints with equal coefficient vector into
9187- improved presolving of knapsack constraint handler: aggregation of equal or negated variables in same constraint
9190 + priority of separators, propagators and presolvers decide whether the plugin is called before the corresponding
9191 constraint handler methods or after: plugins with nonnegative priorities are called before, plugins with negative
9192 priorities are called after the constraint handlers
9193 + new plugin class for relaxators (external relaxations, that can be used in parallel with LP relaxations)
9194 + if more than one result code applies to a plugin's execution, it should return the one that is higher in the call's
9200- even in optimized mode, the simple functions that are implemented as defines in the include files exist in the
9201 library, s.t. one can include the include files without `NDEBUG` and use the optimized library
9203### New and changed callbacks
9205- new branching rule plugin methods `INITSOL` and `EXITSOL`
9207### Deleted and changed API methods
9209- removed SCIPisFeasible(); use !SCIPisFeasNegative() instead
9210- SCIPisIntegral(), SCIPisFracIntegral(), SCIPfloor(), SCIPceil() and SCIPfrac() don't use the feasibility
9211 tolerance anymore (default: 1e-06); instead, they are using epsilon (default: 1e-09); instead, for handling
9212 integrality of a variable `in feasibility tolerances`, new methods SCIPisFeasIntegral(), SCIPisFeasFracIntegral(),
9213 SCIPfeasFloor(), SCIPfeasCeil() and SCIPfeasFrac() should be used
9214- in LPI, the semantics of SCIPlpiHasPrimalRay() and SCIPlpiHasDualRay() changed: methods return TRUE, if a ray exists
9215 and the solver can return it; new methods SCIPlpiExistsPrimalRay() and SCIPlpiExistsDualRay() check whether a ray
9216 exists without checking, if the solver knows and can return the ray
9218### New API functions
9221- SCIPgetLPColumnObjval() and SCIPgetLPLooseObjval()
9222- SCIPcalcIntegralScalar() with arbitrary array of Real values
9223- SCIPaddCoefKnapsack() in knapsack constraint handler
9224- SCIPisScalingIntegral() to check, whether the scaling of a value would lead to an integral value, measured
9225 against epsilon which is also scaled by the same scalar
9226- SCIPgetRealarrayMinIdx(), SCIPgetRealarrayMaxIdx(), SCIPgetIntarrayMinIdx(), SCIPgetIntarrayMaxIdx(),
9227 SCIPgetBoolarrayMinIdx(), SCIPgetBoolarrayMaxIdx(), SCIPgetPtrarrayMinIdx() and SCIPgetPtrarrayMaxIdx()
9228- SCIPbsortPtrInt() and SCIPbsortPtrIntInt()
9229- SCIPvarWasFixedAtIndex()
9230- SCIPaddConflictBd()
9231- SCIPprintMemoryDiagnostic()
9232- SCIPfindObj...() and SCIPgetObj...() in C++ wrapper interface to get the corresponding plugin object
9234### Changed parameters
9236- slightly changed the meaning of parameter `presolving/abortfac` a value of 0 now means to abort presolving only after
9237 no more change has been found
9242- assigning a value to a fixed variable in a solution with SCIPsetSolVal() does not return an error anymore, if the
9243 value is equal to the fixed value of the variable
9244- removed bug in SCIPisScalingIntegral()
9245- removed bugs with calling SCIPtightenVarLb(), SCIPtightenVarUb(), SCIPinferVarLbCons(), SCIPinferVarUbCons(),
9246 SCIPinferVarLbProp() and SCIPinferVarUbProp() in `PROBLEM` stage
9249 - solving loop is now immediately aborted, if a node on the active path is marked to be cut off
9250 - removed bug in resolving an interrupted problem, after the last solved node was cut off
9251 - removed bug with infinite solving loop if LP solving is turned off
9252 - removed bug with aborted solving in root node (e.g. due to time limit) that is tagged to be restarted
9255 - fixed bug in all-fullstrong branching with getting strong branching information for columns not in current LP
9256 - implemented missing case in solve.c with branching rules that add constraints
9259 - changed numerics for integrality check of coefficients (fixed bug with accumulated errors in rows s.t. the row's
9260 activity is no longer integral although the row is marked being integer)
9261 - slightly changed numerics in linear constraint handler presolving to fix a bug with coefficients detected to be scaled
9262 to an integral value, that are not integral after scaling due to a large scalar that increased the integrality gap to
9263 a value larger than epsilon
9265- Constraint handlers:
9266 - fixed bugs in consdataSwitchWatchedVars() of `or` and `and` constraint handlers
9267 - fixed wrong assertion in xor constraint handler with switching both watched variables to unwatched
9268 - fixed bugs in constraint handlers (and, logicor, or, setppc, xor) with calling conflict analysis during presolving
9269 - removed bug in knapsack constraint handler that appears if a variable is fixed to zero in knapsack presolving, which
9270 triggers a variable of the same knapsack to be fixed to one due to aggregation
9273 - removed bug in knapsack presolver
9274 - fixed bug in presolving with wrong number of newly fixed/aggregated/... variables/bounds/... after a restart
9276@section RN077 SCIP 0.7.7
9277*************************
9282- infeasible LPs in diving now produce conflict clauses (if LP conflict analysis is enabled)
9283- conflict analysis was slightly modified
9284- slightly changed aging strategy of logic or constraint handler
9289### Deleted and changed API methods
9291- method SCIPgetGap() and SCIPgetTransGap() now return infinity, if primal and dual bound have opposite sign (this
9292 removes the oddness with the gap increasing while the dual bound approaches zero)
9294### New API functions
9296- added methods SCIPgetVarsLogicor() and SCIPgetNVarsLogicor() in logic or constraint handler
9298### Changed parameters
9300- `lp/colagelimit` and `lp/rowagelimit` may now be set to -1 to disable deletion of columns/rows due to aging
9307- the file names in the archive file are now preceeded with a directory `scip-<version>/`
9308- the compiler is now also represented in the LP solver library names (e.g. you have to rename the softlink
9309 `libcplex.linux.x86.a` to `libcplex.linux.x86.gnu.a`)
9314- removed bug in conflict analysis that appears if the conflict is only active at the current depth level
9315- missing SCIPlpiIsPrimalFeasible() and SCIPlpiIsDualFeasible() implemented in lpi_spx.cpp and lpi_spx121.cpp
9316- removed preprocessing of linear constraint pairs with modifiable constraints
9319 - removed wrong assert `assert(eventfilter->len == 0 || eventfilter->eventmask != 0x00000000)` from event.c
9320 - removed wrong assert in conflict analysis (appeared on analyzing diving LP conflicts with both bounds of a non-binary variable changed)
9322@section RN076 SCIP 0.7.6
9323*************************
9328- creation of reconvergence clauses in conflict analysis
9329- first node of each plunging is not treated as plunging node w.r.t. calling primal heuristics
9330- improved performance of logic or constraint handler due to better watched variables handling
9335### Deleted and changed API methods
9337- changed SCIPcatchVarEvent() and SCIPdropVarEvent()
9338- SCIPstage() is now called SCIPgetStage()
9339- SCIPprintStatus() is now called SCIPprintStage()
9341### New API functions
9343- SCIPgetActivityLinear() in linear constraint handler
9344- SCIPgetFeasibilityLinear() in linear constraint handler
9345- SCIPchgVarBranchDirection()
9346- SCIPvarGetBranchDirection()
9347- SCIPgetStatus() returns the solution status
9348- SCIPprintStatus() outputs the solution status (beware, that the old SCIPprintStatus() method is now called SCIPprintStage())
9350### Changed parameters
9352- changed default frequency offset of pscostdiving `heuristics/pscostdiving/freqofs` to 2 and frequency offset of fracdiving
9353 `heuristics/feaspump/freqofs` to 0 in order to not call pscostdiving in root node, where nearly all pseudo costs are uninitialized.
9357- new parameter `separating/efficacynorm` to choose between Euclidean, maximum, sum and discrete norm in efficacy
9362- new possible result code `SCIP_DELAYED` for primal heuristics
9367- removed bugs in CLP Solver interface
9368- SCIP returned `gap limit reached` even if the problem was solved to optimality, if the optimal solution was found at a
9369 node with lower bound equal to the global lower bound
9370- after conversion of the focus node into a junction (e.g. in case of numerical troubles while solving the node's LP), the child
9371 nodes got the wrong LP fork attached (the common LP fork of the old and new focus node instead of the old focus node's LP fork)
9374 - bug reconvergence clauses in conflict analysis if bounds on non-binary variables were the reason for the fixing of the
9375 uip to create a reconvergence clause for
9376 - wrong sub calls in SCIPvarGet...CurrentRun() for aggregated variables
9377 - variables' conflict set counter was not reset when the problem was resolved again
9382- unbounded models lead to an error
9383- air04 and air05 return wrong optimal value (1 too large): possibly due to strong branching or setppc propagation?
9385@section RN075 SCIP 0.7.5
9386*************************
9391- started change log*/