timing/rareclockcheck
parametertiming/statistictiming
SCIP_STAGE_PRESOLVED
stage, which is not allowed since it calls SCIPchgVarLb/Ub()heuristics/proximity/minimprove
to 0.02; previous value was 0.25heuristics/proximity/usefinallp
to FALSEtiming/rareclockcheck
to call the system time less frequently, based on the current average time interval between two calls to SCIPsolveIsStopped(); the default value is FALSEtiming/statistictiming
to enable/disable all timers for statistic output of SCIP; the default value is TRUESCIP_MATRIX
PRESOLTIMING
flags#
in variable names in old non-linear CIP format (i.e., names without <
and >
)SCIP_Longint
branching/clamp
into account42856.
in lp-format>=1
indicator constraints in LP-fileslp/disablecutoff
to TRUE)SCIP_DIGRAPH
SCIP_SPARSESOLUTION
), see pub_misc.hlp/checkdualfeas
)cloud branching
that considers several alternative LP optimaaddflowextended/addextendedform
)reading/dynamic{conss|cols|rows}
and reading/initialconss
into accountproximity
, which solves a problem in which a local branching constraint replaces the objective function which in turn is treated as additional constraintSCIP_VERBLEVEL_FULL
, the number of non-zeros will be output for the original and presolved modelmisc/calcintegral
Root Node
in statistics, listing objective value, iterations and solving time for the first LP solved at the root node as well as final dual bound of the root node and LP iterations for processing the root node (those where listed in the Solutions
section before, named Root Dual Bound
and Root Iterations
)lp/checkprimfeas
and lp/checkdualfeas
)nmarkedconss
to SCIP_DECL_CONSPROP() callback which gives the number of constraints marked for propagation (these constraints are listed first in the conss array given as parameter).nodeinfeasible
to SCIP_DECL_HEUREXEC() callback which states whether the current subproblem was already detected to be infeasible. In this case, the current LP solution might not respect local bounds and the heuristic must not assume that it does.stopearly
to callback method SCIP_DECL_PRICERREDCOST(). This boolean pointer should be used by the pricer to state whether early branching should be performed, even if new variables were added in the current pricing round.SCIP_DIDNOTFIND
for SCIP_DECL_BRANCHEXECLP(), SCIP_DECL_BRANCHEXECPS(), and SCIP_DECL_BRANCHEXECEXT() callbacks to state that the branching rule searched, but did not find a branching.nfracimplvars
to SCIPgetLPBranchCands()sidetypes
to SCIPcalcMIR() to specify the specify row side type to be used.cutrank
to SCIPcalcMIR() and SCIPcalcStrongCG() which stores the rank of the returned cut; via SCIProwChgRank() the rank of a cut can be changed (default rank is 0)infeasible
to SCIPaddCut() which is a pointer to store whether the cut is infeasible for the local bounds.normtype
from function SCIPcomputeLPRelIntPoint()lazyconss
to SCIPwriteMIP() to swith writing removable rows as lazy constraints.enablepropagation
to SCIPstartStrongbranch(), which can be used to enable strong branching with domain propagation.propagate
to enable or disable propagation support for strong branchingendptr
to SCIPparseVar() which stores the final string position after parsing.SCIP_SOL
(in original space) in debug.cSCIP_QUEUE
data structure in pub_misc.h to handle a (circular) queue, e.g., SCIPqueueCreate(), SCIPqueueFree(), SCIPqueueInsert(), SCIPqueueRemove(), SCIPqueueFirst(), SCIPqueueIsEmpty(), SCIPqueueNElems()cutoff
to SCIPsolveDiveLP(), SCIPsolveProbingLP(), and SCIPsolveProbingLPWithPricing() which is a pointer to store whether the diving/probing LP was infeasible or the objective limit was reached.bufferMessage
now handleMessage) has been rewritten: it now does not need a copy of the string to be output anymore, which makes the code much simpler (and also faster); it is passed a function pointer to the output function and uses it to directly output the (buffered) messagesmsglength
from callback method SCIP_DECL_ERRORPRINTING().endline
to SCIPprintDisplayLine() to switch printing a newline symbol at the end of the line.LPS=spx2
interfaces/check/testset/SOS/sos?a.mod
for example)interfaces/jni
branching/scorefunction
has new value q
for for q
uotient branching score functionlp/checkfeas
by two parameters lp/checkprimfeas
and lp/checkdualfeas
to decide on primal and dual feasibility checks individuallyreading/(READER)/dynamic{conss|cols|rows}
and replaced them by global parameters reading/dynamic{conss|cols|rows}
numerics/dualfeastol
to 1e-7 for safer dual bounds from LP solverheuristics/shiftandpropagate/sortkey
for sorting variables w.r.t. their norm, default changed from u
to v
, which means sorting downwards by violationsconstraints/bivariate/scaling
, constraints/quadratic/scaling
, constraints/soc/scaling
from boolean to characterconstraints/{abspower,bivariate,nonlinear,quadratic,soc}/scaling
to offseparating/gomory/maxrank
from 0 to 3, to take also gomory cuts that could not be scaled to integral coefficients, with maximal rank 3 into accountseparating/closecuts/relintnormtype
branching/checksol
and branching/heursbsol
to specify whether the strong branching LP solution should be checked for feasibility and whether a simple rounding heuristic should be run on this solutionbranching/firstsbchild
and branching/forceall
to specify the first child node to be investigated during strong branching (u
p, d
down, a
uto) and whether always both children should be solved (only for strong branching with domain propagation, per default, the second child is not looked at when the first is infeasible)conflict/fullshortenconflict
to decide whether we want to stop shortening a conflict set, when no global bound changes can be found anymoreconflict/maxvarsdetectimpliedbounds
to decide whether the a valid conflict of what maximal length will be used to derive global bound changesconstraints/{linear,knapsack}/detectcutoffbound
and constraints/{linear,knapsack}/detectlowerbound
to enable/disable detection of constraint parallel to the objective function that will add an cutoffbound or an lowerbound respectively and these constraints will be prevented from entering the LPconstraints/and/upgraderesultant
to upgrade resultants of and constraints from binary to implicit binary variables, default is TRUEconstraints/abspower/scaling
and constraints/nonlinear/scaling
constraints/indicator/scaleslackvar
for scaling of the slack variable in indicator constraintsconstraints/indicator/trysolfromcover
for trying to construct a feasible solution from a coverconstraints/linear/checkrelmaxabs
for checking linear constraints with a side of 0.0 relative toconstraints/linear/detectpartialobjective
to enable/disable the detection of sub-equations of the objective functionconstraints/logicor/strengthen
, should pairwise constraint comparison try to strengthen constraints by removing superflous non-zeros?constraints/xor/addextendedform
to add an extended formulation in XOR-constraintsconstraints/xor/addflowextended
to add use the extended flow formulation in XOR-constraintsheuristics/<heurname>/lplimfac
for LNS heuristics to limit the number of LPs solved in a subproblem the maximum absolute value in the activity instead of 1.0heuristics/shiftandpropagate/fixbinlocks
for fixing binary variables with no locks in one direction to the corresponding boundheuristics/shiftandpropagate/collectstats
which decides whether variable statistics are collectedheuristics/shiftandpropagate/impliscontinuous
to decide whether implicit integer variables are treated as continuous variablesheuristics/shiftandpropagate/preferbinaries
and heuristics/shiftandpropagate/stopafterfeasible
, which decide whether binaries should be shifted first and the shifting should be stopped when no violations are leftlp/disablecutoff
to toggle usage of LP cutoff bound (0: enabled, 1: disabled, 2: auto = disabled if pricers are used)misc/calcintegral
(default TRUE) to trigger calculation of primal-dual integralmisc/finitesolutionstore
to switch whether infinite fixings should be removed from solutions before copying them to the original solution storemisc/permuteconss
and misc/permutevars
to control whether variables and/or constraints should be permuted, if permutationseed != -1presolving/components/feastolfactor
to increase the feasibility tolerance in all sub-SCIPs, when solving a componentpropagating/obbt/conditionlimit
to discard instable LP basesreading/(READER)/initialconss
that determines whether model constraints are initialreading/cipreader/writefixedvars
for disabling printing of fixed variables in CIP formatreading/lpreader/aggrlinearization-ands
and reading/mpsreader/aggrlinearization-ands
to enable/disable the printing of the weak or strict relaxation of and-constraints in LP and MPS format, respectivelyreading/lpreader/linearize-and-constraints
and reading/mpsreader/linearize-and-constraints
to allow and-constraints to be linearized when printing in LP and MPS format, respectivelyseparating/feastolfac
to allow dynamic decrease of relaxation feasibility tolerance depending on feasibility to applied cuts, i.e., allow relaxation solutions to have a primal infeasibility of at most this factor times the infeasibility of applied cutsseparating/gomory/sidetypebasis
to decide whether the sides of ranged rows should be determined from the basis statusseparating/oddcycle/cutthreshold
to run odd cycle separation if not enough cuts have been foundseparating/zerohalf/delayedcuts
to use the delayed cutpool for the zerohalf separatorwrite/allconss
to enable that all constraints are writtenwrite/genericnamesoffset
when writing a generic problem to define an offset on the variable numberingSCIP_QUEUE
)src/lpi
.auto
, which means that it is built if and only if GMP is available (GMP=true)other solutions
of primal heuristics statistics