|
file | branch_allfullstrong.h [code] |
| all variables full strong LP branching rule
|
|
file | branch_cloud.h [code] |
| cloud branching rule
|
|
file | branch_distribution.h [code] |
| probability based branching rule based on an article by J. Pryor and J.W. Chinneck
|
|
file | branch_fullstrong.h [code] |
| full strong LP branching rule
|
|
file | branch_inference.h [code] |
| inference history branching rule
|
|
file | branch_leastinf.h [code] |
| least infeasible LP branching rule
|
|
file | branch_mostinf.h [code] |
| most infeasible LP branching rule
|
|
file | branch_multaggr.h [code] |
| fullstrong branching on fractional and multi-aggregated variables
|
|
file | branch_nodereopt.h [code] |
| nodereopt branching rule
|
|
file | branch_pscost.h [code] |
| pseudo costs branching rule
|
|
file | branch_random.h [code] |
| random variable branching rule
|
|
file | branch_relpscost.h [code] |
| reliable pseudo costs branching rule
|
|
file | compr_largestrepr.h [code] |
| largestrepr tree compression
|
|
file | compr_weakcompr.h [code] |
| weakcompr tree compression
|
|
file | cons_abspower.h [code] |
| Constraint handler for absolute power constraints .
|
|
file | cons_and.h [code] |
| Constraint handler for "and" constraints, .
|
|
file | cons_bivariate.h [code] |
| constraint handler for bivariate nonlinear constraints
|
|
file | cons_bounddisjunction.h [code] |
| constraint handler for bound disjunction constraints
|
|
file | cons_conjunction.h [code] |
| constraint handler for conjunction constraints
|
|
file | cons_countsols.h [code] |
| Constraint handler for counting feasible solutions.
|
|
file | cons_cumulative.h [code] |
| constraint handler for cumulative constraints
|
|
file | cons_disjunction.h [code] |
| constraint handler for disjunction constraints
|
|
file | cons_indicator.h [code] |
| constraint handler for indicator constraints
|
|
file | cons_integral.h [code] |
| constraint handler for the integrality constraint
|
|
file | cons_knapsack.h [code] |
| Constraint handler for knapsack constraints of the form , x binary and .
|
|
file | cons_linear.h [code] |
| Constraint handler for linear constraints in their most general form, .
|
|
file | cons_linking.h [code] |
| constraint handler for linking binary variables to an integer variable
|
|
file | cons_logicor.h [code] |
| Constraint handler for logicor constraints (equivalent to set covering, but algorithms are suited for depth first search).
|
|
file | cons_nonlinear.h [code] |
| constraint handler for nonlinear constraints
|
|
file | cons_or.h [code] |
| Constraint handler for "or" constraints, .
|
|
file | cons_orbitope.h [code] |
| constraint handler for (partitioning/packing) orbitope constraints w.r.t. the full symmetric group
|
|
file | cons_pseudoboolean.h [code] |
| constraint handler for pseudoboolean constraints
|
|
file | cons_quadratic.h [code] |
| constraint handler for quadratic constraints
|
|
file | cons_setppc.h [code] |
| Constraint handler for the set partitioning / packing / covering constraints .
|
|
file | cons_soc.h [code] |
| constraint handler for second order cone constraints
|
|
file | cons_sos1.h [code] |
| constraint handler for SOS type 1 constraints
|
|
file | cons_sos2.h [code] |
| constraint handler for SOS type 2 constraints
|
|
file | cons_superindicator.h [code] |
| constraint handler for indicator constraints over arbitrary constraint types
|
|
file | cons_varbound.h [code] |
| Constraint handler for variable bound constraints .
|
|
file | cons_xor.h [code] |
| Constraint handler for "xor" constraints, .
|
|
file | def.h [code] |
| common defines and data types used in all packages of SCIP
|
|
file | dialog_default.h [code] |
| default user interface dialog
|
|
file | disp_default.h [code] |
| default display columns
|
|
file | event_softtimelimit.h [code] |
| eventhdlr for soft time limit
|
|
file | heur_actconsdiving.h [code] |
| LP diving heuristic that chooses fixings w.r.t. the active constraints the variable appear in.
|
|
file | heur_bound.h [code] |
| heuristic which fixes all integer variables to a bound (lower/upper) and solves the remaining LP
|
|
file | heur_clique.h [code] |
| LNS heuristic using a clique partition to restrict the search neighborhood.
|
|
file | heur_coefdiving.h [code] |
| LP diving heuristic that chooses fixings w.r.t. the matrix coefficients.
|
|
file | heur_crossover.h [code] |
| LNS heuristic that tries to combine several feasible solutions.
|
|
file | heur_dins.h [code] |
| DINS primal heuristic.
|
|
file | heur_distributiondiving.h [code] |
| Diving heuristic that chooses fixings w.r.t. changes in the solution density after Pryor and Chinneck.
|
|
file | heur_dualval.h [code] |
| primal heuristic that uses dualvalues for successive switching variable values
|
|
file | heur_feaspump.h [code] |
| Objective Feasibility Pump 2.0.
|
|
file | heur_fixandinfer.h [code] |
| fix-and-infer primal heuristic
|
|
file | heur_fracdiving.h [code] |
| LP diving heuristic that chooses fixings w.r.t. the fractionalities.
|
|
file | heur_guideddiving.h [code] |
| LP diving heuristic that chooses fixings in direction of incumbent solutions.
|
|
file | heur_indicator.h [code] |
| handle partial solutions for linear problems with indicators and otherwise continuous variables
|
|
file | heur_intdiving.h [code] |
| LP diving heuristic that fixes variables with integral LP value.
|
|
file | heur_intshifting.h [code] |
| 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.
|
|
file | heur_linesearchdiving.h [code] |
| LP diving heuristic that fixes variables with a large difference to their root solution.
|
|
file | heur_localbranching.h [code] |
| Local branching heuristic according to Fischetti and Lodi.
|
|
file | heur_mutation.h [code] |
| LNS heuristic that tries to randomly mutate the incumbent solution.
|
|
file | heur_nlpdiving.h [code] |
| NLP diving heuristic that chooses fixings w.r.t. the fractionalities.
|
|
file | heur_objpscostdiving.h [code] |
| LP diving heuristic that changes variable's objective value instead of bounds, using pseudo cost values as guide.
|
|
file | heur_octane.h [code] |
| octane primal heuristic based on Balas, Ceria, Dawande, Margot, and Pataki
|
|
file | heur_ofins.h [code] |
| OFINS - Objective Function Induced Neighborhood Search - a primal heuristic for reoptimization.
|
|
file | heur_oneopt.h [code] |
| Improvement heuristic that alters single variable values.
|
|
file | heur_proximity.h [code] |
| 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
|
|
file | heur_pscostdiving.h [code] |
| LP diving heuristic that chooses fixings w.r.t. the pseudo cost values.
|
|
file | heur_randrounding.h [code] |
| randomized LP rounding heuristic which also generates conflicts via an auxiliary probing tree
|
|
file | heur_rens.h [code] |
| LNS heuristic that finds the optimal rounding to a given point.
|
|
file | heur_reoptsols.h [code] |
| reoptsols primal heuristic
|
|
file | heur_rins.h [code] |
| LNS heuristic that combines the incumbent with the LP optimum.
|
|
file | heur_rootsoldiving.h [code] |
| LP diving heuristic that changes variables' objective values using root LP solution as guide.
|
|
file | heur_rounding.h [code] |
| LP rounding heuristic that tries to recover from intermediate infeasibilities.
|
|
file | heur_shiftandpropagate.h [code] |
| preroot heuristic that alternatingly fixes variables and propagates domains
|
|
file | heur_shifting.h [code] |
| LP rounding heuristic that tries to recover from intermediate infeasibilities and shifts continuous variables.
|
|
file | heur_simplerounding.h [code] |
| Simple and fast LP rounding heuristic.
|
|
file | heur_subnlp.h [code] |
| NLP local search primal heuristic using sub-SCIPs.
|
|
file | heur_trivial.h [code] |
| trivial primal heuristic
|
|
file | heur_trivialnegation.h [code] |
| trivialnegation primal heuristic
|
|
file | heur_trysol.h [code] |
| primal heuristic that tries a given solution
|
|
file | heur_twoopt.h [code] |
| Primal heuristic to improve incumbent solution by flipping pairs of variables.
|
|
file | heur_undercover.h [code] |
| Undercover primal heuristic for MINLPs.
|
|
file | heur_vbounds.h [code] |
| LNS heuristic uses the variable lower and upper bounds to determine the search neighborhood.
|
|
file | heur_veclendiving.h [code] |
| LP diving heuristic that rounds variables with long column vectors.
|
|
file | heur_zeroobj.h [code] |
| heuristic that tries to solve the problem without objective. In Gurobi, this heuristic is known as "Hail Mary"
|
|
file | heur_zirounding.h [code] |
| ZI Round primal heuristic.
|
|
file | message_default.h [code] |
| default message handler
|
|
file | nodesel_bfs.h [code] |
| node selector for best first search
|
|
file | nodesel_breadthfirst.h [code] |
| node selector for breadth-first search
|
|
file | nodesel_dfs.h [code] |
| node selector for depth first search
|
|
file | nodesel_estimate.h [code] |
| node selector for best estimate search
|
|
file | nodesel_hybridestim.h [code] |
| node selector for hybrid best estimate / best bound search
|
|
file | nodesel_restartdfs.h [code] |
| node selector for depth first search with periodical selection of the best node
|
|
file | nodesel_uct.h [code] |
| uct node selector which balances exploration and exploitation by considering node visits
|
|
file | presol_boundshift.h [code] |
| presolver that converts integer variables with domain [a,b] to integer variables with domain [0,b-a]
|
|
file | presol_components.h [code] |
| components presolver
|
|
file | presol_convertinttobin.h [code] |
| presolver that converts integer variables with domain [a,a+1] to binaries
|
|
file | presol_domcol.h [code] |
| dominated column presolver
|
|
file | presol_dualagg.h [code] |
| aggregate variables by dual arguments
|
|
file | presol_dualinfer.h [code] |
| dual inference presolver
|
|
|
file | presol_implfree.h [code] |
| exploit implied free variables for multi-aggregation
|
|
file | presol_implics.h [code] |
| implication graph presolver which checks for aggregations
|
|
file | presol_inttobinary.h [code] |
| presolver that converts integer variables with domain [a,a+1] to binaries
|
|
file | presol_redvub.h [code] |
| remove redundant variable upper bound constraints
|
|
file | presol_stuffing.h [code] |
| fix singleton continuous variables
|
|
file | presol_trivial.h [code] |
| trivial presolver: round fractional bounds on integer variables, fix variables with equal bounds
|
|
file | presol_tworowbnd.h [code] |
| do bound tightening by using two rows
|
|
file | prop_dualfix.h [code] |
| fixing roundable variables to best bound
|
|
file | prop_genvbounds.h [code] |
| generalized variable bounds propagator
|
|
file | prop_obbt.h [code] |
| optimization-based bound tightening propagator
|
|
file | prop_probing.h [code] |
| probing propagator
|
|
file | prop_pseudoobj.h [code] |
| Pseudo objective propagator.
|
|
file | prop_redcost.h [code] |
| propagator using the LP reduced cost and the cutoff bound
|
|
file | prop_rootredcost.h [code] |
| reduced cost strengthening using root node reduced costs and the cutoff bound
|
|
file | prop_vbounds.h [code] |
| variable upper and lower bound propagator
|
|
file | pub_branch.h [code] |
| public methods for branching rules
|
|
file | pub_compr.h [code] |
| public methods for tree compressions
|
|
file | pub_conflict.h [code] |
| public methods for conflict analysis handlers
|
|
file | pub_cons.h [code] |
| public methods for managing constraints
|
|
file | pub_cutpool.h [code] |
| public methods for storing cuts in a cut pool
|
|
file | pub_dialog.h [code] |
| public methods for user interface dialog
|
|
file | pub_disp.h [code] |
| public methods for displaying runtime statistics
|
|
file | pub_dive.h [code] |
| library methods for diving heuristics
|
|
file | pub_event.h [code] |
| public methods for managing events
|
|
file | pub_fileio.h [code] |
| wrapper functions to map file i/o to standard or zlib file i/o
|
|
file | pub_heur.h [code] |
| public methods for primal heuristics
|
|
file | pub_history.h [code] |
| public methods for branching and inference history structure
|
|
file | pub_implics.h [code] |
| public methods for implications, variable bounds, and cliques
|
|
file | pub_lp.h [code] |
| public methods for LP management
|
|
file | pub_matrix.h [code] |
| public methods for matrix
|
|
file | pub_message.h [code] |
| public methods for message output
|
|
file | pub_misc.h [code] |
| public data structures and miscellaneous methods
|
|
file | pub_nlp.h [code] |
| public methods for NLP management
|
|
file | pub_nodesel.h [code] |
| public methods for node selectors
|
|
file | pub_paramset.h [code] |
| public methods for handling parameter settings
|
|
file | pub_presol.h [code] |
| public methods for presolvers
|
|
file | pub_pricer.h [code] |
| public methods for variable pricers
|
|
file | pub_prop.h [code] |
| public methods for propagators
|
|
file | pub_reader.h [code] |
| public methods for input file readers
|
|
file | pub_relax.h [code] |
| public methods for relaxation handlers
|
|
file | pub_reopt.h [code] |
| public methods for reoptimization
|
|
file | pub_sepa.h [code] |
| public methods for separators
|
|
file | pub_sol.h [code] |
| public methods for primal CIP solutions
|
|
file | pub_tree.h [code] |
| public methods for branch and bound tree
|
|
file | pub_var.h [code] |
| public methods for problem variables
|
|
file | reader_bnd.h [code] |
| file reader for variable bounds
|
|
file | reader_ccg.h [code] |
| Column connectivity graph file reader (actually, only a writer)
|
|
file | reader_cip.h [code] |
| CIP file reader.
|
|
file | reader_cnf.h [code] |
| CNF file reader.
|
|
file | reader_diff.h [code] |
| diff file reader
|
|
file | reader_fix.h [code] |
| file reader for variable fixings
|
|
file | reader_fzn.h [code] |
| FlatZinc file reader.
|
|
file | reader_gms.h [code] |
| GAMS file reader and writer.
|
|
file | reader_lp.h [code] |
| LP file reader.
|
|
file | reader_mps.h [code] |
| (extended) MPS file reader
|
|
file | reader_opb.h [code] |
| pseudo-Boolean file reader (opb format)
|
|
file | reader_osil.h [code] |
| OS instance language (OSiL) format file reader.
|
|
file | reader_pbm.h [code] |
| file writer for portable bitmap file format (PBM), open with common graphic viewer programs (e.g. xview)
|
|
file | reader_pip.h [code] |
| file reader for polynomial mixed-integer programs in PIP format
|
|
file | reader_ppm.h [code] |
| file writer for portable pixmap file format (PPM), open with common graphic viewer programs (e.g. xview)
|
|
file | reader_rlp.h [code] |
| RLP file reader (LP format with generic variables and row names)
|
|
file | reader_sol.h [code] |
| file reader for primal solutions
|
|
file | reader_wbo.h [code] |
| WBO file reader (LP format with generic variables and row names)
|
|
file | reader_zpl.h [code] |
| ZIMPL model file reader.
|
|
file | scip.h [code] |
| SCIP callable library.
|
|
file | scipdefplugins.h [code] |
| default SCIP plugins
|
|
file | scipgithash.h [code] |
| git hash methods
|
|
file | scipshell.h [code] |
| SCIP command line interface.
|
|
file | sepa_cgmip.h [code] |
| Chvatal-Gomory cuts computed via a sub-MIP.
|
|
file | sepa_clique.h [code] |
| clique separator
|
|
file | sepa_closecuts.h [code] |
| closecuts meta separator
|
|
file | sepa_cmir.h [code] |
| complemented mixed integer rounding cuts separator (Marchand's version)
|
|
file | sepa_disjunctive.h [code] |
| disjunctive cut separator
|
|
file | sepa_eccuts.h [code] |
| edge concave cut separator
|
|
file | sepa_flowcover.h [code] |
| flowcover separator
|
|
file | sepa_gomory.h [code] |
| Gomory MIR Cuts.
|
|
file | sepa_impliedbounds.h [code] |
| implied bounds separator
|
|
file | sepa_intobj.h [code] |
| integer objective value separator
|
|
file | sepa_mcf.h [code] |
| multi-commodity-flow network cut separator
|
|
file | sepa_oddcycle.h [code] |
| oddcycle separator
|
|
file | sepa_rapidlearning.h [code] |
| rapidlearning separator
|
|
file | sepa_strongcg.h [code] |
| Strong CG Cuts (Letchford & Lodi)
|
|
file | sepa_zerohalf.h [code] |
| {0,1/2}-cuts separator
|
|
file | type_branch.h [code] |
| type definitions for branching rules
|
|
file | type_clock.h [code] |
| type definitions for clocks and timing issues
|
|
file | type_compr.h [code] |
| type definitions for tree compression
|
|
file | type_conflict.h [code] |
| type definitions for conflict analysis
|
|
file | type_cons.h [code] |
| type definitions for constraints and constraint handlers
|
|
file | type_cutpool.h [code] |
| type definitions for storing cuts in a cut pool
|
|
file | type_dialog.h [code] |
| type definitions for user interface dialog
|
|
file | type_disp.h [code] |
| type definitions for displaying runtime statistics
|
|
file | type_event.h [code] |
| type definitions for managing events
|
|
file | type_heur.h [code] |
| type definitions for primal heuristics
|
|
file | type_history.h [code] |
| type definitions for branching and inference history
|
|
file | type_implics.h [code] |
| type definitions for implications, variable bounds, and cliques
|
|
file | type_interrupt.h [code] |
| type definitions for catching the user CTRL-C interrupt
|
|
file | type_lp.h [code] |
| type definitions for LP management
|
|
file | type_matrix.h [code] |
| type definitions for MIP matrix
|
|
file | type_mem.h [code] |
| type definitions for block memory pools and memory buffers
|
|
file | type_message.h [code] |
| type definitions for message output methods
|
|
file | type_misc.h [code] |
| type definitions for miscellaneous datastructures
|
|
file | type_nlp.h [code] |
| type definitions for NLP management
|
|
file | type_nodesel.h [code] |
| type definitions for node selectors
|
|
file | type_paramset.h [code] |
| type definitions for handling parameter settings
|
|
file | type_presol.h [code] |
| type definitions for presolvers
|
|
file | type_pricer.h [code] |
| type definitions for variable pricers
|
|
file | type_pricestore.h [code] |
| type definitions for storing priced variables
|
|
file | type_primal.h [code] |
| type definitions for collecting primal CIP solutions and primal informations
|
|
file | type_prob.h [code] |
| type definitions for storing and manipulating the main problem
|
|
file | type_prop.h [code] |
| type definitions for propagators
|
|
file | type_reader.h [code] |
| type definitions for input file readers
|
|
file | type_relax.h [code] |
| type definitions for relaxators
|
|
file | type_reopt.h [code] |
| type definitions for collecting reoptimization information
|
|
file | type_result.h [code] |
| result codes for SCIP callback methods
|
|
file | type_retcode.h [code] |
| type definitions for return codes for SCIP methods
|
|
file | type_scip.h [code] |
| type definitions for SCIP's main datastructure
|
|
file | type_sepa.h [code] |
| type definitions for separators
|
|
file | type_sepastore.h [code] |
| type definitions for storing separated cuts
|
|
file | type_set.h [code] |
| type definitions for global SCIP settings
|
|
file | type_sol.h [code] |
| type definitions for storing primal CIP solutions
|
|
file | type_stat.h [code] |
| type definitions for problem statistics
|
|
file | type_timing.h [code] |
| timing definitions for SCIP
|
|
file | type_tree.h [code] |
| type definitions for branch and bound tree
|
|
file | type_var.h [code] |
| type definitions for problem variables
|
|
file | type_visual.h [code] |
| type definitions for output for visualization tools (VBC, BAK)
|
|