SCIP Doxygen Documentation
 
Loading...
Searching...
No Matches
File List
Here is a list of all files with brief descriptions:
[detail level 1234]
  applications
  blockmemshell
  dijkstra
  doc
  examplesThis directory contains all coding examples, see Example projects for more information
  lpi
  objscip
  scripts
  symmetry
  tclique
  tpi
  xml
 CHANGELOG
 cppmain.cpp
 main.c
 bandit.cInternal API of bandit algorithms and bandit virtual function tables
 bandit.hInternal methods for bandit algorithms
 bandit_epsgreedy.cImplementation of (a variant of) epsilon greedy bandit algorithm
 bandit_epsgreedy.hInternal methods for epsilon greedy bandit selection
 bandit_exp3.cMethods for Exp.3 bandit selection
 bandit_exp3.hInternal methods for Exp.3 bandit algorithm
 bandit_exp3ix.cMethods for Exp.3-IX bandit selection
 bandit_exp3ix.hInternal methods for Exp.3-IX bandit algorithm
 bandit_ucb.cMethods for UCB bandit selection
 bandit_ucb.hInternal methods for UCB bandit algorithm
 benders.cMethods for Benders' decomposition
 benders.hInternal methods for Benders' decomposition
 benders_default.cDefault Benders' decomposition plugin
 benders_default.hDefault Benders' decomposition plugin
 benderscut.cMethods for Benders' decomposition cut
 benderscut.hInternal methods for Benders' decomposition cuts
 benderscut_feas.cStandard feasibility cuts for Benders' decomposition
 benderscut_feas.hStandard feasibility cuts for Benders' decomposition
 benderscut_feasalt.cAlternative feasibility cuts for Benders' decomposition
 benderscut_feasalt.hAlternative feasibility cuts for Benders' decomposition
 benderscut_int.cGenerates a Laporte and Louveaux Benders' decomposition integer cut
 benderscut_int.hGenerates a Laporte and Louveaux Benders' decomposition integer cut
 benderscut_nogood.cGenerates a no good cut for integer solutions that are infeasible for the subproblems
 benderscut_nogood.hGenerates a no-good cut for solutions that are integer infeasible
 benderscut_opt.cGenerates a standard Benders' decomposition optimality cut
 benderscut_opt.hGenerates a standard Benders' decomposition optimality cut
 bendersdefcuts.cDefault cuts for Benders' decomposition
 bendersdefcuts.h
 bitencode.cPacking single and dual bit values
 bitencode.hPacking single and dual bit values
 boundstore.cImplementation of the bound store datastructure
 boundstore.hInterface of the boundstore structure
 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_gomory.cGomory cut branching rule
 branch_gomory.hGomory cut 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_lookahead.cLookahead LP branching rule
 branch_lookahead.hLookahead 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
 branch_vanillafullstrong.cVanilla full strong LP branching rule
 branch_vanillafullstrong.hVanilla full strong LP branching rule
 clock.cMethods for clocks and timing issues
 clock.hInternal methods for clocks and timing issues
 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
 concsolver.cMethods for concurrent solvers
 concsolver.hDatastructures for concurrent solvers
 concsolver_scip.cImplementation of concurrent solver interface for SCIP
 concsolver_scip.hImplementation of concurrent solver interface for SCIP
 concurrent.cHelper functions for concurrent SCIP solvers
 concurrent.hHelper functions for concurrent scip solvers
 conflict.hInternal methods for conflict analysis
 conflict_dualproofanalysis.cInternal methods for dual proof conflict analysis
 conflict_dualproofanalysis.hInternal methods for dual proof conflict analysis
 conflict_general.cMethods and datastructures for conflict analysis
 conflict_general.hMethods and datastructures for conflict analysis
 conflict_graphanalysis.cMethods and datastructures for conflict analysis
 conflict_graphanalysis.hMethods and datastructures for conflict analysis
 conflictstore.cMethods for storing conflicts
 conflictstore.hInternal methods for storing conflicts
 cons.cMethods for constraints and constraint handlers
 cons.hInternal methods for constraints and constraint handlers
 cons_abspower.cSome API functions of removed constraint handler for absolute power constraints \(\textrm{lhs} \leq \textrm{sign}(x+a) |x+a|^n + c z \leq \textrm{rhs}\)
 cons_abspower.hSome API functions of removed constraint 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_benders.cConstraint handler for Benders' decomposition
 cons_benders.hConstraint handler for Benders' decomposition
 cons_benderslp.cConstraint handler for benderslp decomposition
 cons_benderslp.hConstraint handler for benderslp decomposition
 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_cardinality.cConstraint handler for cardinality constraints
 cons_cardinality.hConstraint handler for cardinality constraints
 cons_components.cConstraint handler for handling independent components
 cons_components.hConstraint handler for handling independent components
 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 a linking (continuous or 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 specified by algebraic expressions
 cons_nonlinear.hConstraint handler for nonlinear constraints specified by algebraic expressions
 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_orbisack.cConstraint handler for orbisack constraints
 cons_orbisack.hConstraint handler for orbisack constraints
 cons_orbitope.cConstraint handler for (partitioning/packing/full) orbitope constraints w.r.t. the full symmetric group
 cons_orbitope.hConstraint handler for (partitioning/packing/full) 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.cSome API functions of removed constraint handler for quadratic constraints \(\textrm{lhs} \leq \sum_{i,j} a_{i,j} x_i x_j + \sum_i b_i x_i \leq \textrm{rhs}\)
 cons_quadratic.hSome API functions of removed constraint handler for quadratic constraints \(\textrm{lhs} \leq \sum_{i,j} a_{i,j} x_ix_j + \sum_i 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.cSome API functions of removed constraint 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.hSome API functions of removed constraint 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_symresack.cConstraint handler for symresack constraints
 cons_symresack.hConstraint handler for symresack constraints
 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\)
 cutpool.cMethods for storing cuts in a cut pool
 cutpool.hInternal methods for storing cuts in a cut pool
 cuts.cMethods for aggregation of rows
 cuts.hMethods for the aggregation rows
 cutsel.cMethods for cut selectors
 cutsel.hInternal methods for cut selectors
 cutsel_dynamic.cDynamic cut selector
 cutsel_dynamic.hDynamic cut selector
 cutsel_ensemble.cEnsemble cut selector
 cutsel_ensemble.hEnsemble cut selector
 cutsel_hybrid.cHybrid cut selector
 cutsel_hybrid.hHybrid cut selector
 dbldblarith.hDefines macros for basic operations in double-double arithmetic giving roughly twice the precision of a double
 dcmp.cInternal methods for decompositions and the decomposition store
 dcmp.hInternal methods for decompositions and the decomposition store
 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
 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
 event.cMethods and datastructures for managing events
 event.hInternal methods for managing events
 event_estim.cEvent handler for tree size estimation and restarts
 event_estim.hEvent handler for tree size estimation and restarts
 event_globalbnd.cEventhandler for storing all global bound changes
 event_globalbnd.hEventhdlr for storing all global bound changes
 event_shadowtree.cEvent handler for maintaining the unmodified branch-and-bound tree
 event_shadowtree.h
 event_softtimelimit.cEventhdlr for soft time limit
 event_softtimelimit.hEventhdlr for soft time limit
 event_solvingphase.cEvent handler for solving phase dependent parameter adjustment
 event_solvingphase.hEventhdlr for solving phase dependent parameter adjustment
 expr.cFunctions for algebraic expressions
 expr.hPrivate functions to work with algebraic expressions
 expr_abs.cAbsolute expression handler
 expr_abs.hAbsolute expression handler
 expr_entropy.cHandler for -x*log(x) expressions
 expr_entropy.hHandler for -x*log(x) expressions
 expr_erf.cHandler for Gaussian error function expressions
 expr_erf.hHandler for Gaussian error function expressions
 expr_exp.cExponential expression handler
 expr_exp.hExponential expression handler
 expr_log.cLogarithm expression handler
 expr_log.hLogarithm expression handler
 expr_pow.cPower expression handler
 expr_pow.hPower and signed power expression handlers
 expr_product.cProduct expression handler
 expr_product.hProduct expression handler
 expr_sum.cSum expression handler
 expr_sum.hSum expression handler
 expr_trig.cHandler for sine and cosine expressions
 expr_trig.hHandler for sin expressions
 expr_value.cConstant value expression handler
 expr_value.hConstant value expression handler
 expr_var.cVariable expression handler
 expr_var.hVariable expression handler
 expr_varidx.cHandler for variable index expressions
 expr_varidx.hHandler for variable index expressions
 exprcurv.cFunctions to work with curvature (convex, concave, etc)
 exprinterpret.hMethods to interpret (evaluate) an expression "fast"
 exprinterpret_cppad.cppMethods to interpret (evaluate) an expression "fast" using CppAD
 exprinterpret_none.cFunction definitions for nonexisting expression interpreter to resolve linking references
 expriter.cFunctions for iterating over algebraic expressions
 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_adaptivediving.cDiving heuristic that selects adaptively between the existing, public dive sets
 heur_adaptivediving.hDiving heuristic that selects adaptively between the existing, public dive sets
 heur_alns.cAdaptive large neighborhood search heuristic that orchestrates popular LNS heuristics
 heur_alns.hAdaptive large neighborhood search heuristic that orchestrates popular LNS heuristics
 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_completesol.cCOMPLETESOL - primal heuristic trying to complete given partial solutions
 heur_completesol.hPrimal heuristic trying to complete given partial solutions
 heur_conflictdiving.cLP diving heuristic that chooses fixings w.r.t. conflict locks
 heur_conflictdiving.hLP diving heuristic that chooses fixings w.r.t. conflict locks
 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_dps.cDynamic partition search
 heur_dps.hDynamic partition search
 heur_dualval.cDualval primal heuristic
 heur_dualval.hPrimal heuristic that uses dualvalues for successive switching variable values
 heur_farkasdiving.cLP diving heuristic that tries to construct a Farkas-proof
 heur_farkasdiving.hLP diving heuristic that tries to construct a Farkas-proof
 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_gins.cLNS heuristic that tries to delimit the search region to a neighborhood in the constraint graph
 heur_gins.hLNS heuristic that tries to delimit the search region to a neighborhood in the constraint graph
 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_indicatordiving.cLP diving heuristic that fixes indicator variables controlling semicontinuous variables
 heur_indicatordiving.hLP diving heuristic that fixes indicator variables controlling semicontinuous 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_locks.cRounding locks primal heuristic
 heur_locks.hLocks primal heuristic
 heur_lpface.cLpface primal heuristic that searches the optimal LP face inside a sub-MIP
 heur_lpface.hLNS heuristic that tries to compute integral solution on optimal LP face
 heur_mpec.cMpec primal heuristic
 heur_mpec.hMpec primal heuristic
 heur_multistart.cMultistart heuristic for convex and nonconvex MINLPs
 heur_multistart.hMultistart heuristic for convex and nonconvex MINLPs
 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_padm.cPADM primal heuristic
 heur_padm.hPADM primal heuristic
 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_repair.cRepair primal heuristic
 heur_repair.hRepair 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_scheduler.cAdaptive heuristic to schedule LNS and diving heuristics
 heur_scheduler.hAdaptive heuristic to schedule LNS and diving heuristics
 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_sync.cPrimal heuristic that adds solutions from synchronization
 heur_sync.hPrimal heuristic that adds given solutions
 heur_trivial.cTrivial primal heuristic
 heur_trivial.hTrivial primal heuristic
 heur_trivialnegation.cTrivialnegation primal heuristic
 heur_trivialnegation.hTrivialnegation primal heuristic
 heur_trustregion.cLarge neighborhood search heuristic for Benders' decomposition based on trust region methods
 heur_trustregion.hLarge neighborhood search heuristic for Benders' decomposition based on trust region methods
 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
 heuristics.cMethods commonly used by primal heuristics
 heuristics.hMethods commonly used by primal heuristics
 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
 lapack_calls.c
 lapack_calls.hInterface methods for lapack functions
 lp.cLP management methods and data structures
 lp.hInternal methods for LP management
 matrix.cMethods for MIP matrix data structure
 mem.cBlock memory pools and memory buffers
 mem.hMethods for block memory pools and memory buffers
 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
 misc_linear.cMiscellaneous methods for linear constraints
 misc_rowprep.cLinear inequalities in preparation
 nlhdlr.cFunctions for nonlinearity handlers of nonlinear constraint handler
 nlhdlr.hPrivate functions of nonlinear handlers of nonlinear constraints
 nlhdlr_bilinear.cBilinear nonlinear handler
 nlhdlr_bilinear.hBilinear nonlinear handler
 nlhdlr_convex.cNonlinear handlers for convex and concave expressions
 nlhdlr_convex.hNonlinear handlers for convex and concave expressions, respectively
 nlhdlr_default.cDefault nonlinear handler that calls expression handler methods
 nlhdlr_default.hDefault nonlinear handler that calls expression handler methods
 nlhdlr_perspective.cPerspective nonlinear handler
 nlhdlr_perspective.hPerspective nonlinear handler
 nlhdlr_quadratic.cNonlinear handler to handle quadratic expressions
 nlhdlr_quadratic.hNonlinear handler to handle quadratic expressions
 nlhdlr_quotient.cQuotient nonlinear handler
 nlhdlr_quotient.hQuotient nonlinear handler
 nlhdlr_signomial.cSignomial nonlinear handler
 nlhdlr_signomial.hSignomial nonlinear handler
 nlhdlr_soc.cNonlinear handler for second order cone constraints
 nlhdlr_soc.hSoc nonlinear handler
 nlp.cNLP management methods
 nlp.hInternal methods for NLP management
 nlpi.cMethods for handling NLP solver interface
 nlpi.hInternal methods for NLP solver interfaces
 nlpi_all.cNLP interface that uses all available NLP interfaces
 nlpi_all.hNLP interface that uses all available NLP interfaces
 nlpi_filtersqp.cFilterSQP NLP interface
 nlpi_filtersqp.hFilterSQP NLP interface
 nlpi_filtersqp_dummy.cDummy filterSQP NLP interface for the case that FilterSQP is not available
 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
 nlpi_worhp.cWorhp NLP interface
 nlpi_worhp.hWorhp NLP interface
 nlpi_worhp_dummy.cDummy WORHP NLP interface
 nlpioracle.cImplementation of NLPI oracle
 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
 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_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_dualcomp.cDual compensation presolver
 presol_dualcomp.hDual compensation presolver
 presol_dualinfer.cDual inference presolver
 presol_dualinfer.hDual inference presolver
 presol_dualsparsify.cCancel nonzeros of the constraint matrix based on the columns
 presol_dualsparsify.hCancel nonzeros of the constraint matrix based on the columns
 presol_gateextraction.cGateextraction presolver
 presol_gateextraction.hGateextraction presolver
 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_milp.cppMILP presolver
 presol_milp.hMILP presolver that calls the presolve library on the constraint matrix
 presol_qpkktref.cQpkktref presolver
 presol_qpkktref.hQpkktref presolver
 presol_redvub.cRemove redundant variable upper bound constraints
 presol_redvub.hRemove redundant variable upper bound constraints
 presol_sparsify.cCancel non-zeros of the constraint matrix
 presol_sparsify.hCancel non-zeros of the constraint matrix
 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.hMethods commonly used 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_nlobbt.cNlobbt propagator
 prop_nlobbt.hNonlinear OBBT 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_symmetry.cPropagator for handling symmetries
 prop_symmetry.hPropagator for symmetry handling
 prop_sync.cPropagator for applying global bound changes that were communicated by other concurrent solvers
 prop_sync.hPropagator for applying global bound changes that were communicated by other concurrent solvers
 prop_vbounds.cVariable upper and lower bound propagator
 prop_vbounds.hVariable upper and lower bound propagator
 pub_bandit.hPublic methods for bandit algorithms
 pub_bandit_epsgreedy.hPublic methods for the epsilon greedy bandit selector
 pub_bandit_exp3.hPublic methods for Exp.3
 pub_bandit_exp3ix.hPublic methods for Exp.3-IX
 pub_bandit_ucb.hPublic methods for UCB bandit selection
 pub_benders.hPublic methods for Benders' decomposition
 pub_benderscut.hPublic methods for Benders' decomposition cuts
 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_cutsel.hPublic methods for cut selectors
 pub_dcmp.hPublic methods for decompositions
 pub_dialog.hPublic methods for user interface dialog
 pub_disp.hPublic methods for displaying runtime statistics
 pub_event.hPublic methods for managing events
 pub_expr.hPublic functions to work with algebraic expressions
 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_misc_linear.hInternal miscellaneous methods for linear constraints
 pub_misc_rowprep.hPreparation of a linear inequality to become a SCIP_ROW
 pub_misc_select.hMethods for selecting (weighted) k-medians
 pub_misc_sort.hMethods for sorting joint arrays of various types
 pub_nlhdlr.hPublic functions of nonlinear handlers of nonlinear constraints
 pub_nlp.hPublic methods for NLP management
 pub_nlpi.hPublic methods for NLP solver interfaces
 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_table.hPublic methods for displaying statistic tables
 pub_tree.hPublic methods for branch and bound tree
 pub_var.hPublic methods for problem variables
 rbtree.cIntrusive red black tree datastructure
 rbtree.hIntrusive red black tree datastructure
 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_cor.cCOR file reader (MPS format of the core problem for stochastic programs)
 reader_cor.hCOR file reader (MPS format of the core problem for stochastic programs)
 reader_dec.cFile reader for decompositions in the constraint based dec-file format
 reader_dec.hFile reader for decompositions in the constraint based dec-file format
 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_mst.cFile reader for partial primal solutions (like MIP-start of Cplex)
 reader_mst.hFile reader for partial primal solutions
 reader_nl.cppAMPL .nl file reader
 reader_nl.hAMPL .nl 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_smps.cSMPS file reader - smps files list the cor, tim and sto files for a single instance
 reader_smps.hSMPS file reader - SMPS files lists the cor, tim and sto files for a single instance to be read
 reader_sol.cFile reader for primal solutions
 reader_sol.hFile reader for primal solutions
 reader_sto.cSTO file reader - the stochastic information of an instance in SMPS format
 reader_sto.hSTO file reader - the stochastic information of an instance in SMPS format
 reader_tim.cTIM file reader - the stage information for a stochastic programming instance in SMPS format
 reader_tim.hTIM file reader - the stage information for a stochastic programming instance in SMPS format
 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.hSCIP callable library
 scip_bandit.cPublic functions for bandit algorithms
 scip_bandit.hPublic methods for bandit algorithms
 scip_benders.cPublic methods for Benders decomposition
 scip_benders.hPublic methods for Benders decomposition
 scip_branch.cPublic methods for branching rule plugins and branching
 scip_branch.hPublic methods for branching rule plugins and branching
 scip_compr.cPublic methods for compression plugins
 scip_compr.hPublic methods for compression plugins
 scip_concurrent.cPublic methods for concurrent solving mode
 scip_concurrent.hPublic methods for concurrent solving mode
 scip_conflict.cPublic methods for conflict handler plugins and conflict analysis
 scip_conflict.hPublic methods for conflict handler plugins and conflict analysis
 scip_cons.cPublic methods for constraint handler plugins and constraints
 scip_cons.hPublic methods for constraint handler plugins and constraints
 scip_copy.cPublic methods for problem copies
 scip_copy.hPublic methods for problem copies
 scip_cut.cPublic methods for cuts and aggregation rows
 scip_cut.hPublic methods for cuts and aggregation rows
 scip_cutsel.cPublic methods for cut selector plugins
 scip_cutsel.hPublic methods for cut selector plugins
 scip_datastructures.cPublic methods for data structures
 scip_datastructures.hPublic methods for data structures
 scip_dcmp.cMethods for working with decompositions
 scip_dcmp.hPublic methods for decompositions
 scip_debug.cPublic methods for debugging
 scip_debug.hPublic methods for debugging
 scip_dialog.cPublic methods for dialog handler plugins
 scip_dialog.hPublic methods for dialog handler plugins
 scip_disp.cPublic methods for display handler plugins
 scip_disp.hPublic methods for display handler plugins
 scip_event.cPublic methods for event handler plugins and event handlers
 scip_event.hPublic methods for event handler plugins and event handlers
 scip_expr.cPublic functions to work with algebraic expressions
 scip_expr.hPublic functions to work with algebraic expressions
 scip_general.cGeneral public methods
 scip_general.hGeneral public methods
 scip_heur.cPublic methods for primal heuristic plugins and divesets
 scip_heur.hPublic methods for primal heuristic plugins and divesets
 scip_lp.cPublic methods for the LP relaxation, rows and columns
 scip_lp.hPublic methods for the LP relaxation, rows and columns
 scip_mem.cPublic methods for memory management
 scip_mem.hPublic methods for memory management
 scip_message.cPublic methods for message handling
 scip_message.hPublic methods for message handling
 scip_nlp.cPublic methods for nonlinear relaxation
 scip_nlp.hPublic methods for nonlinear relaxation
 scip_nlpi.cPublic methods for NLP interfaces
 scip_nlpi.hPublic methods for NLPI solver interfaces
 scip_nodesel.cPublic methods for node selector plugins
 scip_nodesel.hPublic methods for node selector plugins
 scip_numerics.cPublic methods for numerical tolerances
 scip_numerics.hPublic methods for numerical tolerances
 scip_param.cPublic methods for SCIP parameter handling
 scip_param.hPublic methods for SCIP parameter handling
 scip_presol.cPublic methods for presolving plugins
 scip_presol.hPublic methods for presolving plugins
 scip_pricer.cPublic methods for variable pricer plugins
 scip_pricer.hPublic methods for variable pricer plugins
 scip_prob.cPublic methods for global and local (sub)problems
 scip_prob.hPublic methods for global and local (sub)problems
 scip_probing.cPublic methods for the probing mode
 scip_probing.hPublic methods for the probing mode
 scip_prop.cPublic methods for propagator plugins
 scip_prop.hPublic methods for propagator plugins
 scip_randnumgen.cPublic methods for random numbers
 scip_randnumgen.hPublic methods for random numbers
 scip_reader.cPublic methods for reader plugins
 scip_reader.hPublic methods for reader plugins
 scip_relax.cPublic methods for relaxator plugins
 scip_relax.hPublic methods for relaxator plugins
 scip_reopt.cPublic methods for reoptimization
 scip_reopt.hPublic methods for reoptimization
 scip_sepa.cPublic methods for separator plugins
 scip_sepa.hPublic methods for separator plugins
 scip_sol.cPublic methods for solutions
 scip_sol.hPublic methods for solutions
 scip_solve.cPublic solving methods
 scip_solve.hPublic solving methods
 scip_solvingstats.cPublic methods for querying solving statistics
 scip_solvingstats.hPublic methods for querying solving statistics
 scip_table.cPublic methods for statistics table plugins
 scip_table.hPublic methods for statistics table plugins
 scip_timing.cPublic methods for timing
 scip_timing.hPublic methods for timing
 scip_tree.cPublic methods for the branch-and-bound tree
 scip_tree.hPublic methods for the branch-and-bound tree
 scip_validation.cPublic methods for validation
 scip_validation.hPublic methods for validation
 scip_var.cPublic methods for SCIP variables
 scip_var.hPublic methods for SCIP variables
 scipbuildflags.cBuild flags methods
 scipbuildflags.hBuild flags methods
 scipcoreplugins.cRegister additional core functionality designed as plugins
 scipcoreplugins.hRegister additional core functionality that is designed as plugins
 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_aggregation.cFlow cover and complemented mixed integer rounding cuts separator (Marchand's version)
 sepa_aggregation.hFlow cover and complemented mixed integer rounding cuts separator (Marchand's version)
 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_convexproj.cConvexproj separator
 sepa_convexproj.hConvexproj separator
 sepa_disjunctive.cDisjunctive cut separator
 sepa_disjunctive.hDisjunctive cut separator
 sepa_eccuts.cEdge concave cut separator
 sepa_eccuts.hEdge concave cut separator
 sepa_gauge.cGauge separator
 sepa_gauge.hGauge separator
 sepa_gomory.cGomory MIR Cuts
 sepa_gomory.hGomory MIR Cuts
 sepa_impliedbounds.cImplied bounds separator
 sepa_impliedbounds.hImplied bounds separator
 sepa_interminor.cMinor separator with intersection cuts
 sepa_interminor.h
 sepa_intobj.cInteger objective value separator
 sepa_intobj.hInteger objective value separator
 sepa_lagromory.cLagromory separator
 sepa_lagromory.hLagromory separator
 sepa_mcf.cMulti-commodity-flow network cut separator
 sepa_mcf.hMulti-commodity-flow network cut separator
 sepa_minor.cPrincipal minor separator
 sepa_minor.hPrincipal minor separator
 sepa_mixing.cMixing/star inequality separator
 sepa_mixing.hMixing cuts separator
 sepa_oddcycle.cOddcycle separator
 sepa_oddcycle.hOddcycle separator
 sepa_rapidlearning.cRapidlearning separator
 sepa_rapidlearning.hRapidlearning separator
 sepa_rlt.cSeparator for cuts generated by Reformulation-Linearization-Technique (RLT)
 sepa_rlt.hReformulation-linearization technique separator
 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_bandit.hData structures for bandit selection algorithms
 struct_benders.hData structures required for Benders' decomposition
 struct_benderscut.hDatastructures for Benders' decomposition cuts techniques
 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_concsolver.hDatastructures for concurrent solvers
 struct_concurrent.hConcurrent data struct
 struct_conflict.hDatastructures for conflict analysis
 struct_conflictstore.h
 struct_cons.hDatastructures for constraints and constraint handlers
 struct_cutpool.hDatastructures for storing cuts in a cut pool
 struct_cuts.hStruct definitions for cuts
 struct_cutsel.hData structures for cut selectors
 struct_dcmp.hData structures for a decomposition and a decomposition store
 struct_dialog.hData structures for user interface dialog
 struct_disp.hData structures for displaying runtime statistics
 struct_event.hDatastructures for managing events
 struct_expr.hStructure definitions related to algebraic expressions
 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.hData structures 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_nlhdlr.hStructure definitions related to nonlinear handlers of nonlinear constraints
 struct_nlp.hDatastructures for NLP management
 struct_nlpi.hData definitions for an NLP solver interface
 struct_nodesel.hData structures for node selectors and node priority queues
 struct_paramset.hDatastructures for handling parameter settings
 struct_presol.hDatastructures for presolvers
 struct_pricer.hData structures for variable pricers
 struct_pricestore.hData structures 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.hData structures 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 conflicts
 struct_set.hDatastructures for global SCIP settings
 struct_sol.hDatastructures for storing primal CIP solutions
 struct_stat.hDatastructures for problem statistics
 struct_syncstore.hStruct definitions for the synchronization store
 struct_table.hData structures for displaying statistics tables
 struct_tree.hData structures for branch and bound tree
 struct_var.hDatastructures for problem variables
 struct_visual.hData structures for output for visualization tools (VBC, BAK)
 symmetry.cMethods for handling symmetries
 symmetry.hMethods for handling symmetries
 symmetry_graph.cMethods for dealing with symmetry detection graphs
 symmetry_graph.hMethods for dealing with symmetry detection graphs
 symmetry_lexred.cMethods for handling symmetries by dynamic lexicographic ordering reduction
 symmetry_lexred.hMethods for handling symmetries by dynamic lexicographic ordering reduction
 symmetry_orbital.cMethods for handling symmetries by orbital reduction
 symmetry_orbital.h
 symmetry_orbitopal.cMethods for handling orbitopal symmetries
 symmetry_orbitopal.h
 syncstore.cFunction definitions of the synchronization store
 syncstore.hFunction declarations for the synchronization store
 table.cMethods and datastructures for displaying statistics tables
 table.hInternal methods for displaying statistics tables
 table_default.cDefault statistics tables
 table_default.hDefault statistics tables
 tree.cMethods for branch and bound tree
 tree.hInternal methods for branch and bound tree
 treemodel.cBranching rules based on the Single-Variable-Branching (SVB) model
 treemodel.hBranching rules based on the Single-Variable-Branching (SVB) model
 type_bandit.hType definitions for bandit selection algorithms
 type_benders.hType definitions for Benders' decomposition methods
 type_benderscut.hType definitions for Benders' decomposition cut
 type_branch.hType definitions for branching rules
 type_clock.hType definitions for clocks and timing issues
 type_compr.hType definitions for tree compression
 type_concsolver.hType definitions for concurrent solvers
 type_concurrent.hType definition of concurrent data
 type_conflict.hType definitions for conflict analysis
 type_conflictstore.hType definitions for conflict store
 type_cons.hType definitions for constraints and constraint handlers
 type_cutpool.hType definitions for storing cuts in a cut pool
 type_cuts.hType definitions for cuts
 type_cutsel.hType definitions for cut selectors
 type_dcmp.hType definitions for decompositions and the decomposition store
 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 and macro definitions related to algebraic expressions
 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_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_nlhdlr.hType definitions related to nonlinear handlers of nonlinear constraints
 type_nlp.hType definitions for NLP management
 type_nlpi.hType definitions for NLP solver interfaces
 type_nodesel.hType definitions for node selectors
 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_syncstore.hType definitions for the synchronization store
 type_table.hType definitions for displaying statistics tables
 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)