![o](ftv2node.png) bitencode.c | Packing single and dual bit values |
![o](ftv2node.png) bitencode.h | Packing single and dual bit values |
![o](ftv2node.png) branch.c | Methods for branching rules and branching candidate storage |
![o](ftv2node.png) branch.h | Internal methods for branching rules and branching candidate storage |
![o](ftv2node.png) branch_allfullstrong.c | All variables full strong LP branching rule |
![o](ftv2node.png) branch_allfullstrong.h | All variables full strong LP branching rule |
![o](ftv2node.png) branch_cloud.c | Cloud branching rule |
![o](ftv2node.png) branch_cloud.h | Cloud branching rule |
![o](ftv2node.png) branch_fullstrong.c | Full strong LP branching rule |
![o](ftv2node.png) branch_fullstrong.h | Full strong LP branching rule |
![o](ftv2node.png) branch_inference.c | Inference history branching rule |
![o](ftv2node.png) branch_inference.h | Inference history branching rule |
![o](ftv2node.png) branch_leastinf.c | Least infeasible LP branching rule |
![o](ftv2node.png) branch_leastinf.h | Least infeasible LP branching rule |
![o](ftv2node.png) branch_mostinf.c | Most infeasible LP branching rule |
![o](ftv2node.png) branch_mostinf.h | Most infeasible LP branching rule |
![o](ftv2node.png) branch_pscost.c | Pseudo costs branching rule |
![o](ftv2node.png) branch_pscost.h | Pseudo costs branching rule |
![o](ftv2node.png) branch_random.c | Random variable branching rule |
![o](ftv2node.png) branch_random.h | Random variable branching rule |
![o](ftv2node.png) branch_relpscost.c | Reliable pseudo costs branching rule |
![o](ftv2node.png) branch_relpscost.h | Reliable pseudo costs branching rule |
![o](ftv2node.png) buffer.c | Methods for memory buffers for temporary objects |
![o](ftv2node.png) buffer.h | Internal methods for memory buffers for temporary objects |
![o](ftv2node.png) clock.c | Methods for clocks and timing issues |
![o](ftv2node.png) clock.h | Internal methods for clocks and timing issues |
![o](ftv2node.png) cmain.c | Main file for C compilation |
![o](ftv2node.png) conflict.c | Methods and datastructures for conflict analysis |
![o](ftv2node.png) conflict.h | Internal methods for conflict analysis |
![o](ftv2node.png) cons.c | Methods for constraints and constraint handlers |
![o](ftv2node.png) cons.h | Internal methods for constraints and constraint handlers |
![o](ftv2node.png) cons_abspower.c | Constraint handler for absolute power constraints ![$\textrm{lhs} \leq \textrm{sign}(x+a) |x+a|^n + c z \leq \textrm{rhs}$](form_44.png) |
![o](ftv2node.png) cons_abspower.h | Constraint handler for absolute power constraints ![$\textrm{lhs} \leq \textrm{sign}(x+a) |x+a|^n + c z \leq \textrm{rhs}$](form_44.png) |
![o](ftv2node.png) cons_and.c | Constraint handler for "and" constraints, ![$r = x_1 \wedge x_2 \wedge \dots \wedge x_n$](form_51.png) |
![o](ftv2node.png) cons_and.h | Constraint handler for "and" constraints, ![$r = x_1 \wedge x_2 \wedge \dots \wedge x_n$](form_51.png) |
![o](ftv2node.png) cons_bivariate.c | Constraint handler for bivariate nonlinear constraints ![$\textrm{lhs} \leq f(x,y) + c z \leq \textrm{rhs}$](form_57.png) |
![o](ftv2node.png) cons_bivariate.h | Constraint handler for bivariate nonlinear constraints ![$\textrm{lhs} \leq f(x,y) + c z \leq \textrm{rhs}$](form_57.png) |
![o](ftv2node.png) cons_bounddisjunction.c | Constraint handler for bound disjunction constraints ![$(x_1 \{\leq,\geq\} b_1) \vee \ldots \vee (x_n \{\leq,\geq\} b_n)$](form_61.png) |
![o](ftv2node.png) cons_bounddisjunction.h | Constraint handler for bound disjunction constraints ![$(x_1 \{\leq,\geq\} b_1) \vee \ldots \vee (x_n \{\leq,\geq\} b_n)$](form_61.png) |
![o](ftv2node.png) cons_conjunction.c | Constraint handler for conjunction constraints |
![o](ftv2node.png) cons_conjunction.h | Constraint handler for conjunction constraints |
![o](ftv2node.png) cons_countsols.c | Constraint handler for counting feasible solutions |
![o](ftv2node.png) cons_countsols.h | Constraint handler for counting feasible solutions |
![o](ftv2node.png) cons_cumulative.c | Constraint handler for cumulative constraints |
![o](ftv2node.png) cons_cumulative.h | Constraint handler for cumulative constraints |
![o](ftv2node.png) cons_disjunction.c | Constraint handler for disjunction constraints |
![o](ftv2node.png) cons_disjunction.h | Constraint handler for disjunction constraints |
![o](ftv2node.png) cons_indicator.c | Constraint handler for indicator constraints |
![o](ftv2node.png) cons_indicator.h | Constraint handler for indicator constraints |
![o](ftv2node.png) cons_integral.c | Constraint handler for the integrality constraint |
![o](ftv2node.png) cons_integral.h | Constraint handler for the integrality constraint |
![o](ftv2node.png) cons_knapsack.c | Constraint handler for knapsack constraints of the form , x binary and ![$a \ge 0$](form_129.png) |
![o](ftv2node.png) cons_knapsack.h | Constraint handler for knapsack constraints of the form , x binary and ![$a \ge 0$](form_129.png) |
![o](ftv2node.png) cons_linear.c | Constraint handler for linear constraints in their most general form, ![$lhs <= a^T x <= rhs$](form_154.png) |
![o](ftv2node.png) cons_linear.h | Constraint handler for linear constraints in their most general form, ![$lhs <= a^T x <= rhs$](form_154.png) |
![o](ftv2node.png) cons_linking.c | Constraint handler for linking constraints |
![o](ftv2node.png) cons_linking.h | Constraint handler for linking binary variables to an integer variable |
![o](ftv2node.png) cons_logicor.c | Constraint handler for logic or constraints (equivalent to set covering, but algorithms are suited for depth first search) |
![o](ftv2node.png) cons_logicor.h | Constraint handler for logicor constraints (equivalent to set covering, but algorithms are suited for depth first search) |
![o](ftv2node.png) 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}$](form_166.png) |
![o](ftv2node.png) 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}$](form_166.png) |
![o](ftv2node.png) cons_or.c | Constraint handler for "or" constraints, ![$r = x_1 \vee x_2 \vee \dots \vee x_n$](form_170.png) |
![o](ftv2node.png) cons_or.h | Constraint handler for "or" constraints, ![$r = x_1 \vee x_2 \vee \dots \vee x_n$](form_170.png) |
![o](ftv2node.png) cons_orbitope.c | Constraint handler for (partitioning/packing) orbitope constraints w.r.t. the full symmetric group |
![o](ftv2node.png) cons_orbitope.h | Constraint handler for (partitioning/packing) orbitope constraints w.r.t. the full symmetric group |
![o](ftv2node.png) cons_pseudoboolean.c | Constraint handler for pseudo Boolean constraints |
![o](ftv2node.png) cons_pseudoboolean.h | Constraint handler for pseudoboolean constraints |
![o](ftv2node.png) cons_quadratic.c | 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}$](form_180.png) |
![o](ftv2node.png) 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}$](form_180.png) |
![o](ftv2node.png) cons_setppc.c | Constraint handler for the set partitioning / packing / covering constraints ![$1^T x\ \{=, \le, \ge\}\ 1$](form_193.png) |
![o](ftv2node.png) cons_setppc.h | Constraint handler for the set partitioning / packing / covering constraints ![$1^T x\ \{=, \le, \ge\}\ 1$](form_193.png) |
![o](ftv2node.png) 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})$](form_196.png) |
![o](ftv2node.png) 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})$](form_196.png) |
![o](ftv2node.png) cons_sos1.c | Constraint handler for SOS type 1 constraints |
![o](ftv2node.png) cons_sos1.h | Constraint handler for SOS type 1 constraints |
![o](ftv2node.png) cons_sos2.c | Constraint handler for SOS type 2 constraints |
![o](ftv2node.png) cons_sos2.h | Constraint handler for SOS type 2 constraints |
![o](ftv2node.png) cons_superindicator.c | Constraint handler for indicator constraints over arbitrary constraint types |
![o](ftv2node.png) cons_superindicator.h | Constraint handler for indicator constraints over arbitrary constraint types |
![o](ftv2node.png) cons_varbound.c | Constraint handler for variable bound constraints ![$lhs \le x + c y \le rhs$](form_244.png) |
![o](ftv2node.png) cons_varbound.h | Constraint handler for variable bound constraints ![$lhs \leq x + c y \leq rhs$](form_249.png) |
![o](ftv2node.png) cons_xor.c | Constraint handler for "xor" constraints, ![$rhs = x_1 \oplus x_2 \oplus \dots \oplus x_n$](form_250.png) |
![o](ftv2node.png) cons_xor.h | Constraint handler for "xor" constraints, ![$rhs = x_1 \oplus x_2 \oplus \dots \oplus x_n$](form_250.png) |
![o](ftv2node.png) cppmain.cpp | Main file for C++ compilation |
![o](ftv2node.png) cutpool.c | Methods for storing cuts in a cut pool |
![o](ftv2node.png) cutpool.h | Internal methods for storing cuts in a cut pool |
![o](ftv2node.png) debug.c | Methods for debugging |
![o](ftv2node.png) debug.h | Methods for debugging |
![o](ftv2node.png) def.h | Common defines and data types used in all packages of SCIP |
![o](ftv2node.png) dialog.c | Methods for user interface dialog |
![o](ftv2node.png) dialog.h | Internal methods for user interface dialog |
![o](ftv2node.png) dialog_default.c | Default user interface dialog |
![o](ftv2node.png) dialog_default.h | Default user interface dialog |
![o](ftv2node.png) dijkstra.c | C implementation of Dijkstra's algorithm |
![o](ftv2node.png) dijkstra.h | Definitions for Disjkstra's shortest path algorithm |
![o](ftv2node.png) disp.c | Methods and datastructures for displaying runtime statistics |
![o](ftv2node.png) disp.h | Internal methods for displaying runtime statistics |
![o](ftv2node.png) disp_default.c | Default display columns |
![o](ftv2node.png) disp_default.h | Default display columns |
![o](ftv2node.png) event.c | Methods and datastructures for managing events |
![o](ftv2node.png) event.h | Internal methods for managing events |
![o](ftv2node.png) expr.c | Methods for expressions, expression trees, expression graphs, and related |
![o](ftv2node.png) exprinterpret.h | Methods to interpret (evaluate) an expression tree "fast" |
![o](ftv2node.png) exprinterpret_cppad.cpp | Methods to interpret (evaluate) an expression tree "fast" using CppAD |
![o](ftv2node.png) exprinterpret_none.c | Function definitions for nonexisting expression interpreter to resolve linking references |
![o](ftv2node.png) fileio.c | Wrapper functions to map file i/o to standard or zlib file i/o |
![o](ftv2node.png) githash.c | |
![o](ftv2node.png) heur.c | Methods for primal heuristics |
![o](ftv2node.png) heur.h | Internal methods for primal heuristics |
![o](ftv2node.png) heur_actconsdiving.c | LP diving heuristic that chooses fixings w.r.t. the active constraints the variable appear in |
![o](ftv2node.png) heur_actconsdiving.h | LP diving heuristic that chooses fixings w.r.t. the active constraints the variable appear in |
![o](ftv2node.png) heur_clique.c | LNS heuristic using a clique partition to restrict the search neighborhood |
![o](ftv2node.png) heur_clique.h | LNS heuristic using a clique partition to restrict the search neighborhood |
![o](ftv2node.png) heur_coefdiving.c | LP diving heuristic that chooses fixings w.r.t. the matrix coefficients |
![o](ftv2node.png) heur_coefdiving.h | LP diving heuristic that chooses fixings w.r.t. the matrix coefficients |
![o](ftv2node.png) heur_crossover.c | Crossover primal heuristic |
![o](ftv2node.png) heur_crossover.h | LNS heuristic that tries to combine several feasible solutions |
![o](ftv2node.png) heur_dins.c | DINS primal heuristic (according to Ghosh) |
![o](ftv2node.png) heur_dins.h | DINS primal heuristic |
![o](ftv2node.png) heur_dualval.c | Dualval primal heuristic |
![o](ftv2node.png) heur_dualval.h | Primal heuristic that uses dualvalues for successive switching variable values |
![o](ftv2node.png) heur_feaspump.c | Objective Feasibility Pump 2.0 |
![o](ftv2node.png) heur_feaspump.h | Objective Feasibility Pump 2.0 |
![o](ftv2node.png) heur_fixandinfer.c | Fix-and-infer primal heuristic |
![o](ftv2node.png) heur_fixandinfer.h | Fix-and-infer primal heuristic |
![o](ftv2node.png) heur_fracdiving.c | LP diving heuristic that chooses fixings w.r.t. the fractionalities |
![o](ftv2node.png) heur_fracdiving.h | LP diving heuristic that chooses fixings w.r.t. the fractionalities |
![o](ftv2node.png) heur_guideddiving.c | LP diving heuristic that chooses fixings in direction of incumbent solutions |
![o](ftv2node.png) heur_guideddiving.h | LP diving heuristic that chooses fixings in direction of incumbent solutions |
![o](ftv2node.png) heur_intdiving.c | LP diving heuristic that fixes variables with integral LP value |
![o](ftv2node.png) heur_intdiving.h | LP diving heuristic that fixes variables with integral LP value |
![o](ftv2node.png) 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 |
![o](ftv2node.png) 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 |
![o](ftv2node.png) heur_linesearchdiving.c | LP diving heuristic that fixes variables with a large difference to their root solution |
![o](ftv2node.png) heur_linesearchdiving.h | LP diving heuristic that fixes variables with a large difference to their root solution |
![o](ftv2node.png) heur_localbranching.c | Local branching heuristic according to Fischetti and Lodi |
![o](ftv2node.png) heur_localbranching.h | Local branching heuristic according to Fischetti and Lodi |
![o](ftv2node.png) heur_mutation.c | LNS heuristic that tries to randomly mutate the incumbent solution |
![o](ftv2node.png) heur_mutation.h | LNS heuristic that tries to randomly mutate the incumbent solution |
![o](ftv2node.png) heur_nlpdiving.c | NLP diving heuristic that chooses fixings w.r.t. the fractionalities |
![o](ftv2node.png) heur_nlpdiving.h | NLP diving heuristic that chooses fixings w.r.t. the fractionalities |
![o](ftv2node.png) heur_objpscostdiving.c | LP diving heuristic that changes variable's objective value instead of bounds, using pseudo cost values as guide |
![o](ftv2node.png) heur_objpscostdiving.h | LP diving heuristic that changes variable's objective value instead of bounds, using pseudo cost values as guide |
![o](ftv2node.png) heur_octane.c | Octane primal heuristic based on Balas, Ceria, Dawande, Margot, and Pataki |
![o](ftv2node.png) heur_octane.h | Octane primal heuristic based on Balas, Ceria, Dawande, Margot, and Pataki |
![o](ftv2node.png) heur_oneopt.c | Improvement heuristic that alters single variable values |
![o](ftv2node.png) heur_oneopt.h | Improvement heuristic that alters single variable values |
![o](ftv2node.png) 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 |
![o](ftv2node.png) 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 |
![o](ftv2node.png) heur_pscostdiving.c | LP diving heuristic that chooses fixings w.r.t. the pseudo cost values |
![o](ftv2node.png) heur_pscostdiving.h | LP diving heuristic that chooses fixings w.r.t. the pseudo cost values |
![o](ftv2node.png) heur_randrounding.c | Randomized LP rounding heuristic which also generates conflicts via an auxiliary probing tree |
![o](ftv2node.png) heur_randrounding.h | Randomized LP rounding heuristic which also generates conflicts via an auxiliary probing tree |
![o](ftv2node.png) heur_rens.c | LNS heuristic that finds the optimal rounding to a given point |
![o](ftv2node.png) heur_rens.h | LNS heuristic that finds the optimal rounding to a given point |
![o](ftv2node.png) heur_rins.c | LNS heuristic that combines the incumbent with the LP optimum |
![o](ftv2node.png) heur_rins.h | LNS heuristic that combines the incumbent with the LP optimum |
![o](ftv2node.png) heur_rootsoldiving.c | LP diving heuristic that changes variable's objective values using root LP solution as guide |
![o](ftv2node.png) heur_rootsoldiving.h | LP diving heuristic that changes variables' objective values using root LP solution as guide |
![o](ftv2node.png) heur_rounding.c | LP rounding heuristic that tries to recover from intermediate infeasibilities |
![o](ftv2node.png) heur_rounding.h | LP rounding heuristic that tries to recover from intermediate infeasibilities |
![o](ftv2node.png) heur_shiftandpropagate.c | Shiftandpropagate primal heuristic |
![o](ftv2node.png) heur_shiftandpropagate.h | Preroot heuristic that alternatingly fixes variables and propagates domains |
![o](ftv2node.png) heur_shifting.c | LP rounding heuristic that tries to recover from intermediate infeasibilities and shifts continuous variables |
![o](ftv2node.png) heur_shifting.h | LP rounding heuristic that tries to recover from intermediate infeasibilities and shifts continuous variables |
![o](ftv2node.png) heur_simplerounding.c | Simple and fast LP rounding heuristic |
![o](ftv2node.png) heur_simplerounding.h | Simple and fast LP rounding heuristic |
![o](ftv2node.png) heur_subnlp.c | NLP local search primal heuristic using sub-SCIPs |
![o](ftv2node.png) heur_subnlp.h | NLP local search primal heuristic using sub-SCIPs |
![o](ftv2node.png) heur_trivial.c | Trivial primal heuristic |
![o](ftv2node.png) heur_trivial.h | Trivial primal heuristic |
![o](ftv2node.png) heur_trysol.c | Primal heuristic that tries a given solution |
![o](ftv2node.png) heur_trysol.h | Primal heuristic that tries a given solution |
![o](ftv2node.png) heur_twoopt.c | Primal heuristic to improve incumbent solution by flipping pairs of variables |
![o](ftv2node.png) heur_twoopt.h | Primal heuristic to improve incumbent solution by flipping pairs of variables |
![o](ftv2node.png) heur_undercover.c | Undercover primal heuristic for MINLPs |
![o](ftv2node.png) heur_undercover.h | Undercover primal heuristic for MINLPs |
![o](ftv2node.png) heur_vbounds.c | LNS heuristic uses the variable lower and upper bounds to determine the search neighborhood |
![o](ftv2node.png) heur_vbounds.h | LNS heuristic uses the variable lower and upper bounds to determine the search neighborhood |
![o](ftv2node.png) heur_veclendiving.c | LP diving heuristic that rounds variables with long column vectors |
![o](ftv2node.png) heur_veclendiving.h | LP diving heuristic that rounds variables with long column vectors |
![o](ftv2node.png) heur_zeroobj.c | Heuristic that tries to solve the problem without objective. In Gurobi, this heuristic is known as "Hail Mary" |
![o](ftv2node.png) heur_zeroobj.h | Heuristic that tries to solve the problem without objective. In Gurobi, this heuristic is known as "Hail Mary" |
![o](ftv2node.png) heur_zirounding.c | Zirounding primal heuristic |
![o](ftv2node.png) heur_zirounding.h | ZI Round primal heuristic |
![o](ftv2node.png) history.c | Methods for branching and inference history |
![o](ftv2node.png) history.h | Internal methods for branching and inference history |
![o](ftv2node.png) howtoadd.dxy | List of how to add "stuff" |
![o](ftv2node.png) implics.c | Methods for implications, variable bounds, and clique tables |
![o](ftv2node.png) implics.h | Methods for implications, variable bounds, and cliques |
![o](ftv2node.png) interfaces.dxy | Interface documentation page |
![o](ftv2node.png) interrupt.c | Methods and datastructures for catching the user CTRL-C interrupt |
![o](ftv2node.png) interrupt.h | Methods for catching the user CTRL-C interrupt |
![o](ftv2node.png) intervalarith.c | Interval arithmetics for provable bounds |
![o](ftv2node.png) intervalarith.h | Interval arithmetics for provable bounds |
![o](ftv2node.png) intervalarithext.cpp | C++ extensions to interval arithmetics for provable bounds |
![o](ftv2node.png) intervalarithext.h | C++ extensions to interval arithmetics for provable bounds |
![o](ftv2node.png) lp.c | LP management methods and data structures |
![o](ftv2node.png) lp.h | Internal methods for LP management |
![o](ftv2node.png) lpi.h | Interface methods for specific LP solvers |
![o](ftv2node.png) lpi_clp.cpp | LP interface for Clp |
![o](ftv2node.png) lpi_cpx.c | LP interface for CPLEX >= 8.0 |
![o](ftv2node.png) lpi_grb.c | LP interface for Gurobi |
![o](ftv2node.png) lpi_msk.c | LP interface for MOSEK |
![o](ftv2node.png) lpi_none.c | Dummy interface for the case no LP solver is needed |
![o](ftv2node.png) lpi_qso.c | LP interface for QSopt version >= 070303 |
![o](ftv2node.png) lpi_spx.cpp | LP interface for SoPlex version 1.4 and higher |
![o](ftv2node.png) lpi_spx2.cpp | |
![o](ftv2node.png) lpi_xprs.c | LP interface for Xpress-MP 16-21 |
![o](ftv2node.png) mem.c | Block memory pools and memory buffers |
![o](ftv2node.png) mem.h | Methods for block memory pools and memory buffers |
![o](ftv2node.png) memory.c | Memory allocation routines |
![o](ftv2node.png) memory.h | Memory allocation routines |
![o](ftv2node.png) message.c | Message output methods |
![o](ftv2node.png) message.h | Message output methods |
![o](ftv2node.png) message_default.c | Default message handler |
![o](ftv2node.png) message_default.h | Default message handler |
![o](ftv2node.png) misc.c | Miscellaneous methods |
![o](ftv2node.png) misc.h | Internal miscellaneous methods |
![o](ftv2node.png) nlp.c | NLP management methods and datastructures |
![o](ftv2node.png) nlp.h | Internal methods for NLP management |
![o](ftv2node.png) nlpi.c | Methods for handling nlp interface |
![o](ftv2node.png) nlpi.h | Internal methods for NLPI solver interfaces |
![o](ftv2node.png) nlpi_ipopt.cpp | Ipopt NLP interface |
![o](ftv2node.png) nlpi_ipopt.h | Ipopt NLP interface |
![o](ftv2node.png) nlpi_ipopt_dummy.c | Dummy Ipopt NLP interface for the case that Ipopt is not available |
![o](ftv2node.png) nlpioracle.c | Implementation of NLPI oracle interface |
![o](ftv2node.png) nlpioracle.h | Methods to store an NLP and request function, gradient, and hessian values |
![o](ftv2node.png) nodesel.c | Methods for node selectors |
![o](ftv2node.png) nodesel.h | Internal methods for node selectors and node priority queues |
![o](ftv2node.png) nodesel_bfs.c | Node selector for best first search |
![o](ftv2node.png) nodesel_bfs.h | Node selector for best first search |
![o](ftv2node.png) nodesel_breadthfirst.c | |
![o](ftv2node.png) nodesel_breadthfirst.h | Node selector for breadth-first search |
![o](ftv2node.png) nodesel_dfs.c | Node selector for depth first search |
![o](ftv2node.png) nodesel_dfs.h | Node selector for depth first search |
![o](ftv2node.png) nodesel_estimate.c | Node selector for best estimate search |
![o](ftv2node.png) nodesel_estimate.h | Node selector for best estimate search |
![o](ftv2node.png) nodesel_hybridestim.c | Node selector for hybrid best estimate / best bound search |
![o](ftv2node.png) nodesel_hybridestim.h | Node selector for hybrid best estimate / best bound search |
![o](ftv2node.png) nodesel_restartdfs.c | Node selector for depth first search with periodical selection of the best node |
![o](ftv2node.png) nodesel_restartdfs.h | Node selector for depth first search with periodical selection of the best node |
![o](ftv2node.png) nodesel_uct.c | Uct node selector which balances exploration and exploitation by considering node visits |
![o](ftv2node.png) nodesel_uct.h | Uct node selector which balances exploration and exploitation by considering node visits |
![o](ftv2node.png) objbranchrule.cpp | C++ wrapper for branching rules |
![o](ftv2node.png) objbranchrule.h | C++ wrapper for branching rules |
![o](ftv2node.png) objcloneable.h | Definition of base class for all clonable classes |
![o](ftv2node.png) objconshdlr.cpp | C++ wrapper for constraint handlers |
![o](ftv2node.png) objconshdlr.h | C++ wrapper for constraint handlers |
![o](ftv2node.png) objdialog.cpp | C++ wrapper for dialogs |
![o](ftv2node.png) objdialog.h | C++ wrapper for dialogs |
![o](ftv2node.png) objdisp.cpp | C++ wrapper for display column |
![o](ftv2node.png) objdisp.h | C++ wrapper for display columns |
![o](ftv2node.png) objeventhdlr.cpp | C++ wrapper for event handlers |
![o](ftv2node.png) objeventhdlr.h | C++ wrapper for event handlers |
![o](ftv2node.png) objheur.cpp | C++ wrapper for primal heuristics |
![o](ftv2node.png) objheur.h | C++ wrapper for primal heuristics |
![o](ftv2node.png) objmessagehdlr.cpp | C++ wrapper for message handlers |
![o](ftv2node.png) objmessagehdlr.h | C++ wrapper for message handlers |
![o](ftv2node.png) objnodesel.cpp | C++ wrapper for node selectors |
![o](ftv2node.png) objnodesel.h | C++ wrapper for node selectors |
![o](ftv2node.png) objpresol.cpp | C++ wrapper for presolvers |
![o](ftv2node.png) objpresol.h | C++ wrapper for presolvers |
![o](ftv2node.png) objpricer.cpp | C++ wrapper for variable pricers |
![o](ftv2node.png) objpricer.h | C++ wrapper for variable pricers |
![o](ftv2node.png) objprobcloneable.h | Definition of base class for all clonable classes which define problem data |
![o](ftv2node.png) objprobdata.cpp | C++ wrapper for user problem data |
![o](ftv2node.png) objprobdata.h | C++ wrapper for user problem data |
![o](ftv2node.png) objprop.cpp | C++ wrapper for propagators |
![o](ftv2node.png) objprop.h | C++ wrapper for propagators |
![o](ftv2node.png) objreader.cpp | C++ wrapper for file readers |
![o](ftv2node.png) objreader.h | C++ wrapper for file readers and writers |
![o](ftv2node.png) objrelax.cpp | C++ wrapper for relaxators |
![o](ftv2node.png) objrelax.h | C++ wrapper for relaxation handlers |
![o](ftv2node.png) objscip.h | C++ wrapper classes for SCIP |
![o](ftv2node.png) objscipdefplugins.h | C++ wrapper for default SCIP plugins |
![o](ftv2node.png) objsepa.cpp | C++ wrapper for cut separators |
![o](ftv2node.png) objsepa.h | C++ wrapper for cut separators |
![o](ftv2node.png) objvardata.cpp | C++ wrapper for user variable data |
![o](ftv2node.png) objvardata.h | C++ wrapper for user variable data |
![o](ftv2node.png) paramset.c | Methods for handling parameter settings |
![o](ftv2node.png) paramset.h | Internal methods for handling parameter settings |
![o](ftv2node.png) presol.c | Methods for presolvers |
![o](ftv2node.png) presol.h | Internal methods for presolvers |
![o](ftv2node.png) presol_boundshift.c | Presolver that converts variables with domain [a,b] to variables with domain [0,b-a] |
![o](ftv2node.png) presol_boundshift.h | Presolver that converts integer variables with domain [a,b] to integer variables with domain [0,b-a] |
![o](ftv2node.png) presol_components.c | Solve independent components in advance |
![o](ftv2node.png) presol_components.h | Components presolver |
![o](ftv2node.png) presol_convertinttobin.c | Presolver that converts integer variables to binaries |
![o](ftv2node.png) presol_convertinttobin.h | Presolver that converts integer variables with domain [a,a+1] to binaries |
![o](ftv2node.png) presol_domcol.c | Dominated column presolver |
![o](ftv2node.png) presol_domcol.h | Dominated column presolver |
![o](ftv2node.png) presol_dualinfer.c | Dual inference presolver |
![o](ftv2node.png) presol_dualinfer.h | Dual inference presolver |
![o](ftv2node.png) presol_gateextraction.c | Gateextraction presolver |
![o](ftv2node.png) presol_gateextraction.h | Gateextraction presolver |
![o](ftv2node.png) presol_implics.c | Implics presolver |
![o](ftv2node.png) presol_implics.h | Implication graph presolver which checks for aggregations |
![o](ftv2node.png) presol_inttobinary.c | Presolver that converts integer variables with domain [a,a+1] to binaries |
![o](ftv2node.png) presol_inttobinary.h | Presolver that converts integer variables with domain [a,a+1] to binaries |
![o](ftv2node.png) presol_trivial.c | Trivial presolver: round fractional bounds on integer variables, fix variables with equal bounds |
![o](ftv2node.png) presol_trivial.h | Trivial presolver: round fractional bounds on integer variables, fix variables with equal bounds |
![o](ftv2node.png) presolve.c | Methods for presolving |
![o](ftv2node.png) presolve.h | Internal methods for presolving |
![o](ftv2node.png) pricer.c | Methods for variable pricers |
![o](ftv2node.png) pricer.h | Internal methods for variable pricers |
![o](ftv2node.png) pricestore.c | Methods for storing priced variables |
![o](ftv2node.png) pricestore.h | Internal methods for storing priced variables |
![o](ftv2node.png) primal.c | Methods for collecting primal CIP solutions and primal informations |
![o](ftv2node.png) primal.h | Internal methods for collecting primal CIP solutions and primal informations |
![o](ftv2node.png) prob.c | Methods and datastructures for storing and manipulating the main problem |
![o](ftv2node.png) prob.h | Internal methods for storing and manipulating the main problem |
![o](ftv2node.png) prop.c | Methods and datastructures for propagators |
![o](ftv2node.png) prop.h | Internal methods for propagators |
![o](ftv2node.png) prop_dualfix.c | Fixing roundable variables to best bound |
![o](ftv2node.png) prop_dualfix.h | Fixing roundable variables to best bound |
![o](ftv2node.png) prop_genvbounds.c | Generalized variable bounds propagator |
![o](ftv2node.png) prop_genvbounds.h | Generalized variable bounds propagator |
![o](ftv2node.png) prop_obbt.c | Optimization-based bound tightening propagator |
![o](ftv2node.png) prop_obbt.h | Optimization-based bound tightening propagator |
![o](ftv2node.png) prop_probing.c | Probing propagator |
![o](ftv2node.png) prop_probing.h | Probing propagator |
![o](ftv2node.png) prop_pseudoobj.c | Pseudo objective propagator |
![o](ftv2node.png) prop_pseudoobj.h | Pseudo objective propagator |
![o](ftv2node.png) prop_redcost.c | Propagator using the LP reduced cost and the cutoff bound |
![o](ftv2node.png) prop_redcost.h | Propagator using the LP reduced cost and the cutoff bound |
![o](ftv2node.png) prop_rootredcost.c | Reduced cost strengthening using root node reduced costs and the cutoff bound |
![o](ftv2node.png) prop_rootredcost.h | Reduced cost strengthening using root node reduced costs and the cutoff bound |
![o](ftv2node.png) prop_vbounds.c | Variable upper and lower bound propagator |
![o](ftv2node.png) prop_vbounds.h | Variable upper and lower bound propagator |
![o](ftv2node.png) pub_branch.h | Public methods for branching rules |
![o](ftv2node.png) pub_conflict.h | Public methods for conflict analysis handlers |
![o](ftv2node.png) pub_cons.h | Public methods for managing constraints |
![o](ftv2node.png) pub_cutpool.h | Public methods for storing cuts in a cut pool |
![o](ftv2node.png) pub_dialog.h | Public methods for user interface dialog |
![o](ftv2node.png) pub_disp.h | Public methods for displaying runtime statistics |
![o](ftv2node.png) pub_event.h | Public methods for managing events |
![o](ftv2node.png) pub_expr.h | Public methods for expressions, expression trees, expression graphs, and related stuff |
![o](ftv2node.png) pub_fileio.h | Wrapper functions to map file i/o to standard or zlib file i/o |
![o](ftv2node.png) pub_heur.h | Public methods for primal heuristics |
![o](ftv2node.png) pub_history.h | Public methods for branching and inference history structure |
![o](ftv2node.png) pub_implics.h | Public methods for implications, variable bounds, and cliques |
![o](ftv2node.png) pub_lp.h | Public methods for LP management |
![o](ftv2node.png) pub_message.h | Public methods for message output |
![o](ftv2node.png) pub_misc.h | Public data structures and miscellaneous methods |
![o](ftv2node.png) pub_nlp.h | Public methods for NLP management |
![o](ftv2node.png) pub_nodesel.h | Public methods for node selectors |
![o](ftv2node.png) pub_paramset.h | Public methods for handling parameter settings |
![o](ftv2node.png) pub_presol.h | Public methods for presolvers |
![o](ftv2node.png) pub_pricer.h | Public methods for variable pricers |
![o](ftv2node.png) pub_prop.h | Public methods for propagators |
![o](ftv2node.png) pub_reader.h | Public methods for input file readers |
![o](ftv2node.png) pub_relax.h | Public methods for relaxation handlers |
![o](ftv2node.png) pub_sepa.h | Public methods for separators |
![o](ftv2node.png) pub_sol.h | Public methods for primal CIP solutions |
![o](ftv2node.png) pub_tree.h | Public methods for branch and bound tree |
![o](ftv2node.png) pub_var.h | Public methods for problem variables |
![o](ftv2node.png) reader.c | Interface for input file readers |
![o](ftv2node.png) reader.h | Internal methods for input file readers |
![o](ftv2node.png) reader_bnd.c | File reader for variable bounds |
![o](ftv2node.png) reader_bnd.h | File reader for variable bounds |
![o](ftv2node.png) reader_ccg.c | Graph file reader (actually, only a writer) |
![o](ftv2node.png) reader_ccg.h | Column connectivity graph file reader (actually, only a writer) |
![o](ftv2node.png) reader_cip.c | CIP file reader |
![o](ftv2node.png) reader_cip.h | CIP file reader |
![o](ftv2node.png) reader_cnf.c | CNF file reader |
![o](ftv2node.png) reader_cnf.h | CNF file reader |
![o](ftv2node.png) reader_fix.c | File reader for variable fixings |
![o](ftv2node.png) reader_fix.h | File reader for variable fixings |
![o](ftv2node.png) reader_fzn.c | FlatZinc file reader |
![o](ftv2node.png) reader_fzn.h | FlatZinc file reader |
![o](ftv2node.png) reader_gms.c | GAMS file writer |
![o](ftv2node.png) reader_gms.h | GAMS file reader and writer |
![o](ftv2node.png) reader_lp.c | LP file reader |
![o](ftv2node.png) reader_lp.h | LP file reader |
![o](ftv2node.png) reader_mps.c | (extended) MPS file reader |
![o](ftv2node.png) reader_mps.h | (extended) MPS file reader |
![o](ftv2node.png) reader_opb.c | Pseudo-Boolean file reader (opb format) |
![o](ftv2node.png) reader_opb.h | Pseudo-Boolean file reader (opb format) |
![o](ftv2node.png) reader_osil.c | OS instance language (OSiL) format file reader |
![o](ftv2node.png) reader_osil.h | OS instance language (OSiL) format file reader |
![o](ftv2node.png) reader_pbm.c | File writer for portable bitmap file format (PBM), open with common graphic viewer programs (e.g. xview) |
![o](ftv2node.png) reader_pbm.h | File writer for portable bitmap file format (PBM), open with common graphic viewer programs (e.g. xview) |
![o](ftv2node.png) reader_pip.c | File reader for polynomial mixed-integer programs in PIP format |
![o](ftv2node.png) reader_pip.h | File reader for polynomial mixed-integer programs in PIP format |
![o](ftv2node.png) reader_ppm.c | File writer for portable pixmap file format (PPM), open with common graphic viewer programs (e.g. xview) |
![o](ftv2node.png) reader_ppm.h | File writer for portable pixmap file format (PPM), open with common graphic viewer programs (e.g. xview) |
![o](ftv2node.png) reader_rlp.c | RLP file reader (LP format with generic variables and row names) |
![o](ftv2node.png) reader_rlp.h | RLP file reader (LP format with generic variables and row names) |
![o](ftv2node.png) reader_sol.c | File reader for primal solutions |
![o](ftv2node.png) reader_sol.h | File reader for primal solutions |
![o](ftv2node.png) reader_wbo.c | WBO file reader (OPB format with weighted constraints) |
![o](ftv2node.png) reader_wbo.h | WBO file reader (LP format with generic variables and row names) |
![o](ftv2node.png) reader_zpl.c | ZIMPL model file reader |
![o](ftv2node.png) reader_zpl.h | ZIMPL model file reader |
![o](ftv2node.png) relax.c | Methods and datastructures for relaxation handlers |
![o](ftv2node.png) relax.h | Internal methods for relaxators |
![o](ftv2node.png) retcode.c | Methods for return codes for SCIP methods |
![o](ftv2node.png) retcode.h | Internal methods for return codes for SCIP methods |
![o](ftv2node.png) scip.c | SCIP callable library |
![o](ftv2node.png) scip.h | SCIP callable library |
![o](ftv2node.png) scipdefplugins.c | Default SCIP plugins |
![o](ftv2node.png) scipdefplugins.h | Default SCIP plugins |
![o](ftv2node.png) scipgithash.c | Git hash methods |
![o](ftv2node.png) scipgithash.h | Git hash methods |
![o](ftv2node.png) scipshell.c | SCIP command line interface |
![o](ftv2node.png) scipshell.h | SCIP command line interface |
![o](ftv2node.png) sepa.c | Methods and datastructures for separators |
![o](ftv2node.png) sepa.h | Internal methods for separators |
![o](ftv2node.png) sepa_cgmip.c | Chvatal-Gomory cuts computed via a sub-MIP |
![o](ftv2node.png) sepa_cgmip.h | Chvatal-Gomory cuts computed via a sub-MIP |
![o](ftv2node.png) sepa_clique.c | Clique separator |
![o](ftv2node.png) sepa_clique.h | Clique separator |
![o](ftv2node.png) sepa_closecuts.c | Closecuts meta separator |
![o](ftv2node.png) sepa_closecuts.h | Closecuts meta separator |
![o](ftv2node.png) sepa_cmir.c | Complemented mixed integer rounding cuts separator (Marchand's version) |
![o](ftv2node.png) sepa_cmir.h | Complemented mixed integer rounding cuts separator (Marchand's version) |
![o](ftv2node.png) sepa_flowcover.c | Flow cover cuts separator |
![o](ftv2node.png) sepa_flowcover.h | Flowcover separator |
![o](ftv2node.png) sepa_gomory.c | Gomory MIR Cuts |
![o](ftv2node.png) sepa_gomory.h | Gomory MIR Cuts |
![o](ftv2node.png) sepa_impliedbounds.c | Implied bounds separator |
![o](ftv2node.png) sepa_impliedbounds.h | Implied bounds separator |
![o](ftv2node.png) sepa_intobj.c | Integer objective value separator |
![o](ftv2node.png) sepa_intobj.h | Integer objective value separator |
![o](ftv2node.png) sepa_mcf.c | Multi-commodity-flow network cut separator |
![o](ftv2node.png) sepa_mcf.h | Multi-commodity-flow network cut separator |
![o](ftv2node.png) sepa_oddcycle.c | Oddcycle separator |
![o](ftv2node.png) sepa_oddcycle.h | Oddcycle separator |
![o](ftv2node.png) sepa_rapidlearning.c | Rapidlearning separator |
![o](ftv2node.png) sepa_rapidlearning.h | Rapidlearning separator |
![o](ftv2node.png) sepa_strongcg.c | Strong CG Cuts (Letchford & Lodi) |
![o](ftv2node.png) sepa_strongcg.h | Strong CG Cuts (Letchford & Lodi) |
![o](ftv2node.png) sepa_zerohalf.c | {0,1/2}-cuts separator |
![o](ftv2node.png) sepa_zerohalf.h | {0,1/2}-cuts separator |
![o](ftv2node.png) sepastore.c | Methods for storing separated cuts |
![o](ftv2node.png) sepastore.h | Internal methods for storing separated cuts |
![o](ftv2node.png) set.c | Methods for global SCIP settings |
![o](ftv2node.png) set.h | Internal methods for global SCIP settings |
![o](ftv2node.png) sol.c | Methods for storing primal CIP solutions |
![o](ftv2node.png) sol.h | Internal methods for storing primal CIP solutions |
![o](ftv2node.png) solve.c | Main solving loop and node processing |
![o](ftv2node.png) solve.h | Internal methods for main solving loop and node processing |
![o](ftv2node.png) sorttpl.c | Template functions for sorting |
![o](ftv2node.png) stat.c | Methods for problem statistics |
![o](ftv2node.png) stat.h | Internal methods for problem statistics |
![o](ftv2node.png) struct_branch.h | Datastructures for branching rules and branching candidate storage |
![o](ftv2node.png) struct_buffer.h | Datastructures for memory buffers for temporary objects |
![o](ftv2node.png) struct_clock.h | Datastructures for clocks and timing issues |
![o](ftv2node.png) struct_conflict.h | Datastructures for conflict analysis |
![o](ftv2node.png) struct_cons.h | Datastructures for constraints and constraint handlers |
![o](ftv2node.png) struct_cutpool.h | Datastructures for storing cuts in a cut pool |
![o](ftv2node.png) struct_dialog.h | Datastructures for user interface dialog |
![o](ftv2node.png) struct_disp.h | Datastructures for displaying runtime statistics |
![o](ftv2node.png) struct_event.h | Datastructures for managing events |
![o](ftv2node.png) struct_expr.h | Data definitions for expressions and expression trees |
![o](ftv2node.png) struct_heur.h | Datastructures for primal heuristics |
![o](ftv2node.png) struct_history.h | Datastructures for branching and inference history |
![o](ftv2node.png) struct_implics.h | Datastructures for implications, variable bounds, and cliques |
![o](ftv2node.png) struct_lp.h | Datastructures for LP management |
![o](ftv2node.png) struct_mem.h | Datastructures for block memory pools and memory buffers |
![o](ftv2node.png) struct_message.h | Datastructures for problem statistics |
![o](ftv2node.png) struct_misc.h | Miscellaneous datastructures |
![o](ftv2node.png) struct_nlp.h | Datastructures for NLP management |
![o](ftv2node.png) struct_nlpi.h | Data definitions for an NLP solver interface |
![o](ftv2node.png) struct_nodesel.h | Datastructures for node selectors and node priority queues |
![o](ftv2node.png) struct_paramset.h | Datastructures for handling parameter settings |
![o](ftv2node.png) struct_presol.h | Datastructures for presolvers |
![o](ftv2node.png) struct_pricer.h | Datastructures for variable pricers |
![o](ftv2node.png) struct_pricestore.h | Datastructures for storing priced variables |
![o](ftv2node.png) struct_primal.h | Datastructures for collecting primal CIP solutions and primal informations |
![o](ftv2node.png) struct_prob.h | Datastructures for storing and manipulating the main problem |
![o](ftv2node.png) struct_prop.h | Datastructures for propagators |
![o](ftv2node.png) struct_reader.h | Datastructures for input file readers |
![o](ftv2node.png) struct_relax.h | Datastructures for relaxators |
![o](ftv2node.png) struct_scip.h | SCIP main data structure |
![o](ftv2node.png) struct_sepa.h | Datastructures for separators |
![o](ftv2node.png) struct_sepastore.h | Datastructures for storing separated cuts |
![o](ftv2node.png) struct_set.h | Datastructures for global SCIP settings |
![o](ftv2node.png) struct_sol.h | Datastructures for storing primal CIP solutions |
![o](ftv2node.png) struct_stat.h | Datastructures for problem statistics |
![o](ftv2node.png) struct_tree.h | Datastructures for branch and bound tree |
![o](ftv2node.png) struct_var.h | Datastructures for problem variables |
![o](ftv2node.png) struct_vbc.h | Datastructures for VBC Tool output |
![o](ftv2node.png) tclique.h | Tclique user interface |
![o](ftv2node.png) tclique_branch.c | Branch and bound part of algorithm for maximum cliques |
![o](ftv2node.png) tclique_coloring.c | Coloring part of algorithm for maximum cliques |
![o](ftv2node.png) tclique_coloring.h | Coloring part of algorithm for maximum cliques |
![o](ftv2node.png) tclique_def.h | Tclique defines |
![o](ftv2node.png) tclique_graph.c | Graph data part of algorithm for maximum cliques |
![o](ftv2node.png) tree.c | Methods for branch and bound tree |
![o](ftv2node.png) tree.h | Internal methods for branch and bound tree |
![o](ftv2node.png) type_branch.h | Type definitions for branching rules |
![o](ftv2node.png) type_buffer.h | Type definitions for memory buffers for temporary objects |
![o](ftv2node.png) type_clock.h | Type definitions for clocks and timing issues |
![o](ftv2node.png) type_conflict.h | Type definitions for conflict analysis |
![o](ftv2node.png) type_cons.h | Type definitions for constraints and constraint handlers |
![o](ftv2node.png) type_cutpool.h | Type definitions for storing cuts in a cut pool |
![o](ftv2node.png) type_dialog.h | Type definitions for user interface dialog |
![o](ftv2node.png) type_disp.h | Type definitions for displaying runtime statistics |
![o](ftv2node.png) type_event.h | Type definitions for managing events |
![o](ftv2node.png) type_expr.h | Type definitions for expressions and expression trees |
![o](ftv2node.png) type_exprinterpret.h | Type definitions for expression interpreter |
![o](ftv2node.png) type_heur.h | Type definitions for primal heuristics |
![o](ftv2node.png) type_history.h | Type definitions for branching and inference history |
![o](ftv2node.png) type_implics.h | Type definitions for implications, variable bounds, and cliques |
![o](ftv2node.png) type_interrupt.h | Type definitions for catching the user CTRL-C interrupt |
![o](ftv2node.png) type_lp.h | Type definitions for LP management |
![o](ftv2node.png) type_lpi.h | Type definitions for specific LP solvers interface |
![o](ftv2node.png) type_mem.h | Type definitions for block memory pools and memory buffers |
![o](ftv2node.png) type_message.h | Type definitions for message output methods |
![o](ftv2node.png) type_misc.h | Type definitions for miscellaneous datastructures |
![o](ftv2node.png) type_nlp.h | Type definitions for NLP management |
![o](ftv2node.png) type_nlpi.h | Type definitions for specific NLP solver interfaces |
![o](ftv2node.png) type_nodesel.h | Type definitions for node selectors |
![o](ftv2node.png) type_objcloneable.h | Function type definitions for clonable classes |
![o](ftv2node.png) type_objprobcloneable.h | Function type definitions for clonable classes which define problem data |
![o](ftv2node.png) type_paramset.h | Type definitions for handling parameter settings |
![o](ftv2node.png) type_presol.h | Type definitions for presolvers |
![o](ftv2node.png) type_pricer.h | Type definitions for variable pricers |
![o](ftv2node.png) type_pricestore.h | Type definitions for storing priced variables |
![o](ftv2node.png) type_primal.h | Type definitions for collecting primal CIP solutions and primal informations |
![o](ftv2node.png) type_prob.h | Type definitions for storing and manipulating the main problem |
![o](ftv2node.png) type_prop.h | Type definitions for propagators |
![o](ftv2node.png) type_reader.h | Type definitions for input file readers |
![o](ftv2node.png) type_relax.h | Type definitions for relaxators |
![o](ftv2node.png) type_result.h | Result codes for SCIP callback methods |
![o](ftv2node.png) type_retcode.h | Type definitions for return codes for SCIP methods |
![o](ftv2node.png) type_scip.h | Type definitions for SCIP's main datastructure |
![o](ftv2node.png) type_sepa.h | Type definitions for separators |
![o](ftv2node.png) type_sepastore.h | Type definitions for storing separated cuts |
![o](ftv2node.png) type_set.h | Type definitions for global SCIP settings |
![o](ftv2node.png) type_sol.h | Type definitions for storing primal CIP solutions |
![o](ftv2node.png) type_stat.h | Type definitions for problem statistics |
![o](ftv2node.png) type_timing.h | Timing definitions for SCIP |
![o](ftv2node.png) type_tree.h | Type definitions for branch and bound tree |
![o](ftv2node.png) type_var.h | Type definitions for problem variables |
![o](ftv2node.png) type_vbc.h | Type definitions for VBC Tool output |
![o](ftv2node.png) var.c | Methods for problem variables |
![o](ftv2node.png) var.h | Internal methods for problem variables |
![o](ftv2node.png) vbc.c | Methods for VBC Tool output |
![o](ftv2node.png) vbc.h | Methods for VBC Tool output |
![o](ftv2node.png) xml.h | Declarations for XML parsing |
![o](ftv2node.png) xmldef.h | Definitions for XML parsing |
![o](ftv2node.png) xmlparse.c | |
![\](ftv2lastnode.png) xternal.c | Main document page |