force
parameter in (root)redcost propagator to run the propagator also with active pricersmonoidal cut strengthening
procedure of Balas and Jeroslowdisplay finitesolution
to print solution with infinite fixings removed, added reference to that method to display solution
output if there are infinite fixingswrite history
to write the command line history (only when compiled with Readline)constraints/sos1/branchingrule
to decide whether to use neighborhood, bipartite, or SOS1 branching (this parameter replaces the old parameters constraints/sos1/neighbranch
, constraints/sos1/bipbranch
, and constraints/sos1/sos1branch
)constraints/sos1/depthimplanalysis
to limit the number of recursive calls of implication graph analysisconstraints/sos1/perfimplanalysis
to perform an implication graph analysis to deduce variable fixings and additional SOS1 constraints (this parameter replaces the old parameter constraints/sos1/updateconflpresol
)misc/transsolorig
for transfering transformed solutions to the original space (default: true)propagating/rootredcost/onlybinary
to propagate root reduced costs of binary variables onlySCIP_MATRIX
PRESOLTIMING
flagsdll
to build Windows dlls with MSVCmisc/permutationseed
has value >= 0)compr
for rearranging the search tree, currently this only works on the reoptimization treeSCIP_DECL_CONSGETDIVEBDCHGS
to provide constraint handler method to suggest dive bound changes during the generic diving algorithm, see type_cons.h for detailsSCIP_DECL_DIVESETGETSCORE
to implement scoring function to guide divingSCIP_RETCODE
and needs an additional SCIP_Real*
to store the resultfreesubscip
to SCIPapplyProximity()delay(presol)
parameter from SCIPinclude{Conshdlr,Presol,Prop}() and added (presol)timing
parameterpresoltiming
for method SCIPpresolCons()presoltiming
to SCIPpropCumulativeCondition()delaypos
from SCIPsetConshdlrPresol()presoltiming
to SCIPsetConshdlrPresol()delaypos
from SCIPincludeConshdlr()presoltiming
to SCIPincludeConshdlr()consgetdivebdchgs
to SCIPincludeConshdlr() to provide a divebdchg-callback for the constraint handler to includeforcestrongbranch
to SCIPselectVarStrongBranching()executebranching
SCIPexecRelpscostBranching()ndomredsdown
and ndomredsup
to SCIPgetVarStrongbranchWithPropagation()inds
and ninds
to SCIPgetLPBInvRow(), SCIPgetLPBInvCol(), SCIPgetLPBInvARow(), SCIPgetLPBInvACol(), and SCIPcalcStrongCG()maxweight
, weightinds
, nweightinds
, and rowlensum
to SCIPcalcMIR()delaypos
from SCIPincludePresolBasic()presoltiming
to SCIPincludePresolBasic()delaypos
from SCIPincludePresol()presoltiming
to SCIPincludePresol()presoldelay
and presoltiming
from SCIPincludePresol()presoldelay
and presoltiming
from SCIPsetPropPresol()isequation
to SCIPaddClique()writeimplications
from SCIPwriteCliqueGraph()vbc
settings renamed to visual
initial
and removable
are recognized; for constraints, initial
, separate
, enforce
, check
, propagate
, dynamic
and removable
are recognizedemphasis:
and the contain the emphasis string, e.g., emphasis: feasibility
or emphasis: heuristics off
.vbc/filename
to visual/vbcfilename
vbc/realtime
to visual/realtime
vbc/dispsols
to visual/dispsols
branching/relpscost/confidencelevel
to set the confidence level to be used by statistical testsbranching/relpscost/higherrortol
to define the highest reliability threshold for relative error based reliabilitybranching/relpscost/lowerrortol
to define a lower reliability threshold for relative error based reliabilitybranching/relpscost/nlscoreweight
for weight of nonlinear score when branching on MINLPsbranching/relpscost/usedynamicconfidence
to use a dynamic confidence level based on the amount of strong-branching simplex-iterations compared to the overall simplex iterations (default is FALSE)branching/relpscost/usehyptestforreliability
to enable strong branching decisions based on a 2-sample student-T test of all prior pseudo-cost observations between the best pseudo-candidate and the candidate for which to decide whether strong-branching should be appliedbranching/relpscost/userelerrorreliability
to enable relative error based reliabilitybranching/relpscost/skipbadinitcands
for skipping strong-branching candidates whose estimated gain is significantly worse than the one of the locally best (sb or pseudo) candidateconstraints/linear/multaggrremove
to perform multi-aggregations in linear constraint handler only if the constraint can be removed afterwardsconstraints/linear/rangedrowpropagation
to disabled newly implemented propagtion algorithm for ranged rows and equationsconstraints/quadratic/advanced/interiorcomputation
to select the way of computing and interior point for gauge cutsconstraints/quadratic/gaugecuts
to enable convex quadratics to generate gradients cuts which are supportingconstraints/soc/generalsocupgrade
to allow general quadratics to be upgraded to socconstraints/SOS1/addcomps
to add local complementarity constraints to the branching nodes (can be used in combination with neighborhood or bipartite branching)constraints/SOS1/addbdsfeas
to define a minimal feasibility value for local bound (clique) inequalities in order to be added to the branching nodeconstraints/SOS1/addcompsdepth
to define the maximal depth for adding complementarity constraintsconstraints/SOS1/addcompsfeas
to define a minimal feasibility value for local complementarity constraints in order to be added to the branching nodeconstraints/SOS1/autocutsfromsos1
to automatically switch to separating bound cuts from SOS1 constraints if the SOS1 constraints do not overlapconstraints/SOS1/autosos1branch
to switch to SOS1 branching if the SOS1 constraints do not overlapconstraints/SOS1/conflictprop
to define whether to use conflict graph propagationconstraints/SOS1/bipbranch
to branch on a complete bipartite subgraph of the conflict graphconstraints/SOS1/boundcutsdepth
to define the node depth of separating bound (clique) cutsconstraints/SOS1/boundcutsfreq
to define the frequency for separating bound (clique) cutsconstraints/SOS1/boundcutsfromgraph
to define whether to separate bound (clique) inequalities from the conflict graphconstraints/SOS1/boundcutsfromsos1
to define whether to separate bound (clique) inequalities from SOS1 constraintsconstraints/SOS1/fixnonzero
: If neighborhood branching is used, then fix the branching variable (if positive in sign) to the value of the feasibility toleranceconstraints/SOS1/implcutsdepth
to define the node depth of separating implied bound cutsconstraints/SOS1/implcutsfreq
to define the frequency for separating implied bound cutsconstraints/SOS1/implprop
to define whether to use implication graph propagationconstraints/SOS1/maxaddcomps
to define the maximal number of complementarity constraints added per branching nodeconstraints/SOS1/maxboundcuts
to define the maximal number of bound (clique) cuts separated per branching nodeconstraints/SOS1/maxboundcutsroot
to define the maximal number of bound (clique) cuts separated per iteration in the root nodeconstraints/SOS1/maximplcuts
to define the maximal number of implied bound cuts separated per branching nodeconstraints/SOS1/maximplcutsroot
to define the maximal number of implied bound cuts separated per iteration in the root nodeconstraints/SOS1/maxextensions
to define maximal number of extensions that will be computed for each SOS1 constraint in presolvingconstraints/SOS1/maxsosadjacency
to define that the adjacency matrix of the conflict graph is not created in presolving if the number of SOS1 variables is too largeconstraints/SOS1/maxtightenbds
to define the maximal number of bound tightening rounds per presolving roundconstraints/SOS1/neighbranch
to branch on a neighborhood of the conflict graphconstraints/SOS1/nstrongiter
to define the maximal number LP iterations to perform for each strong branching roundconstraints/SOS1/nstrongrounds
to define the maximal number of strong branching rounds to perform for each node (only available for neighborhood and bipartite branching)constraints/SOS1/sos1branch
to branch on a single SOS1 constraint, i.e., a clique of the conflict graphconstraints/SOS1/sosconsprop
to define whether to use SOS1 constraint propagationconstraints/SOS1/strthenboundcuts
to define whether to strengthen bound (clique) cuts in case bound variables are availableconstraints/SOS1/updateconflpresol
to update the conflict graph during the presolving proceduredisplay/allviols
to print all violated constraints of the best solution during checksol in the scip shellheuristics/indicator/improvesols
that turns on the improvement of external solutions by one-optheuristics/∗diving/lpresolvedomchgquot
to determine the percentage of changed domains since previous LP to trigger an LP resolve [default: 0.15] (* stands for eight diving heuristics to support this feature)heuristics/∗diving/lpsolvefreq
to determine the frequency for resolving LP's during the execution of this heuristic [default: 1, use 0 for a dynamic setting based on the number of domain reductions] (* stands for eight diving heuristics to support this feature)heuristics/shiftandpropagate/binlocksfirst
to set if binaries without locks should be preferred in orderingheuristics/shiftandpropagate/maxcutoffquot
to select a maximum percentage of allowed cutoffs before stopping the heuristic (default is 0.0)heuristics/shiftandpropagate/selectbest
to trigger if shiftandpropagate should select the best candidate in every round (set to FALSE for static order) (default is FALSE)limits/autororestart
for triggering an automatic restart after this many nodes, or -1 for no auto restart [default is -1]limits/softtime
to set a soft time limit (active only after first primal solution was found)misc/allowobjprop
to allow objective function propagationmisc/allowdualreds
to allow dual reductionsmisc/outputorigsol
to control whether at the end of a command line run the solution should be output in the orignal spacenumerics/checkfeastolfac
to scale feasibility tolerance when checking the feasibility of best found solution after the solving process finished (e.g., checksol in scip shell)separating/cutselrestart
for cut selection during restart copy process (a
ge, activity q
uotient) [default is a
]separating/cutselsubscip
for cut selection for sub SCIPs (a
ge, activity q
uotient) [default is a
]separating/disjunctive/maxconsdelay
to delay separation of disjunctive cuts if number of SOS1 constraints is larger than predefined valueseparating/disjunctive/maxdepth
to define the node depth of separating disjunctive cutsseparating/disjunctive/maxinvcuts
to define the maximal number of disjunctive cuts investigated per iteration in a branching nodeseparating/disjunctive/maxinvcutsroot
to define the maximal number of disjunctive cuts investigated per iteration in the root nodeseparating/disjunctive/maxrank
to define the maximal permissible rank of a disjunctive cut that could not be scaled to integral coefficientsseparating/disjunctive/maxrankintegral
to define the maximal permissible rank of a disjunctive cut that could be scaled to integral coefficientsseparating/disjunctive/maxrounds
to define the maximal number of separation rounds of disjunctive cuts in a branching nodeseparating/disjunctive/maxweightrange
to define the maximal valid range of simplex tableau row weightsSCIP_CONFIDENCE_LEVEL
for different levels of confidence for statistical tests.SCIP_DIVESET
that bundles options for SCIP's diving heuristics; all hard diving heuristics (those without obj
at the beginning) include diveset and implement only the scoring callback.*_vbc.?
to the more generic *_visual.?
DELHEADERS
for uninstall
-target: scip headers are only removed when invoking make uninstall DELHEADERS=true
testclusterxpress
and testxpress
make install
which now sets symbolic links and short links to binaries and librariesSCIP_NLPSOLSTAT_LOCALINFEASIBLE
solution status in nlp.c