SCIP
Solving Constraint Integer Programs
Solving Constraint Integer Programs
| ► blockmemshell | |
| ► dijkstra | |
| ► doc | |
| ► examples | This directory contains all coding examples, see Example projects for more information |
| ► lpi | |
| ► nlpi | |
| ► objscip | |
| ► symmetry | |
| ► tclique | |
| ► tpi | |
| ► xml | |
| cppmain.cpp | |
| main.c | Main file for C compilation |
| bandit.c | Internal API of bandit algorithms and bandit virtual function tables |
| bandit.h | Internal methods for bandit algorithms |
| bandit_epsgreedy.c | Implementation 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_ucb.c | Methods for UCB bandit selection |
| bandit_ucb.h | Internal methods for UCB bandit algorithm |
| 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_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_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 |
| 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.c | Methods and datastructures for conflict analysis |
| conflict.h | Internal methods 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 | Constraint handler for absolute power constraints \(\textrm{lhs} \leq \textrm{sign}(x+a) |x+a|^n + c z \leq \textrm{rhs}\) |
| cons_abspower.h | 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_bivariate.c | Constraint handler for bivariate nonlinear constraints \(\textrm{lhs} \leq f(x,y) + c z \leq \textrm{rhs}\) |
| cons_bivariate.h | Constraint handler for bivariate nonlinear constraints \(\textrm{lhs} \leq f(x,y) + c z \leq \textrm{rhs}\) |
| 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_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 an 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 \(\textrm{lhs} \leq \sum_{i=1}^n a_ix_i + \sum_{j=1}^m c_jf_j(x) \leq \textrm{rhs}\) |
| cons_nonlinear.h | Constraint handler for nonlinear constraints \(\textrm{lhs} \leq \sum_{i=1}^n a_ix_i + \sum_{j=1}^m c_jf_j(x) \leq \textrm{rhs}\) |
| cons_or.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 | Constraint handler for quadratic constraints \(\textrm{lhs} \leq \sum_{i,j=1}^n a_{i,j} x_i x_j + \sum_{i=1}^n b_i x_i \leq \textrm{rhs}\) |
| cons_quadratic.h | Constraint handler for quadratic constraints \(\textrm{lhs} \leq \sum_{i,j=1}^n a_{i,j} x_ix_j + \sum_{i=1}^n b_i x_i \leq \textrm{rhs}\) |
| cons_setppc.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 | 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 | 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 |
| dbldblarith.h | Defines macros for basic operations in double-double arithmetic giving roughly twice the precision of a double |
| 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_globalbnd.c | Eventhandler for storing all global bound changes |
| event_globalbnd.h | Eventhdlr for storing all global bound changes |
| 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 |
| 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_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_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_dualval.c | Dualval primal heuristic |
| heur_dualval.h | Primal heuristic that uses dualvalues for successive switching variable values |
| 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_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_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_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_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 |
| 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 |
| nlp.c | NLP management methods and datastructures |
| nlp.h | Internal methods for NLP management |
| 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_gateextraction.c | Gateextraction presolver |
| presol_gateextraction.h | Gateextraction presolver |
| presol_implfree.c | Perform multi-aggregation on implied free variables |
| presol_implfree.h | Exploit implied free variables for multi-aggregation |
| 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_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_symbreak.c | Presolver for adding symmetry breaking constraints |
| presol_symbreak.h | Presolver for adding symmetry breaking constraints |
| presol_symmetry.c | Presolver for storing symmetry information about current problem |
| presol_symmetry.h | Presolver for storing symmetry information about current problem |
| 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_orbitalfixing.c | Propagator for orbital fixing |
| prop_orbitalfixing.h | Propagator for orbital fixing |
| 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_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_ucb.h | Public methods for UCB bandit selection |
| 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_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_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_select.h | Methods for selecting (weighted) k-medians |
| pub_misc_sort.h | Methods for sorting joint arrays of various types |
| pub_nlp.h | Public methods for NLP management |
| 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_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_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_sol.c | File reader for primal solutions |
| reader_sol.h | File reader for primal solutions |
| 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.c | SCIP callable library |
| scip.h | SCIP callable library |
| scip_bandit.c | Public functions for bandit algorithms |
| 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_intobj.c | Integer objective value separator |
| sepa_intobj.h | Integer objective value separator |
| sepa_mcf.c | Multi-commodity-flow network cut separator |
| sepa_mcf.h | Multi-commodity-flow network cut separator |
| sepa_oddcycle.c | Oddcycle separator |
| sepa_oddcycle.h | Oddcycle separator |
| sepa_rapidlearning.c | Rapidlearning separator |
| sepa_rapidlearning.h | Rapidlearning separator |
| sepa_strongcg.c | Strong CG Cuts (Letchford & Lodi) |
| sepa_strongcg.h | Strong CG Cuts (Letchford & Lodi) |
| 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_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_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_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_nlp.h | Datastructures for NLP management |
| 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) |
| 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 |
| type_bandit.h | Type definitions for bandit selection algorithms |
| 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_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_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_nlp.h | Type definitions for NLP management |
| 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) |