Scippy

SCIP

Solving Constraint Integer Programs

File List
Here is a list of all files with brief descriptions:
 bitencode.cPacking single and dual bit values
 bitencode.hPacking single and dual bit values
 branch.cMethods for branching rules and branching candidate storage
 branch.hInternal methods for branching rules and branching candidate storage
 branch_allfullstrong.cAll variables full strong LP branching rule
 branch_allfullstrong.hAll variables full strong LP branching rule
 branch_cloud.cCloud branching rule
 branch_cloud.hCloud branching rule
 branch_distribution.cProbability based branching rule based on an article by J. Pryor and J.W. Chinneck
 branch_distribution.hProbability based branching rule based on an article by J. Pryor and J.W. Chinneck
 branch_fullstrong.cFull strong LP branching rule
 branch_fullstrong.hFull strong LP branching rule
 branch_inference.cInference history branching rule
 branch_inference.hInference history branching rule
 branch_leastinf.cLeast infeasible LP branching rule
 branch_leastinf.hLeast infeasible LP branching rule
 branch_mostinf.cMost infeasible LP branching rule
 branch_mostinf.hMost infeasible LP branching rule
 branch_multaggr.cFullstrong branching on fractional and multi-aggregated variables
 branch_multaggr.hFullstrong branching on fractional and multi-aggregated variables
 branch_nodereopt.cBranching rule to reconstruct the search tree
 branch_nodereopt.hNodereopt branching rule
 branch_pscost.cPseudo costs branching rule
 branch_pscost.hPseudo costs branching rule
 branch_random.cRandom variable branching rule
 branch_random.hRandom variable branching rule
 branch_relpscost.cReliable pseudo costs branching rule
 branch_relpscost.hReliable pseudo costs branching rule
 clock.cMethods for clocks and timing issues
 clock.hInternal methods for clocks and timing issues
 cmain.cMain file for C compilation
 compr.cMethods for tree compressions
 compr.hInternal methods for tree compressions
 compr_largestrepr.cLargestrepr tree compression
 compr_largestrepr.hLargestrepr tree compression
 compr_weakcompr.cWeakcompr tree compression
 compr_weakcompr.hWeakcompr tree compression
 conflict.cMethods and datastructures for conflict analysis
 conflict.hInternal methods for conflict analysis
 cons.cMethods for constraints and constraint handlers
 cons.hInternal methods for constraints and constraint handlers
 cons_abspower.cConstraint handler for absolute power constraints $\textrm{lhs} \leq \textrm{sign}(x+a) |x+a|^n + c z \leq \textrm{rhs}$
 cons_abspower.hConstraint handler for absolute power constraints $\textrm{lhs} \leq \textrm{sign}(x+a) |x+a|^n + c z \leq \textrm{rhs}$
 cons_and.cConstraint handler for AND-constraints, $r = x_1 \wedge x_2 \wedge \dots \wedge x_n$
 cons_and.hConstraint handler for "and" constraints, $r = x_1 \wedge x_2 \wedge \dots \wedge x_n$
 cons_bivariate.cConstraint handler for bivariate nonlinear constraints $\textrm{lhs} \leq f(x,y) + c z \leq \textrm{rhs}$
 cons_bivariate.hConstraint handler for bivariate nonlinear constraints $\textrm{lhs} \leq f(x,y) + c z \leq \textrm{rhs}$
 cons_bounddisjunction.cConstraint handler for bound disjunction constraints $(x_1 \{\leq,\geq\} b_1) \vee \ldots \vee (x_n \{\leq,\geq\} b_n)$
 cons_bounddisjunction.hConstraint handler for bound disjunction constraints $(x_1 \{\leq,\geq\} b_1) \vee \ldots \vee (x_n \{\leq,\geq\} b_n)$
 cons_conjunction.cConstraint handler for conjunction constraints
 cons_conjunction.hConstraint handler for conjunction constraints
 cons_countsols.cConstraint handler for counting feasible solutions
 cons_countsols.hConstraint handler for counting feasible solutions
 cons_cumulative.cConstraint handler for cumulative constraints
 cons_cumulative.hConstraint handler for cumulative constraints
 cons_disjunction.cConstraint handler for disjunction constraints
 cons_disjunction.hConstraint handler for disjunction constraints
 cons_indicator.cConstraint handler for indicator constraints
 cons_indicator.hConstraint handler for indicator constraints
 cons_integral.cConstraint handler for the integrality constraint
 cons_integral.hConstraint handler for the integrality constraint
 cons_knapsack.cConstraint handler for knapsack constraints of the form $a^T x \le b$, x binary and $a \ge 0$
 cons_knapsack.hConstraint handler for knapsack constraints of the form $a^T x \le b$, x binary and $a \ge 0$
 cons_linear.cConstraint handler for linear constraints in their most general form, $lhs <= a^T x <= rhs$
 cons_linear.hConstraint handler for linear constraints in their most general form, $lhs <= a^T x <= rhs$
 cons_linking.cConstraint handler for linking constraints
 cons_linking.hConstraint handler for linking binary variables to an integer variable
 cons_logicor.cConstraint handler for logic or constraints $1^T x \ge 1$ (equivalent to set covering, but algorithms are suited for depth first search)
 cons_logicor.hConstraint handler for logicor constraints $1^T x \ge 1$ (equivalent to set covering, but algorithms are suited for depth first search)
 cons_nonlinear.cConstraint handler for nonlinear constraints $\textrm{lhs} \leq \sum_{i=1}^n a_ix_i + \sum_{j=1}^m c_jf_j(x) \leq \textrm{rhs}$
 cons_nonlinear.hConstraint handler for nonlinear constraints $\textrm{lhs} \leq \sum_{i=1}^n a_ix_i + \sum_{j=1}^m c_jf_j(x) \leq \textrm{rhs}$
 cons_or.cConstraint handler for "or" constraints, $r = x_1 \vee x_2 \vee \dots \vee x_n$
 cons_or.hConstraint handler for "or" constraints, $r = x_1 \vee x_2 \vee \dots \vee x_n$
 cons_orbitope.cConstraint handler for (partitioning/packing) orbitope constraints w.r.t. the full symmetric group
 cons_orbitope.hConstraint handler for (partitioning/packing) orbitope constraints w.r.t. the full symmetric group
 cons_pseudoboolean.cConstraint handler for pseudo Boolean constraints
 cons_pseudoboolean.hConstraint handler for pseudoboolean constraints
 cons_quadratic.cConstraint handler for quadratic constraints $\textrm{lhs} \leq \sum_{i,j=1}^n a_{i,j} x_i x_j + \sum_{i=1}^n b_i x_i \leq \textrm{rhs}$
 cons_quadratic.hConstraint handler for quadratic constraints $\textrm{lhs} \leq \sum_{i,j=1}^n a_{i,j} x_ix_j + \sum_{i=1}^n b_i x_i \leq \textrm{rhs}$
 cons_setppc.cConstraint handler for the set partitioning / packing / covering constraints $1^T x\ \{=, \le, \ge\}\ 1$
 cons_setppc.hConstraint handler for the set partitioning / packing / covering constraints $1^T x\ \{=, \le, \ge\}\ 1$
 cons_soc.cConstraint handler for second order cone constraints $\sqrt{\gamma + \sum_{i=1}^{n} (\alpha_i\, (x_i + \beta_i))^2} \leq \alpha_{n+1}\, (x_{n+1}+\beta_{n+1})$
 cons_soc.hConstraint handler for second order cone constraints $\sqrt{\gamma + \sum_{i=1}^{n} (\alpha_i\, (x_i + \beta_i))^2} \leq \alpha_{n+1}\, (x_{n+1}+\beta_{n+1})$
 cons_sos1.cConstraint handler for SOS type 1 constraints
 cons_sos1.hConstraint handler for SOS type 1 constraints
 cons_sos2.cConstraint handler for SOS type 2 constraints
 cons_sos2.hConstraint handler for SOS type 2 constraints
 cons_superindicator.cConstraint handler for indicator constraints over arbitrary constraint types
 cons_superindicator.hConstraint handler for indicator constraints over arbitrary constraint types
 cons_varbound.cConstraint handler for variable bound constraints $lhs \le x + c y \le rhs$
 cons_varbound.hConstraint handler for variable bound constraints $lhs \leq x + c y \leq rhs$
 cons_xor.cConstraint handler for "xor" constraints, $rhs = x_1 \oplus x_2 \oplus \dots \oplus x_n$
 cons_xor.hConstraint handler for "xor" constraints, $rhs = x_1 \oplus x_2 \oplus \dots \oplus x_n$
 cppmain.cppMain file for C++ compilation
 cutpool.cMethods for storing cuts in a cut pool
 cutpool.hInternal methods for storing cuts in a cut pool
 debug.cMethods for debugging
 debug.hMethods for debugging
 def.hCommon defines and data types used in all packages of SCIP
 dialog.cMethods for user interface dialog
 dialog.hInternal methods for user interface dialog
 dialog_default.cDefault user interface dialog
 dialog_default.hDefault user interface dialog
 dijkstra.cC implementation of Dijkstra's algorithm
 dijkstra.hDefinitions for Disjkstra's shortest path algorithm
 disp.cMethods and datastructures for displaying runtime statistics
 disp.hInternal methods for displaying runtime statistics
 disp_default.cDefault display columns
 disp_default.hDefault display columns
 dive.cLibrary methods for diving heuristics
 event.cMethods and datastructures for managing events
 event.hInternal methods for managing events
 event_softtimelimit.cEventhdlr for soft time limit
 event_softtimelimit.hEventhdlr for soft time limit
 expr.cMethods for expressions, expression trees, expression graphs, and related
 exprinterpret.hMethods to interpret (evaluate) an expression tree "fast"
 exprinterpret_cppad.cppMethods to interpret (evaluate) an expression tree "fast" using CppAD
 exprinterpret_none.cFunction definitions for nonexisting expression interpreter to resolve linking references
 fileio.cWrapper functions to map file i/o to standard or zlib file i/o
 heur.cMethods for primal heuristics
 heur.hInternal methods for primal heuristics
 heur_actconsdiving.cLP diving heuristic that chooses fixings w.r.t. the active constraints the variable appear in
 heur_actconsdiving.hLP diving heuristic that chooses fixings w.r.t. the active constraints the variable appear in
 heur_bound.cHeuristic which fixes all integer variables to a bound (lower/upper) and solves the remaining LP
 heur_bound.hHeuristic which fixes all integer variables to a bound (lower/upper) and solves the remaining LP
 heur_clique.cLNS heuristic using a clique partition to restrict the search neighborhood
 heur_clique.hLNS heuristic using a clique partition to restrict the search neighborhood
 heur_coefdiving.cLP diving heuristic that chooses fixings w.r.t. the matrix coefficients
 heur_coefdiving.hLP diving heuristic that chooses fixings w.r.t. the matrix coefficients
 heur_crossover.cCrossover primal heuristic
 heur_crossover.hLNS heuristic that tries to combine several feasible solutions
 heur_dins.cDINS primal heuristic (according to Ghosh)
 heur_dins.hDINS primal heuristic
 heur_distributiondiving.cDiving heuristic that chooses fixings w.r.t. changes in the solution density after Pryor and Chinneck
 heur_distributiondiving.hDiving heuristic that chooses fixings w.r.t. changes in the solution density after Pryor and Chinneck
 heur_dualval.cDualval primal heuristic
 heur_dualval.hPrimal heuristic that uses dualvalues for successive switching variable values
 heur_feaspump.cObjective Feasibility Pump 2.0
 heur_feaspump.hObjective Feasibility Pump 2.0
 heur_fixandinfer.cFix-and-infer primal heuristic
 heur_fixandinfer.hFix-and-infer primal heuristic
 heur_fracdiving.cLP diving heuristic that chooses fixings w.r.t. the fractionalities
 heur_fracdiving.hLP diving heuristic that chooses fixings w.r.t. the fractionalities
 heur_guideddiving.cLP diving heuristic that chooses fixings in direction of incumbent solutions
 heur_guideddiving.hLP diving heuristic that chooses fixings in direction of incumbent solutions
 heur_indicator.cHandle partial solutions for linear problems with indicators and otherwise continuous variables
 heur_indicator.hHandle partial solutions for linear problems with indicators and otherwise continuous variables
 heur_intdiving.cLP diving heuristic that fixes variables with integral LP value
 heur_intdiving.hLP diving heuristic that fixes variables with integral LP value
 heur_intshifting.cLP rounding heuristic that tries to recover from intermediate infeasibilities, shifts integer variables, and solves a final LP to calculate feasible values for continuous variables
 heur_intshifting.hLP rounding heuristic that tries to recover from intermediate infeasibilities, shifts integer variables, and solves a final LP to calculate feasible values for continuous variables
 heur_linesearchdiving.cLP diving heuristic that fixes variables with a large difference to their root solution
 heur_linesearchdiving.hLP diving heuristic that fixes variables with a large difference to their root solution
 heur_localbranching.cLocal branching heuristic according to Fischetti and Lodi
 heur_localbranching.hLocal branching heuristic according to Fischetti and Lodi
 heur_mutation.cLNS heuristic that tries to randomly mutate the incumbent solution
 heur_mutation.hLNS heuristic that tries to randomly mutate the incumbent solution
 heur_nlpdiving.cNLP diving heuristic that chooses fixings w.r.t. the fractionalities
 heur_nlpdiving.hNLP diving heuristic that chooses fixings w.r.t. the fractionalities
 heur_objpscostdiving.cLP diving heuristic that changes variable's objective value instead of bounds, using pseudo cost values as guide
 heur_objpscostdiving.hLP diving heuristic that changes variable's objective value instead of bounds, using pseudo cost values as guide
 heur_octane.cOctane primal heuristic based on Balas, Ceria, Dawande, Margot, and Pataki
 heur_octane.hOctane primal heuristic based on Balas, Ceria, Dawande, Margot, and Pataki
 heur_ofins.cOFINS - Objective Function Induced Neighborhood Search - a primal heuristic for reoptimization
 heur_ofins.hOFINS - Objective Function Induced Neighborhood Search - a primal heuristic for reoptimization
 heur_oneopt.cImprovement heuristic that alters single variable values
 heur_oneopt.hImprovement heuristic that alters single variable values
 heur_proximity.cImprovement heuristic which uses an auxiliary objective instead of the original objective function which is itself added as a constraint to a sub-SCIP instance. The heuristic was presented by Matteo Fischetti and Michele Monaci
 heur_proximity.hImprovement heuristic which uses an auxiliary objective instead of the original objective function which is itself added as a constraint to a sub-SCIP instance. The heuristic was presented by Matteo Fischetti and Michele Monaci
 heur_pscostdiving.cLP diving heuristic that chooses fixings w.r.t. the pseudo cost values
 heur_pscostdiving.hLP diving heuristic that chooses fixings w.r.t. the pseudo cost values
 heur_randrounding.cRandomized LP rounding heuristic which also generates conflicts via an auxiliary probing tree
 heur_randrounding.hRandomized LP rounding heuristic which also generates conflicts via an auxiliary probing tree
 heur_rens.cLNS heuristic that finds the optimal rounding to a given point
 heur_rens.hLNS heuristic that finds the optimal rounding to a given point
 heur_reoptsols.cReoptsols primal heuristic
 heur_reoptsols.hReoptsols primal heuristic
 heur_rins.cLNS heuristic that combines the incumbent with the LP optimum
 heur_rins.hLNS heuristic that combines the incumbent with the LP optimum
 heur_rootsoldiving.cLP diving heuristic that changes variable's objective values using root LP solution as guide
 heur_rootsoldiving.hLP diving heuristic that changes variables' objective values using root LP solution as guide
 heur_rounding.cLP rounding heuristic that tries to recover from intermediate infeasibilities
 heur_rounding.hLP rounding heuristic that tries to recover from intermediate infeasibilities
 heur_shiftandpropagate.cShiftandpropagate primal heuristic
 heur_shiftandpropagate.hPreroot heuristic that alternatingly fixes variables and propagates domains
 heur_shifting.cLP rounding heuristic that tries to recover from intermediate infeasibilities and shifts continuous variables
 heur_shifting.hLP rounding heuristic that tries to recover from intermediate infeasibilities and shifts continuous variables
 heur_simplerounding.cSimple and fast LP rounding heuristic
 heur_simplerounding.hSimple and fast LP rounding heuristic
 heur_subnlp.cNLP local search primal heuristic using sub-SCIPs
 heur_subnlp.hNLP local search primal heuristic using sub-SCIPs
 heur_trivial.cTrivial primal heuristic
 heur_trivial.hTrivial primal heuristic
 heur_trivialnegation.cTrivialnegation primal heuristic
 heur_trivialnegation.hTrivialnegation primal heuristic
 heur_trysol.cPrimal heuristic that tries a given solution
 heur_trysol.hPrimal heuristic that tries a given solution
 heur_twoopt.cPrimal heuristic to improve incumbent solution by flipping pairs of variables
 heur_twoopt.hPrimal heuristic to improve incumbent solution by flipping pairs of variables
 heur_undercover.cUndercover primal heuristic for MINLPs
 heur_undercover.hUndercover primal heuristic for MINLPs
 heur_vbounds.cLNS heuristic uses the variable lower and upper bounds to determine the search neighborhood
 heur_vbounds.hLNS heuristic uses the variable lower and upper bounds to determine the search neighborhood
 heur_veclendiving.cLP diving heuristic that rounds variables with long column vectors
 heur_veclendiving.hLP diving heuristic that rounds variables with long column vectors
 heur_zeroobj.cHeuristic that tries to solve the problem without objective. In Gurobi, this heuristic is known as "Hail Mary"
 heur_zeroobj.hHeuristic that tries to solve the problem without objective. In Gurobi, this heuristic is known as "Hail Mary"
 heur_zirounding.cZirounding primal heuristic
 heur_zirounding.hZI Round primal heuristic
 history.cMethods for branching and inference history
 history.hInternal methods for branching and inference history
 implics.cMethods for implications, variable bounds, and clique tables
 implics.hMethods for implications, variable bounds, and cliques
 interrupt.cMethods and datastructures for catching the user CTRL-C interrupt
 interrupt.hMethods for catching the user CTRL-C interrupt
 intervalarith.cInterval arithmetics for provable bounds
 intervalarith.hInterval arithmetics for provable bounds
 intervalarithext.cppC++ extensions to interval arithmetics for provable bounds
 intervalarithext.hC++ extensions to interval arithmetics for provable bounds
 lp.cLP management methods and data structures
 lp.hInternal methods for LP management
 lpi.hInterface methods for specific LP solvers
 lpi_clp.cppLP interface for Clp
 lpi_cpx.cLP interface for CPLEX >= 8.0
 lpi_grb.cLP interface for Gurobi
 lpi_msk.cLP interface for MOSEK
 lpi_none.cDummy interface for the case no LP solver is needed
 lpi_qso.cLP interface for QSopt version >= 070303
 lpi_spx.cppLP interface for SoPlex version 1.4 and higher
 lpi_spx2.cppLP interface for SoPlex version 2.0 and higher
 lpi_xprs.cLP interface for Xpress-MP
 matrix.cMethods for MIP matrix data structure
 mem.cBlock memory pools and memory buffers
 mem.hMethods for block memory pools and memory buffers
 memory.cMemory allocation routines
 memory.hMemory allocation routines
 message.cMessage output methods
 message.hMessage output methods
 message_default.cDefault message handler
 message_default.hDefault message handler
 misc.cMiscellaneous methods
 misc.hInternal miscellaneous methods
 nlp.cNLP management methods and datastructures
 nlp.hInternal methods for NLP management
 nlpi.cMethods for handling nlp interface
 nlpi.hInternal methods for NLPI solver interfaces
 nlpi_ipopt.cppIpopt NLP interface
 nlpi_ipopt.hIpopt NLP interface
 nlpi_ipopt_dummy.cDummy Ipopt NLP interface for the case that Ipopt is not available
 nlpioracle.cImplementation of NLPI oracle interface
 nlpioracle.hMethods to store an NLP and request function, gradient, and hessian values
 nodesel.cMethods for node selectors
 nodesel.hInternal methods for node selectors and node priority queues
 nodesel_bfs.cNode selector for best first search
 nodesel_bfs.hNode selector for best first search
 nodesel_breadthfirst.c
 nodesel_breadthfirst.hNode selector for breadth-first search
 nodesel_dfs.cNode selector for depth first search
 nodesel_dfs.hNode selector for depth first search
 nodesel_estimate.cNode selector for best estimate search
 nodesel_estimate.hNode selector for best estimate search
 nodesel_hybridestim.cNode selector for hybrid best estimate / best bound search
 nodesel_hybridestim.hNode selector for hybrid best estimate / best bound search
 nodesel_restartdfs.cNode selector for depth first search with periodical selection of the best node
 nodesel_restartdfs.hNode selector for depth first search with periodical selection of the best node
 nodesel_uct.cUct node selector which balances exploration and exploitation by considering node visits
 nodesel_uct.hUct node selector which balances exploration and exploitation by considering node visits
 objbranchrule.cppC++ wrapper for branching rules
 objbranchrule.hC++ wrapper for branching rules
 objcloneable.hDefinition of base class for all clonable classes
 objconshdlr.cppC++ wrapper for constraint handlers
 objconshdlr.hC++ wrapper for constraint handlers
 objdialog.cppC++ wrapper for dialogs
 objdialog.hC++ wrapper for dialogs
 objdisp.cppC++ wrapper for display column
 objdisp.hC++ wrapper for display columns
 objeventhdlr.cppC++ wrapper for event handlers
 objeventhdlr.hC++ wrapper for event handlers
 objheur.cppC++ wrapper for primal heuristics
 objheur.hC++ wrapper for primal heuristics
 objmessagehdlr.cppC++ wrapper for message handlers
 objmessagehdlr.hC++ wrapper for message handlers
 objnodesel.cppC++ wrapper for node selectors
 objnodesel.hC++ wrapper for node selectors
 objpresol.cppC++ wrapper for presolvers
 objpresol.hC++ wrapper for presolvers
 objpricer.cppC++ wrapper for variable pricers
 objpricer.hC++ wrapper for variable pricers
 objprobcloneable.hDefinition of base class for all clonable classes which define problem data
 objprobdata.cppC++ wrapper for user problem data
 objprobdata.hC++ wrapper for user problem data
 objprop.cppC++ wrapper for propagators
 objprop.hC++ wrapper for propagators
 objreader.cppC++ wrapper for file readers
 objreader.hC++ wrapper for file readers and writers
 objrelax.cppC++ wrapper for relaxators
 objrelax.hC++ wrapper for relaxation handlers
 objscip.hC++ wrapper classes for SCIP
 objscipdefplugins.hC++ wrapper for default SCIP plugins
 objsepa.cppC++ wrapper for cut separators
 objsepa.hC++ wrapper for cut separators
 objvardata.cppC++ wrapper for user variable data
 objvardata.hC++ wrapper for user variable data
 paramset.cMethods for handling parameter settings
 paramset.hInternal methods for handling parameter settings
 presol.cMethods for presolvers
 presol.hInternal methods for presolvers
 presol_boundshift.cPresolver that converts variables with domain [a,b] to variables with domain [0,b-a]
 presol_boundshift.hPresolver that converts integer variables with domain [a,b] to integer variables with domain [0,b-a]
 presol_components.cSolve independent components in advance
 presol_components.hComponents presolver
 presol_convertinttobin.cPresolver that converts integer variables to binaries
 presol_convertinttobin.hPresolver that converts integer variables with domain [a,a+1] to binaries
 presol_domcol.cDominated column presolver
 presol_domcol.hDominated column presolver
 presol_dualagg.cAggregate variables by dual arguments
 presol_dualagg.hAggregate variables by dual arguments
 presol_dualinfer.cDual inference presolver
 presol_dualinfer.hDual inference presolver
 presol_gateextraction.cGateextraction presolver
 presol_gateextraction.hGateextraction presolver
 presol_implfree.cPerform multi-aggregation on implied free variables
 presol_implfree.hExploit implied free variables for multi-aggregation
 presol_implics.cImplics presolver
 presol_implics.hImplication graph presolver which checks for aggregations
 presol_inttobinary.cPresolver that converts integer variables with domain [a,a+1] to binaries
 presol_inttobinary.hPresolver that converts integer variables with domain [a,a+1] to binaries
 presol_redvub.cRemove redundant variable upper bound constraints
 presol_redvub.hRemove redundant variable upper bound constraints
 presol_stuffing.cFix singleton continuous variables
 presol_stuffing.hFix singleton continuous variables
 presol_trivial.cTrivial presolver: round fractional bounds on integer variables, fix variables with equal bounds
 presol_trivial.hTrivial presolver: round fractional bounds on integer variables, fix variables with equal bounds
 presol_tworowbnd.cDo bound tightening by using two rows
 presol_tworowbnd.hDo bound tightening by using two rows
 presolve.cMethods for presolving
 presolve.hInternal methods for presolving
 pricer.cMethods for variable pricers
 pricer.hInternal methods for variable pricers
 pricestore.cMethods for storing priced variables
 pricestore.hInternal methods for storing priced variables
 primal.cMethods for collecting primal CIP solutions and primal informations
 primal.hInternal methods for collecting primal CIP solutions and primal informations
 prob.cMethods and datastructures for storing and manipulating the main problem
 prob.hInternal methods for storing and manipulating the main problem
 prop.cMethods and datastructures for propagators
 prop.hInternal methods for propagators
 prop_dualfix.cFixing roundable variables to best bound
 prop_dualfix.hFixing roundable variables to best bound
 prop_genvbounds.cGeneralized variable bounds propagator
 prop_genvbounds.hGeneralized variable bounds propagator
 prop_obbt.cOptimization-based bound tightening propagator
 prop_obbt.hOptimization-based bound tightening propagator
 prop_probing.cProbing propagator
 prop_probing.hProbing propagator
 prop_pseudoobj.cPseudo objective propagator
 prop_pseudoobj.hPseudo objective propagator
 prop_redcost.cPropagator using the LP reduced cost and the cutoff bound
 prop_redcost.hPropagator using the LP reduced cost and the cutoff bound
 prop_rootredcost.cReduced cost strengthening using root node reduced costs and the cutoff bound
 prop_rootredcost.hReduced cost strengthening using root node reduced costs and the cutoff bound
 prop_vbounds.cVariable upper and lower bound propagator
 prop_vbounds.hVariable upper and lower bound propagator
 pub_branch.hPublic methods for branching rules
 pub_compr.hPublic methods for tree compressions
 pub_conflict.hPublic methods for conflict analysis handlers
 pub_cons.hPublic methods for managing constraints
 pub_cutpool.hPublic methods for storing cuts in a cut pool
 pub_dialog.hPublic methods for user interface dialog
 pub_disp.hPublic methods for displaying runtime statistics
 pub_dive.hLibrary methods for diving heuristics
 pub_event.hPublic methods for managing events
 pub_expr.hPublic methods for expressions, expression trees, expression graphs, and related stuff
 pub_fileio.hWrapper functions to map file i/o to standard or zlib file i/o
 pub_heur.hPublic methods for primal heuristics
 pub_history.hPublic methods for branching and inference history structure
 pub_implics.hPublic methods for implications, variable bounds, and cliques
 pub_lp.hPublic methods for LP management
 pub_matrix.hPublic methods for matrix
 pub_message.hPublic methods for message output
 pub_misc.hPublic data structures and miscellaneous methods
 pub_nlp.hPublic methods for NLP management
 pub_nodesel.hPublic methods for node selectors
 pub_paramset.hPublic methods for handling parameter settings
 pub_presol.hPublic methods for presolvers
 pub_pricer.hPublic methods for variable pricers
 pub_prop.hPublic methods for propagators
 pub_reader.hPublic methods for input file readers
 pub_relax.hPublic methods for relaxation handlers
 pub_reopt.hPublic methods for reoptimization
 pub_sepa.hPublic methods for separators
 pub_sol.hPublic methods for primal CIP solutions
 pub_tree.hPublic methods for branch and bound tree
 pub_var.hPublic methods for problem variables
 reader.cInterface for input file readers
 reader.hInternal methods for input file readers
 reader_bnd.cFile reader for variable bounds
 reader_bnd.hFile reader for variable bounds
 reader_ccg.cGraph file reader (actually, only a writer)
 reader_ccg.hColumn connectivity graph file reader (actually, only a writer)
 reader_cip.cCIP file reader
 reader_cip.hCIP file reader
 reader_cnf.cCNF file reader
 reader_cnf.hCNF file reader
 reader_diff.cDIFF file reader
 reader_diff.hDiff file reader
 reader_fix.cFile reader for variable fixings
 reader_fix.hFile reader for variable fixings
 reader_fzn.cFlatZinc file reader
 reader_fzn.hFlatZinc file reader
 reader_gms.cGAMS file writer
 reader_gms.hGAMS file reader and writer
 reader_lp.cLP file reader
 reader_lp.hLP file reader
 reader_mps.c(extended) MPS file reader
 reader_mps.h(extended) MPS file reader
 reader_opb.cPseudo-Boolean file reader (opb format)
 reader_opb.hPseudo-Boolean file reader (opb format)
 reader_osil.cOS instance language (OSiL) format file reader
 reader_osil.hOS instance language (OSiL) format file reader
 reader_pbm.cFile writer for portable bitmap file format (PBM), open with common graphic viewer programs (e.g. xview)
 reader_pbm.hFile writer for portable bitmap file format (PBM), open with common graphic viewer programs (e.g. xview)
 reader_pip.cFile reader for polynomial mixed-integer programs in PIP format
 reader_pip.hFile reader for polynomial mixed-integer programs in PIP format
 reader_ppm.cFile writer for portable pixmap file format (PPM), open with common graphic viewer programs (e.g. xview)
 reader_ppm.hFile writer for portable pixmap file format (PPM), open with common graphic viewer programs (e.g. xview)
 reader_rlp.cRLP file reader (LP format with generic variables and row names)
 reader_rlp.hRLP file reader (LP format with generic variables and row names)
 reader_sol.cFile reader for primal solutions
 reader_sol.hFile reader for primal solutions
 reader_wbo.cWBO file reader (OPB format with weighted constraints)
 reader_wbo.hWBO file reader (LP format with generic variables and row names)
 reader_zpl.cZIMPL model file reader
 reader_zpl.hZIMPL model file reader
 relax.cMethods and datastructures for relaxation handlers
 relax.hInternal methods for relaxators
 reopt.cData structures and methods for collecting reoptimization information
 reopt.hData structures and methods for collecting reoptimization information
 retcode.cMethods for return codes for SCIP methods
 retcode.hInternal methods for return codes for SCIP methods
 scip.cSCIP callable library
 scip.hSCIP callable library
 scipdefplugins.cDefault SCIP plugins
 scipdefplugins.hDefault SCIP plugins
 scipgithash.cGit hash methods
 scipgithash.hGit hash methods
 scipshell.cSCIP command line interface
 scipshell.hSCIP command line interface
 sepa.cMethods and datastructures for separators
 sepa.hInternal methods for separators
 sepa_cgmip.cChvatal-Gomory cuts computed via a sub-MIP
 sepa_cgmip.hChvatal-Gomory cuts computed via a sub-MIP
 sepa_clique.cClique separator
 sepa_clique.hClique separator
 sepa_closecuts.cClosecuts meta separator
 sepa_closecuts.hClosecuts meta separator
 sepa_cmir.cComplemented mixed integer rounding cuts separator (Marchand's version)
 sepa_cmir.hComplemented mixed integer rounding cuts separator (Marchand's version)
 sepa_disjunctive.cDisjunctive cut separator
 sepa_disjunctive.hDisjunctive cut separator
 sepa_eccuts.cEdge concave cut separator
 sepa_eccuts.hEdge concave cut separator
 sepa_flowcover.cFlow cover cuts separator
 sepa_flowcover.hFlowcover separator
 sepa_gomory.cGomory MIR Cuts
 sepa_gomory.hGomory MIR Cuts
 sepa_impliedbounds.cImplied bounds separator
 sepa_impliedbounds.hImplied bounds separator
 sepa_intobj.cInteger objective value separator
 sepa_intobj.hInteger objective value separator
 sepa_mcf.cMulti-commodity-flow network cut separator
 sepa_mcf.hMulti-commodity-flow network cut separator
 sepa_oddcycle.cOddcycle separator
 sepa_oddcycle.hOddcycle separator
 sepa_rapidlearning.cRapidlearning separator
 sepa_rapidlearning.hRapidlearning separator
 sepa_strongcg.cStrong CG Cuts (Letchford & Lodi)
 sepa_strongcg.hStrong CG Cuts (Letchford & Lodi)
 sepa_zerohalf.c{0,1/2}-cuts separator
 sepa_zerohalf.h{0,1/2}-cuts separator
 sepastore.cMethods for storing separated cuts
 sepastore.hInternal methods for storing separated cuts
 set.cMethods for global SCIP settings
 set.hInternal methods for global SCIP settings
 sol.cMethods for storing primal CIP solutions
 sol.hInternal methods for storing primal CIP solutions
 solve.cMain solving loop and node processing
 solve.hInternal methods for main solving loop and node processing
 sorttpl.cTemplate functions for sorting
 stat.cMethods for problem statistics
 stat.hInternal methods for problem statistics
 struct_branch.hDatastructures for branching rules and branching candidate storage
 struct_clock.hDatastructures for clocks and timing issues
 struct_compr.hDatastructures for tree compression techniques
 struct_conflict.hDatastructures for conflict analysis
 struct_cons.hDatastructures for constraints and constraint handlers
 struct_cutpool.hDatastructures for storing cuts in a cut pool
 struct_dialog.hDatastructures for user interface dialog
 struct_disp.hDatastructures for displaying runtime statistics
 struct_event.hDatastructures for managing events
 struct_expr.hData definitions for expressions and expression trees
 struct_heur.hDatastructures for primal heuristics
 struct_history.hDatastructures for branching and inference history
 struct_implics.hDatastructures for implications, variable bounds, and cliques
 struct_lp.hDatastructures for LP management
 struct_matrix.hData structure for MIP matrix
 struct_mem.hDatastructures for block memory pools and memory buffers
 struct_message.hDatastructures for problem statistics
 struct_misc.hMiscellaneous datastructures
 struct_nlp.hDatastructures for NLP management
 struct_nlpi.hData definitions for an NLP solver interface
 struct_nodesel.hDatastructures for node selectors and node priority queues
 struct_paramset.hDatastructures for handling parameter settings
 struct_presol.hDatastructures for presolvers
 struct_pricer.hDatastructures for variable pricers
 struct_pricestore.hDatastructures for storing priced variables
 struct_primal.hDatastructures for collecting primal CIP solutions and primal informations
 struct_prob.hDatastructures for storing and manipulating the main problem
 struct_prop.hDatastructures for propagators
 struct_reader.hDatastructures for input file readers
 struct_relax.hDatastructures for relaxators
 struct_reopt.hData structures for collecting reoptimization information
 struct_scip.hSCIP main data structure
 struct_sepa.hDatastructures for separators
 struct_sepastore.hDatastructures for storing separated cuts
 struct_set.hDatastructures for global SCIP settings
 struct_sol.hDatastructures for storing primal CIP solutions
 struct_stat.hDatastructures for problem statistics
 struct_tree.hDatastructures for branch and bound tree
 struct_var.hDatastructures for problem variables
 struct_visual.hDatastructures for output for visualization tools (VBC, BAK)
 tclique.hTclique user interface
 tclique_branch.cBranch and bound part of algorithm for maximum cliques
 tclique_coloring.cColoring part of algorithm for maximum cliques
 tclique_coloring.hColoring part of algorithm for maximum cliques
 tclique_def.hTclique defines
 tclique_graph.cGraph data part of algorithm for maximum cliques
 tree.cMethods for branch and bound tree
 tree.hInternal methods for branch and bound tree
 type_branch.hType definitions for branching rules
 type_clock.hType definitions for clocks and timing issues
 type_compr.hType definitions for tree compression
 type_conflict.hType definitions for conflict analysis
 type_cons.hType definitions for constraints and constraint handlers
 type_cutpool.hType definitions for storing cuts in a cut pool
 type_dialog.hType definitions for user interface dialog
 type_disp.hType definitions for displaying runtime statistics
 type_event.hType definitions for managing events
 type_expr.hType definitions for expressions and expression trees
 type_exprinterpret.hType definitions for expression interpreter
 type_heur.hType definitions for primal heuristics
 type_history.hType definitions for branching and inference history
 type_implics.hType definitions for implications, variable bounds, and cliques
 type_interrupt.hType definitions for catching the user CTRL-C interrupt
 type_lp.hType definitions for LP management
 type_lpi.hType definitions for specific LP solvers interface
 type_matrix.hType definitions for MIP matrix
 type_mem.hType definitions for block memory pools and memory buffers
 type_message.hType definitions for message output methods
 type_misc.hType definitions for miscellaneous datastructures
 type_nlp.hType definitions for NLP management
 type_nlpi.hType definitions for specific NLP solver interfaces
 type_nodesel.hType definitions for node selectors
 type_objcloneable.hFunction type definitions for clonable classes
 type_objprobcloneable.hFunction type definitions for clonable classes which define problem data
 type_paramset.hType definitions for handling parameter settings
 type_presol.hType definitions for presolvers
 type_pricer.hType definitions for variable pricers
 type_pricestore.hType definitions for storing priced variables
 type_primal.hType definitions for collecting primal CIP solutions and primal informations
 type_prob.hType definitions for storing and manipulating the main problem
 type_prop.hType definitions for propagators
 type_reader.hType definitions for input file readers
 type_relax.hType definitions for relaxators
 type_reopt.hType definitions for collecting reoptimization information
 type_result.hResult codes for SCIP callback methods
 type_retcode.hType definitions for return codes for SCIP methods
 type_scip.hType definitions for SCIP's main datastructure
 type_sepa.hType definitions for separators
 type_sepastore.hType definitions for storing separated cuts
 type_set.hType definitions for global SCIP settings
 type_sol.hType definitions for storing primal CIP solutions
 type_stat.hType definitions for problem statistics
 type_timing.hTiming definitions for SCIP
 type_tree.hType definitions for branch and bound tree
 type_var.hType definitions for problem variables
 type_visual.hType definitions for output for visualization tools (VBC, BAK)
 var.cMethods for problem variables
 var.hInternal methods for problem variables
 visual.cMethods for creating output for visualization tools (VBC, BAK)
 visual.hMethods for creating output for visualization tools (VBC, BAK)
 xml.hDeclarations for XML parsing
 xmldef.hDefinitions for XML parsing
 xmlparse.c
 xternal.cMain document page