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
 
examples
This directory contains all coding examples, see Example projects for more information
 
lpi
 
objscip
 
scripts
 
symmetry
 
tclique
 
tpi
 
xml
 
CHANGELOG
 
cppmain.cpp
 
main.c
 
bandit.c
Internal API of bandit algorithms and bandit virtual function tables
 
bandit.h
Internal methods for bandit algorithms
 
bandit_epsgreedy.c
Implementation of (a variant of) epsilon greedy bandit algorithm
 
bandit_epsgreedy.h
Internal methods for epsilon greedy bandit selection
 
bandit_exp3.c
Methods for Exp.3 bandit selection
 
bandit_exp3.h
Internal methods for Exp.3 bandit algorithm
 
bandit_exp3ix.c
Methods for Exp.3-IX bandit selection
 
bandit_exp3ix.h
Internal methods for Exp.3-IX bandit algorithm
 
bandit_ucb.c
Methods for UCB bandit selection
 
bandit_ucb.h
Internal methods for UCB bandit algorithm
 
benders.c
Methods for Benders' decomposition
 
benders.h
Internal methods for Benders' decomposition
 
benders_default.c
Default Benders' decomposition plugin
 
benders_default.h
Default Benders' decomposition plugin
 
benderscut.c
Methods for Benders' decomposition cut
 
benderscut.h
Internal methods for Benders' decomposition cuts
 
benderscut_feas.c
Standard feasibility cuts for Benders' decomposition
 
benderscut_feas.h
Standard feasibility cuts for Benders' decomposition
 
benderscut_feasalt.c
Alternative feasibility cuts for Benders' decomposition
 
benderscut_feasalt.h
Alternative feasibility cuts for Benders' decomposition
 
benderscut_int.c
Generates a Laporte and Louveaux Benders' decomposition integer cut
 
benderscut_int.h
Generates a Laporte and Louveaux Benders' decomposition integer cut
 
benderscut_nogood.c
Generates a no good cut for integer solutions that are infeasible for the subproblems
 
benderscut_nogood.h
Generates a no-good cut for solutions that are integer infeasible
 
benderscut_opt.c
Generates a standard Benders' decomposition optimality cut
 
benderscut_opt.h
Generates a standard Benders' decomposition optimality cut
 
bendersdefcuts.c
Default cuts for Benders' decomposition
 
bendersdefcuts.h
 
bitencode.c
Packing single and dual bit values
 
bitencode.h
Packing single and dual bit values
 
boundstore.c
Implementation of the bound store datastructure
 
boundstore.h
Interface of the boundstore structure
 
branch.c
Methods for branching rules and branching candidate storage
 
branch.h
Internal methods for branching rules and branching candidate storage
 
branch_allfullstrong.c
All variables full strong LP branching rule
 
branch_allfullstrong.h
All variables full strong LP branching rule
 
branch_cloud.c
Cloud branching rule
 
branch_cloud.h
Cloud branching rule
 
branch_distribution.c
Probability based branching rule based on an article by J. Pryor and J.W. Chinneck
 
branch_distribution.h
Probability based branching rule based on an article by J. Pryor and J.W. Chinneck
 
branch_fullstrong.c
Full strong LP branching rule
 
branch_fullstrong.h
Full strong LP branching rule
 
branch_gomory.c
Gomory cut branching rule
 
branch_gomory.h
Gomory cut branching rule
 
branch_inference.c
Inference history branching rule
 
branch_inference.h
Inference history branching rule
 
branch_leastinf.c
Least infeasible LP branching rule
 
branch_leastinf.h
Least infeasible LP branching rule
 
branch_lookahead.c
Lookahead LP branching rule
 
branch_lookahead.h
Lookahead LP branching rule
 
branch_mostinf.c
Most infeasible LP branching rule
 
branch_mostinf.h
Most infeasible LP branching rule
 
branch_multaggr.c
Fullstrong branching on fractional and multi-aggregated variables
 
branch_multaggr.h
Fullstrong branching on fractional and multi-aggregated variables
 
branch_nodereopt.c
Branching rule to reconstruct the search tree
 
branch_nodereopt.h
Nodereopt branching rule
 
branch_pscost.c
Pseudo costs branching rule
 
branch_pscost.h
Pseudo costs branching rule
 
branch_random.c
Random variable branching rule
 
branch_random.h
Random variable branching rule
 
branch_relpscost.c
Reliable pseudo costs branching rule
 
branch_relpscost.h
Reliable pseudo costs branching rule
 
branch_vanillafullstrong.c
Vanilla full strong LP branching rule
 
branch_vanillafullstrong.h
Vanilla full strong LP branching rule
 
clock.c
Methods for clocks and timing issues
 
clock.h
Internal methods for clocks and timing issues
 
compr.c
Methods for tree compressions
 
compr.h
Internal methods for tree compressions
 
compr_largestrepr.c
Largestrepr tree compression
 
compr_largestrepr.h
Largestrepr tree compression
 
compr_weakcompr.c
Weakcompr tree compression
 
compr_weakcompr.h
Weakcompr tree compression
 
concsolver.c
Methods for concurrent solvers
 
concsolver.h
Datastructures for concurrent solvers
 
concsolver_scip.c
Implementation of concurrent solver interface for SCIP
 
concsolver_scip.h
Implementation of concurrent solver interface for SCIP
 
concurrent.c
Helper functions for concurrent SCIP solvers
 
concurrent.h
Helper functions for concurrent scip solvers
 
conflict.h
Internal methods for conflict analysis
 
conflict_dualproofanalysis.c
Internal methods for dual proof conflict analysis
 
conflict_dualproofanalysis.h
Internal methods for dual proof conflict analysis
 
conflict_general.c
Methods and datastructures for conflict analysis
 
conflict_general.h
Methods and datastructures for conflict analysis
 
conflict_graphanalysis.c
Methods and datastructures for conflict analysis
 
conflict_graphanalysis.h
Methods and datastructures for conflict analysis
 
conflictstore.c
Methods for storing conflicts
 
conflictstore.h
Internal methods for storing conflicts
 
cons.c
Methods for constraints and constraint handlers
 
cons.h
Internal methods for constraints and constraint handlers
 
cons_abspower.c
Some 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.h
Some 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.c
Constraint handler for AND-constraints, \(r = x_1 \wedge x_2 \wedge \dots \wedge x_n\)
 
cons_and.h
Constraint handler for AND constraints, \(r = x_1 \wedge x_2 \wedge \dots \wedge x_n\)
 
cons_benders.c
Constraint handler for Benders' decomposition
 
cons_benders.h
Constraint handler for Benders' decomposition
 
cons_benderslp.c
Constraint handler for benderslp decomposition
 
cons_benderslp.h
Constraint handler for benderslp decomposition
 
cons_bounddisjunction.c
Constraint handler for bound disjunction constraints \((x_1 \{\leq,\geq\} b_1) \vee \ldots \vee (x_n \{\leq,\geq\} b_n)\)
 
cons_bounddisjunction.h
Constraint handler for bound disjunction constraints \((x_1 \{\leq,\geq\} b_1) \vee \ldots \vee (x_n \{\leq,\geq\} b_n)\)
 
cons_cardinality.c
Constraint handler for cardinality constraints
 
cons_cardinality.h
Constraint handler for cardinality constraints
 
cons_components.c
Constraint handler for handling independent components
 
cons_components.h
Constraint handler for handling independent components
 
cons_conjunction.c
Constraint handler for conjunction constraints
 
cons_conjunction.h
Constraint handler for conjunction constraints
 
cons_countsols.c
Constraint handler for counting feasible solutions
 
cons_countsols.h
Constraint handler for counting feasible solutions
 
cons_cumulative.c
Constraint handler for cumulative constraints
 
cons_cumulative.h
Constraint handler for cumulative constraints
 
cons_disjunction.c
Constraint handler for disjunction constraints
 
cons_disjunction.h
Constraint handler for disjunction constraints
 
cons_fixedvar.c
Constraint handler that checks bounds on fixed variables
 
cons_fixedvar.h
Constraint handler that checks bounds on fixed variables
 
cons_indicator.c
Constraint handler for indicator constraints
 
cons_indicator.h
Constraint handler for indicator constraints
 
cons_integral.c
Constraint handler for the integrality constraint
 
cons_integral.h
Constraint handler for the integrality constraint
 
cons_knapsack.c
Constraint handler for knapsack constraints of the form \(a^T x \le b\), x binary and \(a \ge 0\)
 
cons_knapsack.h
Constraint handler for knapsack constraints of the form \(a^T x \le b\), x binary and \(a \ge 0\)
 
cons_linear.c
Constraint handler for linear constraints in their most general form, \(lhs <= a^T x <= rhs\)
 
cons_linear.h
Constraint handler for linear constraints in their most general form, \(lhs <= a^T x <= rhs\)
 
cons_linking.c
Constraint handler for linking constraints
 
cons_linking.h
Constraint handler for linking binary variables to a linking (continuous or integer) variable
 
cons_logicor.c
Constraint handler for logic or constraints \(1^T x \ge 1\) (equivalent to set covering, but algorithms are suited for depth first search)
 
cons_logicor.h
Constraint handler for logicor constraints \(1^T x \ge 1\) (equivalent to set covering, but algorithms are suited for depth first search)
 
cons_nonlinear.c
Constraint handler for nonlinear constraints specified by algebraic expressions
 
cons_nonlinear.h
Constraint handler for nonlinear constraints specified by algebraic expressions
 
cons_or.c
Constraint handler for "or" constraints, \(r = x_1 \vee x_2 \vee \dots \vee x_n\)
 
cons_or.h
Constraint handler for "or" constraints, \(r = x_1 \vee x_2 \vee \dots \vee x_n\)
 
cons_orbisack.c
Constraint handler for orbisack constraints
 
cons_orbisack.h
Constraint handler for orbisack constraints
 
cons_orbitope.c
Constraint handler for (partitioning/packing/full) orbitope constraints w.r.t. the full symmetric group
 
cons_orbitope.h
Constraint handler for (partitioning/packing/full) orbitope constraints w.r.t. the full symmetric group
 
cons_pseudoboolean.c
Constraint handler for pseudo Boolean constraints
 
cons_pseudoboolean.h
Constraint handler for pseudoboolean constraints
 
cons_quadratic.c
Some 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.h
Some 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.c
Constraint handler for the set partitioning / packing / covering constraints \(1^T x\ \{=, \le, \ge\}\ 1\)
 
cons_setppc.h
Constraint handler for the set partitioning / packing / covering constraints \(1^T x\ \{=, \le, \ge\}\ 1\)
 
cons_soc.c
Some 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.h
Some 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.c
Constraint handler for SOS type 1 constraints
 
cons_sos1.h
Constraint handler for SOS type 1 constraints
 
cons_sos2.c
Constraint handler for SOS type 2 constraints
 
cons_sos2.h
Constraint handler for SOS type 2 constraints
 
cons_superindicator.c
Constraint handler for indicator constraints over arbitrary constraint types
 
cons_superindicator.h
Constraint handler for indicator constraints over arbitrary constraint types
 
cons_symresack.c
Constraint handler for symresack constraints
 
cons_symresack.h
Constraint handler for symresack constraints
 
cons_varbound.c
Constraint handler for variable bound constraints \(lhs \le x + c y \le rhs\)
 
cons_varbound.h
Constraint handler for variable bound constraints \(lhs \leq x + c y \leq rhs\)
 
cons_xor.c
Constraint handler for "xor" constraints, \(rhs = x_1 \oplus x_2 \oplus \dots \oplus x_n\)
 
cons_xor.h
Constraint handler for XOR constraints, \(rhs = x_1 \oplus x_2 \oplus \dots \oplus x_n\)
 
cutpool.c
Methods for storing cuts in a cut pool
 
cutpool.h
Internal methods for storing cuts in a cut pool
 
cuts.c
Methods for aggregation of rows
 
cuts.h
Methods for the aggregation rows
 
cutsel.c
Methods for cut selectors
 
cutsel.h
Internal methods for cut selectors
 
cutsel_dynamic.c
Dynamic cut selector
 
cutsel_dynamic.h
Dynamic cut selector
 
cutsel_ensemble.c
Ensemble cut selector
 
cutsel_ensemble.h
Ensemble cut selector
 
cutsel_hybrid.c
Hybrid cut selector
 
cutsel_hybrid.h
Hybrid cut selector
 
dbldblarith.h
Defines macros for basic operations in double-double arithmetic giving roughly twice the precision of a double
 
dcmp.c
Internal methods for decompositions and the decomposition store
 
dcmp.h
Internal methods for decompositions and the decomposition store
 
debug.c
Methods for debugging
 
debug.h
Methods for debugging
 
def.h
Common defines and data types used in all packages of SCIP
 
dialog.c
Methods for user interface dialog
 
dialog.h
Internal methods for user interface dialog
 
dialog_default.c
Default user interface dialog
 
dialog_default.h
Default user interface dialog
 
disp.c
Methods and datastructures for displaying runtime statistics
 
disp.h
Internal methods for displaying runtime statistics
 
disp_default.c
Default display columns
 
disp_default.h
Default display columns
 
event.c
Methods and datastructures for managing events
 
event.h
Internal methods for managing events
 
event_estim.c
Event handler for tree size estimation and restarts
 
event_estim.h
Event handler for tree size estimation and restarts
 
event_globalbnd.c
Eventhandler for storing all global bound changes
 
event_globalbnd.h
Eventhdlr for storing all global bound changes
 
event_shadowtree.c
Event handler for maintaining the unmodified branch-and-bound tree
 
event_shadowtree.h
 
event_softtimelimit.c
Eventhdlr for soft time limit
 
event_softtimelimit.h
Eventhdlr for soft time limit
 
event_solvingphase.c
Event handler for solving phase dependent parameter adjustment
 
event_solvingphase.h
Eventhdlr for solving phase dependent parameter adjustment
 
expr.c
Functions for algebraic expressions
 
expr.h
Private functions to work with algebraic expressions
 
expr_abs.c
Absolute expression handler
 
expr_abs.h
Absolute expression handler
 
expr_entropy.c
Handler for -x*log(x) expressions
 
expr_entropy.h
Handler for -x*log(x) expressions
 
expr_erf.c
Handler for Gaussian error function expressions
 
expr_erf.h
Handler for Gaussian error function expressions
 
expr_exp.c
Exponential expression handler
 
expr_exp.h
Exponential expression handler
 
expr_log.c
Logarithm expression handler
 
expr_log.h
Logarithm expression handler
 
expr_pow.c
Power expression handler
 
expr_pow.h
Power and signed power expression handlers
 
expr_product.c
Product expression handler
 
expr_product.h
Product expression handler
 
expr_sum.c
Sum expression handler
 
expr_sum.h
Sum expression handler
 
expr_trig.c
Handler for sine and cosine expressions
 
expr_trig.h
Handler for sin expressions
 
expr_value.c
Constant value expression handler
 
expr_value.h
Constant value expression handler
 
expr_var.c
Variable expression handler
 
expr_var.h
Variable expression handler
 
expr_varidx.c
Handler for variable index expressions
 
expr_varidx.h
Handler for variable index expressions
 
exprcurv.c
Functions to work with curvature (convex, concave, etc)
 
exprinterpret.h
Methods to interpret (evaluate) an expression "fast"
 
exprinterpret_cppad.cpp
Methods to interpret (evaluate) an expression "fast" using CppAD
 
exprinterpret_none.c
Function definitions for nonexisting expression interpreter to resolve linking references
 
expriter.c
Functions for iterating over algebraic expressions
 
fileio.c
Wrapper functions to map file i/o to standard or zlib file i/o
 
heur.c
Methods for primal heuristics
 
heur.h
Internal methods for primal heuristics
 
heur_actconsdiving.c
LP diving heuristic that chooses fixings w.r.t. the active constraints the variable appear in
 
heur_actconsdiving.h
LP diving heuristic that chooses fixings w.r.t. the active constraints the variable appear in
 
heur_adaptivediving.c
Diving heuristic that selects adaptively between the existing, public dive sets
 
heur_adaptivediving.h
Diving heuristic that selects adaptively between the existing, public dive sets
 
heur_alns.c
Adaptive large neighborhood search heuristic that orchestrates popular LNS heuristics
 
heur_alns.h
Adaptive large neighborhood search heuristic that orchestrates popular LNS heuristics
 
heur_bound.c
Heuristic which fixes all integer variables to a bound (lower/upper) and solves the remaining LP
 
heur_bound.h
Heuristic which fixes all integer variables to a bound (lower/upper) and solves the remaining LP
 
heur_clique.c
LNS heuristic using a clique partition to restrict the search neighborhood
 
heur_clique.h
LNS heuristic using a clique partition to restrict the search neighborhood
 
heur_coefdiving.c
LP diving heuristic that chooses fixings w.r.t. the matrix coefficients
 
heur_coefdiving.h
LP diving heuristic that chooses fixings w.r.t. the matrix coefficients
 
heur_completesol.c
COMPLETESOL - primal heuristic trying to complete given partial solutions
 
heur_completesol.h
Primal heuristic trying to complete given partial solutions
 
heur_conflictdiving.c
LP diving heuristic that chooses fixings w.r.t. conflict locks
 
heur_conflictdiving.h
LP diving heuristic that chooses fixings w.r.t. conflict locks
 
heur_crossover.c
Crossover primal heuristic
 
heur_crossover.h
LNS heuristic that tries to combine several feasible solutions
 
heur_dins.c
DINS primal heuristic (according to Ghosh)
 
heur_dins.h
DINS primal heuristic
 
heur_distributiondiving.c
Diving heuristic that chooses fixings w.r.t. changes in the solution density after Pryor and Chinneck
 
heur_distributiondiving.h
Diving heuristic that chooses fixings w.r.t. changes in the solution density after Pryor and Chinneck
 
heur_dps.c
Dynamic partition search
 
heur_dps.h
Dynamic partition search
 
heur_dualval.c
Dualval primal heuristic
 
heur_dualval.h
Primal heuristic that uses dualvalues for successive switching variable values
 
heur_farkasdiving.c
LP diving heuristic that tries to construct a Farkas-proof
 
heur_farkasdiving.h
LP diving heuristic that tries to construct a Farkas-proof
 
heur_feaspump.c
Objective Feasibility Pump 2.0
 
heur_feaspump.h
Objective Feasibility Pump 2.0
 
heur_fixandinfer.c
Fix-and-infer primal heuristic
 
heur_fixandinfer.h
Fix-and-infer primal heuristic
 
heur_fracdiving.c
LP diving heuristic that chooses fixings w.r.t. the fractionalities
 
heur_fracdiving.h
LP diving heuristic that chooses fixings w.r.t. the fractionalities
 
heur_gins.c
LNS heuristic that tries to delimit the search region to a neighborhood in the constraint graph
 
heur_gins.h
LNS heuristic that tries to delimit the search region to a neighborhood in the constraint graph
 
heur_guideddiving.c
LP diving heuristic that chooses fixings in direction of incumbent solutions
 
heur_guideddiving.h
LP diving heuristic that chooses fixings in direction of incumbent solutions
 
heur_indicator.c
Handle partial solutions for linear problems with indicators and otherwise continuous variables
 
heur_indicator.h
Handle partial solutions for linear problems with indicators and otherwise continuous variables
 
heur_indicatordiving.c
LP diving heuristic that fixes indicator variables controlling semicontinuous variables
 
heur_indicatordiving.h
LP diving heuristic that fixes indicator variables controlling semicontinuous variables
 
heur_intdiving.c
LP diving heuristic that fixes variables with integral LP value
 
heur_intdiving.h
LP diving heuristic that fixes variables with integral LP value
 
heur_intshifting.c
LP 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.h
LP 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.c
LP diving heuristic that fixes variables with a large difference to their root solution
 
heur_linesearchdiving.h
LP diving heuristic that fixes variables with a large difference to their root solution
 
heur_localbranching.c
Local branching heuristic according to Fischetti and Lodi
 
heur_localbranching.h
Local branching heuristic according to Fischetti and Lodi
 
heur_locks.c
Rounding locks primal heuristic
 
heur_locks.h
Locks primal heuristic
 
heur_lpface.c
Lpface primal heuristic that searches the optimal LP face inside a sub-MIP
 
heur_lpface.h
LNS heuristic that tries to compute integral solution on optimal LP face
 
heur_mpec.c
Mpec primal heuristic
 
heur_mpec.h
Mpec primal heuristic
 
heur_multistart.c
Multistart heuristic for convex and nonconvex MINLPs
 
heur_multistart.h
Multistart heuristic for convex and nonconvex MINLPs
 
heur_mutation.c
LNS heuristic that tries to randomly mutate the incumbent solution
 
heur_mutation.h
LNS heuristic that tries to randomly mutate the incumbent solution
 
heur_nlpdiving.c
NLP diving heuristic that chooses fixings w.r.t. the fractionalities
 
heur_nlpdiving.h
NLP diving heuristic that chooses fixings w.r.t. the fractionalities
 
heur_objpscostdiving.c
LP diving heuristic that changes variable's objective value instead of bounds, using pseudo cost values as guide
 
heur_objpscostdiving.h
LP diving heuristic that changes variable's objective value instead of bounds, using pseudo cost values as guide
 
heur_octane.c
Octane primal heuristic based on Balas, Ceria, Dawande, Margot, and Pataki
 
heur_octane.h
Octane primal heuristic based on Balas, Ceria, Dawande, Margot, and Pataki
 
heur_ofins.c
OFINS - Objective Function Induced Neighborhood Search - a primal heuristic for reoptimization
 
heur_ofins.h
OFINS - Objective Function Induced Neighborhood Search - a primal heuristic for reoptimization
 
heur_oneopt.c
Improvement heuristic that alters single variable values
 
heur_oneopt.h
Improvement heuristic that alters single variable values
 
heur_padm.c
PADM primal heuristic
 
heur_padm.h
PADM primal heuristic
 
heur_proximity.c
Improvement 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.h
Improvement 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.c
LP diving heuristic that chooses fixings w.r.t. the pseudo cost values
 
heur_pscostdiving.h
LP diving heuristic that chooses fixings w.r.t. the pseudo cost values
 
heur_randrounding.c
Randomized LP rounding heuristic which also generates conflicts via an auxiliary probing tree
 
heur_randrounding.h
Randomized LP rounding heuristic which also generates conflicts via an auxiliary probing tree
 
heur_rens.c
LNS heuristic that finds the optimal rounding to a given point
 
heur_rens.h
LNS heuristic that finds the optimal rounding to a given point
 
heur_reoptsols.c
Reoptsols primal heuristic
 
heur_reoptsols.h
Reoptsols primal heuristic
 
heur_repair.c
Repair primal heuristic
 
heur_repair.h
Repair primal heuristic
 
heur_rins.c
LNS heuristic that combines the incumbent with the LP optimum
 
heur_rins.h
LNS heuristic that combines the incumbent with the LP optimum
 
heur_rootsoldiving.c
LP diving heuristic that changes variable's objective values using root LP solution as guide
 
heur_rootsoldiving.h
LP diving heuristic that changes variables' objective values using root LP solution as guide
 
heur_rounding.c
LP rounding heuristic that tries to recover from intermediate infeasibilities
 
heur_rounding.h
LP rounding heuristic that tries to recover from intermediate infeasibilities
 
heur_scheduler.c
Adaptive heuristic to schedule LNS and diving heuristics
 
heur_scheduler.h
Adaptive heuristic to schedule LNS and diving heuristics
 
heur_shiftandpropagate.c
Shiftandpropagate primal heuristic
 
heur_shiftandpropagate.h
Preroot heuristic that alternatingly fixes variables and propagates domains
 
heur_shifting.c
LP rounding heuristic that tries to recover from intermediate infeasibilities and shifts continuous variables
 
heur_shifting.h
LP rounding heuristic that tries to recover from intermediate infeasibilities and shifts continuous variables
 
heur_simplerounding.c
Simple and fast LP rounding heuristic
 
heur_simplerounding.h
Simple and fast LP rounding heuristic
 
heur_subnlp.c
NLP local search primal heuristic using sub-SCIPs
 
heur_subnlp.h
NLP local search primal heuristic using sub-SCIPs
 
heur_sync.c
Primal heuristic that adds solutions from synchronization
 
heur_sync.h
Primal heuristic that adds given solutions
 
heur_trivial.c
Trivial primal heuristic
 
heur_trivial.h
Trivial primal heuristic
 
heur_trivialnegation.c
Trivialnegation primal heuristic
 
heur_trivialnegation.h
Trivialnegation primal heuristic
 
heur_trustregion.c
Large neighborhood search heuristic for Benders' decomposition based on trust region methods
 
heur_trustregion.h
Large neighborhood search heuristic for Benders' decomposition based on trust region methods
 
heur_trysol.c
Primal heuristic that tries a given solution
 
heur_trysol.h
Primal heuristic that tries a given solution
 
heur_twoopt.c
Primal heuristic to improve incumbent solution by flipping pairs of variables
 
heur_twoopt.h
Primal heuristic to improve incumbent solution by flipping pairs of variables
 
heur_undercover.c
Undercover primal heuristic for MINLPs
 
heur_undercover.h
Undercover primal heuristic for MINLPs
 
heur_vbounds.c
LNS heuristic uses the variable lower and upper bounds to determine the search neighborhood
 
heur_vbounds.h
LNS heuristic uses the variable lower and upper bounds to determine the search neighborhood
 
heur_veclendiving.c
LP diving heuristic that rounds variables with long column vectors
 
heur_veclendiving.h
LP diving heuristic that rounds variables with long column vectors
 
heur_zeroobj.c
Heuristic that tries to solve the problem without objective. In Gurobi, this heuristic is known as "Hail Mary"
 
heur_zeroobj.h
Heuristic that tries to solve the problem without objective. In Gurobi, this heuristic is known as "Hail Mary"
 
heur_zirounding.c
Zirounding primal heuristic
 
heur_zirounding.h
ZI Round primal heuristic
 
heuristics.c
Methods commonly used by primal heuristics
 
heuristics.h
Methods commonly used by primal heuristics
 
history.c
Methods for branching and inference history
 
history.h
Internal methods for branching and inference history
 
implics.c
Methods for implications, variable bounds, and clique tables
 
implics.h
Methods for implications, variable bounds, and cliques
 
interrupt.c
Methods and datastructures for catching the user CTRL-C interrupt
 
interrupt.h
Methods for catching the user CTRL-C interrupt
 
intervalarith.c
Interval arithmetics for provable bounds
 
intervalarith.h
Interval arithmetics for provable bounds
 
lapack_calls.c
 
lapack_calls.h
Interface methods for lapack functions
 
lp.c
LP management methods and data structures
 
lp.h
Internal methods for LP management
 
matrix.c
Methods for MIP matrix data structure
 
mem.c
Block memory pools and memory buffers
 
mem.h
Methods for block memory pools and memory buffers
 
message.c
Message output methods
 
message.h
Message output methods
 
message_default.c
Default message handler
 
message_default.h
Default message handler
 
misc.c
Miscellaneous methods
 
misc.h
Internal miscellaneous methods
 
misc_linear.c
Miscellaneous methods for linear constraints
 
misc_rowprep.c
Linear inequalities in preparation
 
nlhdlr.c
Functions for nonlinearity handlers of nonlinear constraint handler
 
nlhdlr.h
Private functions of nonlinear handlers of nonlinear constraints
 
nlhdlr_bilinear.c
Bilinear nonlinear handler
 
nlhdlr_bilinear.h
Bilinear nonlinear handler
 
nlhdlr_convex.c
Nonlinear handlers for convex and concave expressions
 
nlhdlr_convex.h
Nonlinear handlers for convex and concave expressions, respectively
 
nlhdlr_default.c
Default nonlinear handler that calls expression handler methods
 
nlhdlr_default.h
Default nonlinear handler that calls expression handler methods
 
nlhdlr_perspective.c
Perspective nonlinear handler
 
nlhdlr_perspective.h
Perspective nonlinear handler
 
nlhdlr_quadratic.c
Nonlinear handler to handle quadratic expressions
 
nlhdlr_quadratic.h
Nonlinear handler to handle quadratic expressions
 
nlhdlr_quotient.c
Quotient nonlinear handler
 
nlhdlr_quotient.h
Quotient nonlinear handler
 
nlhdlr_signomial.c
Signomial nonlinear handler
 
nlhdlr_signomial.h
Signomial nonlinear handler
 
nlhdlr_soc.c
Nonlinear handler for second order cone constraints
 
nlhdlr_soc.h
Soc nonlinear handler
 
nlp.c
NLP management methods
 
nlp.h
Internal methods for NLP management
 
nlpi.c
Methods for handling NLP solver interface
 
nlpi.h
Internal methods for NLP solver interfaces
 
nlpi_all.c
NLP interface that uses all available NLP interfaces
 
nlpi_all.h
NLP interface that uses all available NLP interfaces
 
nlpi_filtersqp.c
FilterSQP NLP interface
 
nlpi_filtersqp.h
FilterSQP NLP interface
 
nlpi_filtersqp_dummy.c
Dummy filterSQP NLP interface for the case that FilterSQP is not available
 
nlpi_ipopt.cpp
Ipopt NLP interface
 
nlpi_ipopt.h
Ipopt NLP interface
 
nlpi_ipopt_dummy.c
Dummy Ipopt NLP interface for the case that Ipopt is not available
 
nlpi_worhp.c
Worhp NLP interface
 
nlpi_worhp.h
Worhp NLP interface
 
nlpi_worhp_dummy.c
Dummy WORHP NLP interface
 
nlpioracle.c
Implementation of NLPI oracle
 
nlpioracle.h
Methods to store an NLP and request function, gradient, and Hessian values
 
nodesel.c
Methods for node selectors
 
nodesel.h
Internal methods for node selectors and node priority queues
 
nodesel_bfs.c
Node selector for best first search
 
nodesel_bfs.h
Node selector for best first search
 
nodesel_breadthfirst.c
 
nodesel_breadthfirst.h
Node selector for breadth-first search
 
nodesel_dfs.c
Node selector for depth first search
 
nodesel_dfs.h
Node selector for depth first search
 
nodesel_estimate.c
Node selector for best estimate search
 
nodesel_estimate.h
Node selector for best estimate search
 
nodesel_hybridestim.c
Node selector for hybrid best estimate / best bound search
 
nodesel_hybridestim.h
Node selector for hybrid best estimate / best bound search
 
nodesel_restartdfs.c
Node selector for depth first search with periodical selection of the best node
 
nodesel_restartdfs.h
Node selector for depth first search with periodical selection of the best node
 
nodesel_uct.c
Uct node selector which balances exploration and exploitation by considering node visits
 
nodesel_uct.h
Uct node selector which balances exploration and exploitation by considering node visits
 
paramset.c
Methods for handling parameter settings
 
paramset.h
Internal methods for handling parameter settings
 
presol.c
Methods for presolvers
 
presol.h
Internal methods for presolvers
 
presol_boundshift.c
Presolver that converts variables with domain [a,b] to variables with domain [0,b-a]
 
presol_boundshift.h
Presolver that converts integer variables with domain [a,b] to integer variables with domain [0,b-a]
 
presol_convertinttobin.c
Presolver that converts integer variables to binaries
 
presol_convertinttobin.h
Presolver that converts integer variables with domain [a,a+1] to binaries
 
presol_domcol.c
Dominated column presolver
 
presol_domcol.h
Dominated column presolver
 
presol_dualagg.c
Aggregate variables by dual arguments
 
presol_dualagg.h
Aggregate variables by dual arguments
 
presol_dualcomp.c
Dual compensation presolver
 
presol_dualcomp.h
Dual compensation presolver
 
presol_dualinfer.c
Dual inference presolver
 
presol_dualinfer.h
Dual inference presolver
 
presol_dualsparsify.c
Cancel nonzeros of the constraint matrix based on the columns
 
presol_dualsparsify.h
Cancel nonzeros of the constraint matrix based on the columns
 
presol_gateextraction.c
Gateextraction presolver
 
presol_gateextraction.h
Gateextraction presolver
 
presol_implics.c
Implics presolver
 
presol_implics.h
Implication graph presolver which checks for aggregations
 
presol_inttobinary.c
Presolver that converts integer variables with domain [a,a+1] to binaries
 
presol_inttobinary.h
Presolver that converts integer variables with domain [a,a+1] to binaries
 
presol_milp.cpp
MILP presolver
 
presol_milp.h
MILP presolver that calls the presolve library on the constraint matrix
 
presol_qpkktref.c
Qpkktref presolver
 
presol_qpkktref.h
Qpkktref presolver
 
presol_redvub.c
Remove redundant variable upper bound constraints
 
presol_redvub.h
Remove redundant variable upper bound constraints
 
presol_sparsify.c
Cancel non-zeros of the constraint matrix
 
presol_sparsify.h
Cancel non-zeros of the constraint matrix
 
presol_stuffing.c
Fix singleton continuous variables
 
presol_stuffing.h
Fix singleton continuous variables
 
presol_trivial.c
Trivial presolver: round fractional bounds on integer variables, fix variables with equal bounds
 
presol_trivial.h
Trivial presolver: round fractional bounds on integer variables, fix variables with equal bounds
 
presol_tworowbnd.c
Do bound tightening by using two rows
 
presol_tworowbnd.h
Do bound tightening by using two rows
 
presolve.c
Methods for presolving
 
presolve.h
Methods commonly used for presolving
 
pricer.c
Methods for variable pricers
 
pricer.h
Internal methods for variable pricers
 
pricestore.c
Methods for storing priced variables
 
pricestore.h
Internal methods for storing priced variables
 
primal.c
Methods for collecting primal CIP solutions and primal informations
 
primal.h
Internal methods for collecting primal CIP solutions and primal informations
 
prob.c
Methods and datastructures for storing and manipulating the main problem
 
prob.h
Internal methods for storing and manipulating the main problem
 
prop.c
Methods and datastructures for propagators
 
prop.h
Internal methods for propagators
 
prop_dualfix.c
Fixing roundable variables to best bound
 
prop_dualfix.h
Fixing roundable variables to best bound
 
prop_genvbounds.c
Generalized variable bounds propagator
 
prop_genvbounds.h
Generalized variable bounds propagator
 
prop_nlobbt.c
Nlobbt propagator
 
prop_nlobbt.h
Nonlinear OBBT propagator
 
prop_obbt.c
Optimization-based bound tightening propagator
 
prop_obbt.h
Optimization-based bound tightening propagator
 
prop_probing.c
Probing propagator
 
prop_probing.h
Probing propagator
 
prop_pseudoobj.c
Pseudo objective propagator
 
prop_pseudoobj.h
Pseudo objective propagator
 
prop_redcost.c
Propagator using the LP reduced cost and the cutoff bound
 
prop_redcost.h
Propagator using the LP reduced cost and the cutoff bound
 
prop_rootredcost.c
Reduced cost strengthening using root node reduced costs and the cutoff bound
 
prop_rootredcost.h
Reduced cost strengthening using root node reduced costs and the cutoff bound
 
prop_symmetry.c
Propagator for handling symmetries
 
prop_symmetry.h
Propagator for symmetry handling
 
prop_sync.c
Propagator for applying global bound changes that were communicated by other concurrent solvers
 
prop_sync.h
Propagator for applying global bound changes that were communicated by other concurrent solvers
 
prop_vbounds.c
Variable upper and lower bound propagator
 
prop_vbounds.h
Variable upper and lower bound propagator
 
pub_bandit.h
Public methods for bandit algorithms
 
pub_bandit_epsgreedy.h
Public methods for the epsilon greedy bandit selector
 
pub_bandit_exp3.h
Public methods for Exp.3
 
pub_bandit_exp3ix.h
Public methods for Exp.3-IX
 
pub_bandit_ucb.h
Public methods for UCB bandit selection
 
pub_benders.h
Public methods for Benders' decomposition
 
pub_benderscut.h
Public methods for Benders' decomposition cuts
 
pub_branch.h
Public methods for branching rules
 
pub_compr.h
Public methods for tree compressions
 
pub_conflict.h
Public methods for conflict analysis handlers
 
pub_cons.h
Public methods for managing constraints
 
pub_cutpool.h
Public methods for storing cuts in a cut pool
 
pub_cutsel.h
Public methods for cut selectors
 
pub_dcmp.h
Public methods for decompositions
 
pub_dialog.h
Public methods for user interface dialog
 
pub_disp.h
Public methods for displaying runtime statistics
 
pub_event.h
Public methods for managing events
 
pub_expr.h
Public functions to work with algebraic expressions
 
pub_fileio.h
Wrapper functions to map file i/o to standard or zlib file i/o
 
pub_heur.h
Public methods for primal heuristics
 
pub_history.h
Public methods for branching and inference history structure
 
pub_implics.h
Public methods for implications, variable bounds, and cliques
 
pub_lp.h
Public methods for LP management
 
pub_matrix.h
Public methods for matrix
 
pub_message.h
Public methods for message output
 
pub_misc.h
Public data structures and miscellaneous methods
 
pub_misc_linear.h
Internal miscellaneous methods for linear constraints
 
pub_misc_rowprep.h
Preparation of a linear inequality to become a SCIP_ROW
 
pub_misc_select.h
Methods for selecting (weighted) k-medians
 
pub_misc_sort.h
Methods for sorting joint arrays of various types
 
pub_nlhdlr.h
Public functions of nonlinear handlers of nonlinear constraints
 
pub_nlp.h
Public methods for NLP management
 
pub_nlpi.h
Public methods for NLP solver interfaces
 
pub_nodesel.h
Public methods for node selectors
 
pub_paramset.h
Public methods for handling parameter settings
 
pub_presol.h
Public methods for presolvers
 
pub_pricer.h
Public methods for variable pricers
 
pub_prop.h
Public methods for propagators
 
pub_reader.h
Public methods for input file readers
 
pub_relax.h
Public methods for relaxation handlers
 
pub_reopt.h
Public methods for reoptimization
 
pub_sepa.h
Public methods for separators
 
pub_sol.h
Public methods for primal CIP solutions
 
pub_table.h
Public methods for displaying statistic tables
 
pub_tree.h
Public methods for branch and bound tree
 
pub_var.h
Public methods for problem variables
 
rbtree.c
Intrusive red black tree datastructure
 
rbtree.h
Intrusive red black tree datastructure
 
reader.c
Interface for input file readers
 
reader.h
Internal methods for input file readers
 
reader_bnd.c
File reader for variable bounds
 
reader_bnd.h
File reader for variable bounds
 
reader_ccg.c
Graph file reader (actually, only a writer)
 
reader_ccg.h
Column connectivity graph file reader (actually, only a writer)
 
reader_cip.c
CIP file reader
 
reader_cip.h
CIP file reader
 
reader_cnf.c
CNF file reader
 
reader_cnf.h
CNF file reader
 
reader_cor.c
COR file reader (MPS format of the core problem for stochastic programs)
 
reader_cor.h
COR file reader (MPS format of the core problem for stochastic programs)
 
reader_dec.c
File reader for decompositions in the constraint based dec-file format
 
reader_dec.h
File reader for decompositions in the constraint based dec-file format
 
reader_diff.c
DIFF file reader
 
reader_diff.h
Diff file reader
 
reader_fix.c
File reader for variable fixings
 
reader_fix.h
File reader for variable fixings
 
reader_fzn.c
FlatZinc file reader
 
reader_fzn.h
FlatZinc file reader
 
reader_gms.c
GAMS file writer
 
reader_gms.h
GAMS file reader and writer
 
reader_lp.c
LP file reader
 
reader_lp.h
LP file reader
 
reader_mps.c
(extended) MPS file reader
 
reader_mps.h
(extended) MPS file reader
 
reader_mst.c
File reader for partial primal solutions (like MIP-start of Cplex)
 
reader_mst.h
File reader for partial primal solutions
 
reader_nl.cpp
AMPL .nl file reader
 
reader_nl.h
AMPL .nl file reader
 
reader_opb.c
Pseudo-Boolean file reader (opb format)
 
reader_opb.h
Pseudo-Boolean file reader (opb format)
 
reader_osil.c
OS instance language (OSiL) format file reader
 
reader_osil.h
OS instance language (OSiL) format file reader
 
reader_pbm.c
File writer for portable bitmap file format (PBM), open with common graphic viewer programs (e.g. xview)
 
reader_pbm.h
File writer for portable bitmap file format (PBM), open with common graphic viewer programs (e.g. xview)
 
reader_pip.c
File reader for polynomial mixed-integer programs in PIP format
 
reader_pip.h
File reader for polynomial mixed-integer programs in PIP format
 
reader_ppm.c
File writer for portable pixmap file format (PPM), open with common graphic viewer programs (e.g. xview)
 
reader_ppm.h
File writer for portable pixmap file format (PPM), open with common graphic viewer programs (e.g. xview)
 
reader_rlp.c
RLP file reader (LP format with generic variables and row names)
 
reader_rlp.h
RLP file reader (LP format with generic variables and row names)
 
reader_smps.c
SMPS file reader - smps files list the cor, tim and sto files for a single instance
 
reader_smps.h
SMPS file reader - SMPS files lists the cor, tim and sto files for a single instance to be read
 
reader_sol.c
File reader for primal solutions
 
reader_sol.h
File reader for primal solutions
 
reader_sto.c
STO file reader - the stochastic information of an instance in SMPS format
 
reader_sto.h
STO file reader - the stochastic information of an instance in SMPS format
 
reader_tim.c
TIM file reader - the stage information for a stochastic programming instance in SMPS format
 
reader_tim.h
TIM file reader - the stage information for a stochastic programming instance in SMPS format
 
reader_wbo.c
WBO file reader (OPB format with weighted constraints)
 
reader_wbo.h
WBO file reader (LP format with generic variables and row names)
 
reader_zpl.c
ZIMPL model file reader
 
reader_zpl.h
ZIMPL model file reader
 
relax.c
Methods and datastructures for relaxation handlers
 
relax.h
Internal methods for relaxators
 
reopt.c
Data structures and methods for collecting reoptimization information
 
reopt.h
Data structures and methods for collecting reoptimization information
 
retcode.c
Methods for return codes for SCIP methods
 
retcode.h
Internal methods for return codes for SCIP methods
 
scip.h
SCIP callable library
 
scip_bandit.c
Public functions for bandit algorithms
 
scip_bandit.h
Public methods for bandit algorithms
 
scip_benders.c
Public methods for Benders decomposition
 
scip_benders.h
Public methods for Benders decomposition
 
scip_branch.c
Public methods for branching rule plugins and branching
 
scip_branch.h
Public methods for branching rule plugins and branching
 
scip_compr.c
Public methods for compression plugins
 
scip_compr.h
Public methods for compression plugins
 
scip_concurrent.c
Public methods for concurrent solving mode
 
scip_concurrent.h
Public methods for concurrent solving mode
 
scip_conflict.c
Public methods for conflict handler plugins and conflict analysis
 
scip_conflict.h
Public methods for conflict handler plugins and conflict analysis
 
scip_cons.c
Public methods for constraint handler plugins and constraints
 
scip_cons.h
Public methods for constraint handler plugins and constraints
 
scip_copy.c
Public methods for problem copies
 
scip_copy.h
Public methods for problem copies
 
scip_cut.c
Public methods for cuts and aggregation rows
 
scip_cut.h
Public methods for cuts and aggregation rows
 
scip_cutsel.c
Public methods for cut selector plugins
 
scip_cutsel.h
Public methods for cut selector plugins
 
scip_datastructures.c
Public methods for data structures
 
scip_datastructures.h
Public methods for data structures
 
scip_dcmp.c
Methods for working with decompositions
 
scip_dcmp.h
Public methods for decompositions
 
scip_debug.c
Public methods for debugging
 
scip_debug.h
Public methods for debugging
 
scip_dialog.c
Public methods for dialog handler plugins
 
scip_dialog.h
Public methods for dialog handler plugins
 
scip_disp.c
Public methods for display handler plugins
 
scip_disp.h
Public methods for display handler plugins
 
scip_event.c
Public methods for event handler plugins and event handlers
 
scip_event.h
Public methods for event handler plugins and event handlers
 
scip_expr.c
Public functions to work with algebraic expressions
 
scip_expr.h
Public functions to work with algebraic expressions
 
scip_general.c
General public methods
 
scip_general.h
General public methods
 
scip_heur.c
Public methods for primal heuristic plugins and divesets
 
scip_heur.h
Public methods for primal heuristic plugins and divesets
 
scip_lp.c
Public methods for the LP relaxation, rows and columns
 
scip_lp.h
Public methods for the LP relaxation, rows and columns
 
scip_mem.c
Public methods for memory management
 
scip_mem.h
Public methods for memory management
 
scip_message.c
Public methods for message handling
 
scip_message.h
Public methods for message handling
 
scip_nlp.c
Public methods for nonlinear relaxation
 
scip_nlp.h
Public methods for nonlinear relaxation
 
scip_nlpi.c
Public methods for NLP interfaces
 
scip_nlpi.h
Public methods for NLPI solver interfaces
 
scip_nodesel.c
Public methods for node selector plugins
 
scip_nodesel.h
Public methods for node selector plugins
 
scip_numerics.c
Public methods for numerical tolerances
 
scip_numerics.h
Public methods for numerical tolerances
 
scip_param.c
Public methods for SCIP parameter handling
 
scip_param.h
Public methods for SCIP parameter handling
 
scip_presol.c
Public methods for presolving plugins
 
scip_presol.h
Public methods for presolving plugins
 
scip_pricer.c
Public methods for variable pricer plugins
 
scip_pricer.h
Public methods for variable pricer plugins
 
scip_prob.c
Public methods for global and local (sub)problems
 
scip_prob.h
Public methods for global and local (sub)problems
 
scip_probing.c
Public methods for the probing mode
 
scip_probing.h
Public methods for the probing mode
 
scip_prop.c
Public methods for propagator plugins
 
scip_prop.h
Public methods for propagator plugins
 
scip_randnumgen.c
Public methods for random numbers
 
scip_randnumgen.h
Public methods for random numbers
 
scip_reader.c
Public methods for reader plugins
 
scip_reader.h
Public methods for reader plugins
 
scip_relax.c
Public methods for relaxator plugins
 
scip_relax.h
Public methods for relaxator plugins
 
scip_reopt.c
Public methods for reoptimization
 
scip_reopt.h
Public methods for reoptimization
 
scip_sepa.c
Public methods for separator plugins
 
scip_sepa.h
Public methods for separator plugins
 
scip_sol.c
Public methods for solutions
 
scip_sol.h
Public methods for solutions
 
scip_solve.c
Public solving methods
 
scip_solve.h
Public solving methods
 
scip_solvingstats.c
Public methods for querying solving statistics
 
scip_solvingstats.h
Public methods for querying solving statistics
 
scip_table.c
Public methods for statistics table plugins
 
scip_table.h
Public methods for statistics table plugins
 
scip_timing.c
Public methods for timing
 
scip_timing.h
Public methods for timing
 
scip_tree.c
Public methods for the branch-and-bound tree
 
scip_tree.h
Public methods for the branch-and-bound tree
 
scip_validation.c
Public methods for validation
 
scip_validation.h
Public methods for validation
 
scip_var.c
Public methods for SCIP variables
 
scip_var.h
Public methods for SCIP variables
 
scipbuildflags.c
Build flags methods
 
scipbuildflags.h
Build flags methods
 
scipcoreplugins.c
Register additional core functionality designed as plugins
 
scipcoreplugins.h
Register additional core functionality that is designed as plugins
 
scipdefplugins.c
Default SCIP plugins
 
scipdefplugins.h
Default SCIP plugins
 
scipgithash.c
Git hash methods
 
scipgithash.h
Git hash methods
 
scipshell.c
SCIP command line interface
 
scipshell.h
SCIP command line interface
 
sepa.c
Methods and datastructures for separators
 
sepa.h
Internal methods for separators
 
sepa_aggregation.c
Flow cover and complemented mixed integer rounding cuts separator (Marchand's version)
 
sepa_aggregation.h
Flow cover and complemented mixed integer rounding cuts separator (Marchand's version)
 
sepa_cgmip.c
Chvatal-Gomory cuts computed via a sub-MIP
 
sepa_cgmip.h
Chvatal-Gomory cuts computed via a sub-MIP
 
sepa_clique.c
Clique separator
 
sepa_clique.h
Clique separator
 
sepa_closecuts.c
Closecuts meta separator
 
sepa_closecuts.h
Closecuts meta separator
 
sepa_convexproj.c
Convexproj separator
 
sepa_convexproj.h
Convexproj separator
 
sepa_disjunctive.c
Disjunctive cut separator
 
sepa_disjunctive.h
Disjunctive cut separator
 
sepa_eccuts.c
Edge concave cut separator
 
sepa_eccuts.h
Edge concave cut separator
 
sepa_gauge.c
Gauge separator
 
sepa_gauge.h
Gauge separator
 
sepa_gomory.c
Gomory MIR Cuts
 
sepa_gomory.h
Gomory MIR Cuts
 
sepa_impliedbounds.c
Implied bounds separator
 
sepa_impliedbounds.h
Implied bounds separator
 
sepa_interminor.c
Minor separator with intersection cuts
 
sepa_interminor.h
 
sepa_intobj.c
Integer objective value separator
 
sepa_intobj.h
Integer objective value separator
 
sepa_lagromory.c
Lagromory separator
 
sepa_lagromory.h
Lagromory separator
 
sepa_mcf.c
Multi-commodity-flow network cut separator
 
sepa_mcf.h
Multi-commodity-flow network cut separator
 
sepa_minor.c
Principal minor separator
 
sepa_minor.h
Principal minor separator
 
sepa_mixing.c
Mixing/star inequality separator
 
sepa_mixing.h
Mixing cuts separator
 
sepa_oddcycle.c
Oddcycle separator
 
sepa_oddcycle.h
Oddcycle separator
 
sepa_rapidlearning.c
Rapidlearning separator
 
sepa_rapidlearning.h
Rapidlearning separator
 
sepa_rlt.c
Separator for cuts generated by Reformulation-Linearization-Technique (RLT)
 
sepa_rlt.h
Reformulation-linearization technique separator
 
sepa_zerohalf.c
{0,1/2}-cuts separator
 
sepa_zerohalf.h
{0,1/2}-cuts separator
 
sepastore.c
Methods for storing separated cuts
 
sepastore.h
Internal methods for storing separated cuts
 
set.c
Methods for global SCIP settings
 
set.h
Internal methods for global SCIP settings
 
sol.c
Methods for storing primal CIP solutions
 
sol.h
Internal methods for storing primal CIP solutions
 
solve.c
Main solving loop and node processing
 
solve.h
Internal methods for main solving loop and node processing
 
sorttpl.c
Template functions for sorting
 
stat.c
Methods for problem statistics
 
stat.h
Internal methods for problem statistics
 
struct_bandit.h
Data structures for bandit selection algorithms
 
struct_benders.h
Data structures required for Benders' decomposition
 
struct_benderscut.h
Datastructures for Benders' decomposition cuts techniques
 
struct_branch.h
Datastructures for branching rules and branching candidate storage
 
struct_clock.h
Datastructures for clocks and timing issues
 
struct_compr.h
Datastructures for tree compression techniques
 
struct_concsolver.h
Datastructures for concurrent solvers
 
struct_concurrent.h
Concurrent data struct
 
struct_conflict.h
Datastructures for conflict analysis
 
struct_conflictstore.h
 
struct_cons.h
Datastructures for constraints and constraint handlers
 
struct_cutpool.h
Datastructures for storing cuts in a cut pool
 
struct_cuts.h
Struct definitions for cuts
 
struct_cutsel.h
Data structures for cut selectors
 
struct_dcmp.h
Data structures for a decomposition and a decomposition store
 
struct_dialog.h
Data structures for user interface dialog
 
struct_disp.h
Data structures for displaying runtime statistics
 
struct_event.h
Datastructures for managing events
 
struct_expr.h
Structure definitions related to algebraic expressions
 
struct_heur.h
Datastructures for primal heuristics
 
struct_history.h
Datastructures for branching and inference history
 
struct_implics.h
Datastructures for implications, variable bounds, and cliques
 
struct_lp.h
Data structures for LP management
 
struct_matrix.h
Data structure for MIP matrix
 
struct_mem.h
Datastructures for block memory pools and memory buffers
 
struct_message.h
Datastructures for problem statistics
 
struct_misc.h
Miscellaneous datastructures
 
struct_nlhdlr.h
Structure definitions related to nonlinear handlers of nonlinear constraints
 
struct_nlp.h
Datastructures for NLP management
 
struct_nlpi.h
Data definitions for an NLP solver interface
 
struct_nodesel.h
Data structures for node selectors and node priority queues
 
struct_paramset.h
Datastructures for handling parameter settings
 
struct_presol.h
Datastructures for presolvers
 
struct_pricer.h
Data structures for variable pricers
 
struct_pricestore.h
Data structures for storing priced variables
 
struct_primal.h
Datastructures for collecting primal CIP solutions and primal informations
 
struct_prob.h
Datastructures for storing and manipulating the main problem
 
struct_prop.h
Datastructures for propagators
 
struct_reader.h
Datastructures for input file readers
 
struct_relax.h
Data structures for relaxators
 
struct_reopt.h
Data structures for collecting reoptimization information
 
struct_scip.h
SCIP main data structure
 
struct_sepa.h
Datastructures for separators
 
struct_sepastore.h
Datastructures for storing conflicts
 
struct_set.h
Datastructures for global SCIP settings
 
struct_sol.h
Datastructures for storing primal CIP solutions
 
struct_stat.h
Datastructures for problem statistics
 
struct_syncstore.h
Struct definitions for the synchronization store
 
struct_table.h
Data structures for displaying statistics tables
 
struct_tree.h
Data structures for branch and bound tree
 
struct_var.h
Datastructures for problem variables
 
struct_visual.h
Data structures for output for visualization tools (VBC, BAK)
 
symmetry.c
Methods for handling symmetries
 
symmetry.h
Methods for handling symmetries
 
symmetry_graph.c
Methods for dealing with symmetry detection graphs
 
symmetry_graph.h
Methods for dealing with symmetry detection graphs
 
symmetry_lexred.c
Methods for handling symmetries by dynamic lexicographic ordering reduction
 
symmetry_lexred.h
Methods for handling symmetries by dynamic lexicographic ordering reduction
 
symmetry_orbital.c
Methods for handling symmetries by orbital reduction
 
symmetry_orbital.h
 
symmetry_orbitopal.c
Methods for handling orbitopal symmetries
 
symmetry_orbitopal.h
 
syncstore.c
Function definitions of the synchronization store
 
syncstore.h
Function declarations for the synchronization store
 
table.c
Methods and datastructures for displaying statistics tables
 
table.h
Internal methods for displaying statistics tables
 
table_default.c
Default statistics tables
 
table_default.h
Default statistics tables
 
tree.c
Methods for branch and bound tree
 
tree.h
Internal methods for branch and bound tree
 
treemodel.c
Branching rules based on the Single-Variable-Branching (SVB) model
 
treemodel.h
Branching rules based on the Single-Variable-Branching (SVB) model
 
type_bandit.h
Type definitions for bandit selection algorithms
 
type_benders.h
Type definitions for Benders' decomposition methods
 
type_benderscut.h
Type definitions for Benders' decomposition cut
 
type_branch.h
Type definitions for branching rules
 
type_clock.h
Type definitions for clocks and timing issues
 
type_compr.h
Type definitions for tree compression
 
type_concsolver.h
Type definitions for concurrent solvers
 
type_concurrent.h
Type definition of concurrent data
 
type_conflict.h
Type definitions for conflict analysis
 
type_conflictstore.h
Type definitions for conflict store
 
type_cons.h
Type definitions for constraints and constraint handlers
 
type_cutpool.h
Type definitions for storing cuts in a cut pool
 
type_cuts.h
Type definitions for cuts
 
type_cutsel.h
Type definitions for cut selectors
 
type_dcmp.h
Type definitions for decompositions and the decomposition store
 
type_dialog.h
Type definitions for user interface dialog
 
type_disp.h
Type definitions for displaying runtime statistics
 
type_event.h
Type definitions for managing events
 
type_expr.h
Type and macro definitions related to algebraic expressions
 
type_exprinterpret.h
Type definitions for expression interpreter
 
type_heur.h
Type definitions for primal heuristics
 
type_history.h
Type definitions for branching and inference history
 
type_implics.h
Type definitions for implications, variable bounds, and cliques
 
type_interrupt.h
Type definitions for catching the user CTRL-C interrupt
 
type_lp.h
Type definitions for LP management
 
type_matrix.h
Type definitions for MIP matrix
 
type_mem.h
Type definitions for block memory pools and memory buffers
 
type_message.h
Type definitions for message output methods
 
type_misc.h
Type definitions for miscellaneous datastructures
 
type_nlhdlr.h
Type definitions related to nonlinear handlers of nonlinear constraints
 
type_nlp.h
Type definitions for NLP management
 
type_nlpi.h
Type definitions for NLP solver interfaces
 
type_nodesel.h
Type definitions for node selectors
 
type_paramset.h
Type definitions for handling parameter settings
 
type_presol.h
Type definitions for presolvers
 
type_pricer.h
Type definitions for variable pricers
 
type_pricestore.h
Type definitions for storing priced variables
 
type_primal.h
Type definitions for collecting primal CIP solutions and primal informations
 
type_prob.h
Type definitions for storing and manipulating the main problem
 
type_prop.h
Type definitions for propagators
 
type_reader.h
Type definitions for input file readers
 
type_relax.h
Type definitions for relaxators
 
type_reopt.h
Type definitions for collecting reoptimization information
 
type_result.h
Result codes for SCIP callback methods
 
type_retcode.h
Type definitions for return codes for SCIP methods
 
type_scip.h
Type definitions for SCIP's main datastructure
 
type_sepa.h
Type definitions for separators
 
type_sepastore.h
Type definitions for storing separated cuts
 
type_set.h
Type definitions for global SCIP settings
 
type_sol.h
Type definitions for storing primal CIP solutions
 
type_stat.h
Type definitions for problem statistics
 
type_syncstore.h
Type definitions for the synchronization store
 
type_table.h
Type definitions for displaying statistics tables
 
type_timing.h
Timing definitions for SCIP
 
type_tree.h
Type definitions for branch and bound tree
 
type_var.h
Type definitions for problem variables
 
type_visual.h
Type definitions for output for visualization tools (VBC, BAK)
 
var.c
Methods for problem variables
 
var.h
Internal methods for problem variables
 
visual.c
Methods for creating output for visualization tools (VBC, BAK)
 
visual.h
Methods for creating output for visualization tools (VBC, BAK)