SCIP
Solving Constraint Integer Programs
Solving Constraint Integer Programs
|
scipdefplugins.h
Go to the documentation of this file.
22 /*--+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/ presolver that converts integer variables with domain [a,a+1] to binaries SCIP_RETCODE SCIPincludeDefaultPlugins(SCIP *scip) Definition: scipdefplugins.c:27 constraint handler for disjunction constraints reliable pseudo costs branching rule Primal heuristic to improve incumbent solution by flipping pairs of variables. LNS heuristic using a clique partition to restrict the search neighborhood. RLP file reader (LP format with generic variables and row names) NLP diving heuristic that chooses fixings w.r.t. the fractionalities. primal heuristic that tries a given solution probability based branching rule based on an article by J. Pryor and J.W. Chinneck ... trivialnegation primal heuristic Improvement heuristic that alters single variable values. node selector for hybrid best estimate / best bound search constraint handler for cumulative constraints preroot heuristic that alternatingly fixes variables and propagates domains Definition: struct_scip.h:53 Constraint handler for variable bound constraints . LP rounding heuristic that tries to recover from intermediate infeasibilities and shifts continuous v... CNF file reader. Pseudo objective propagator. LP rounding heuristic that tries to recover from intermediate infeasibilities. reduced cost strengthening using root node reduced costs and the cutoff bound random variable branching rule diff file reader constraint handler for indicator constraints fix singleton continuous variables trivial primal heuristic Undercover primal heuristic for MINLPs. dominated column presolver CIP file reader. aggregate variables by dual arguments node selector for depth first search with periodical selection of the best node LP diving heuristic that chooses fixings in direction of incumbent solutions. default display columns edge concave cut separator LP diving heuristic that chooses fixings w.r.t. the fractionalities. OS instance language (OSiL) format file reader. disjunctive cut separator constraint handler for indicator constraints over arbitrary constraint types least infeasible LP branching rule Constraint handler for "and" constraints, . flowcover separator file writer for portable pixmap file format (PPM), open with common graphic viewer programs (e... nodereopt branching rule constraint handler for second order cone constraints LP diving heuristic that chooses fixings w.r.t. the pseudo cost values. Constraint handler for counting feasible solutions. Constraint handler for the set partitioning / packing / covering constraints . trivial presolver: round fractional bounds on integer variables, fix variables with equal bounds ... file reader for variable bounds LP diving heuristic that chooses fixings w.r.t. the matrix coefficients. constraint handler for (partitioning/packing) orbitope constraints w.r.t. the full symmetric group ... Constraint handler for "or" constraints, . variable upper and lower bound propagator Constraint handler for knapsack constraints of the form , x binary and . LP diving heuristic that fixes variables with integral LP value. primal heuristic that uses dualvalues for successive switching variable values cloud branching rule weakcompr tree compression LNS heuristic that tries to combine several feasible solutions. constraint handler for conjunction constraints SCIP command line interface. propagator using the LP reduced cost and the cutoff bound closecuts meta separator Constraint handler for logicor constraints (equivalent to set covering, but algorithms are suited fo... ZIMPL model file reader. Local branching heuristic according to Fischetti and Lodi. LP diving heuristic that chooses fixings w.r.t. the active constraints the variable appear in... constraint handler for quadratic constraints exploit implied free variables for multi-aggregation LNS heuristic that tries to randomly mutate the incumbent solution. file reader for polynomial mixed-integer programs in PIP format complemented mixed integer rounding cuts separator (Marchand's version) handle partial solutions for linear problems with indicators and otherwise continuous variables ... node selector for best estimate search file writer for portable bitmap file format (PBM), open with common graphic viewer programs (e... LNS heuristic that finds the optimal rounding to a given point. constraint handler for linking binary variables to an integer variable Ipopt NLP interface. full strong LP branching rule LP diving heuristic that changes variables' objective values using root LP solution as guide... pseudo costs branching rule fullstrong branching on fractional and multi-aggregated variables multi-commodity-flow network cut separator WBO file reader (LP format with generic variables and row names) file reader for variable fixings Column connectivity graph file reader (actually, only a writer) fix-and-infer primal heuristic constraint handler for nonlinear constraints LNS heuristic that combines the incumbent with the LP optimum. optimization-based bound tightening propagator implication graph presolver which checks for aggregations Objective Feasibility Pump 2.0. eventhdlr for soft time limit components presolver LNS heuristic uses the variable lower and upper bounds to determine the search neighborhood. Gomory MIR Cuts. reoptsols primal heuristic constraint handler for bivariate nonlinear constraints Constraint handler for linear constraints in their most general form, . Constraint handler for absolute power constraints . integer objective value separator ZI Round primal heuristic. {0,1/2}-cuts separator do bound tightening by using two rows LP diving heuristic that fixes variables with a large difference to their root solution. GAMS file reader and writer. most infeasible LP branching rule implied bounds separator all variables full strong LP branching rule Constraint handler for "xor" constraints, . DINS primal heuristic. Diving heuristic that chooses fixings w.r.t. changes in the solution density after Pryor and Chinneck... remove redundant variable upper bound constraints dual inference presolver LP file reader. pseudo-Boolean file reader (opb format) node selector for best first search heuristic that tries to solve the problem without objective. In Gurobi, this heuristic is known as "H... probing propagator FlatZinc file reader. file reader for primal solutions NLP local search primal heuristic using sub-SCIPs. Chvatal-Gomory cuts computed via a sub-MIP. LP diving heuristic that rounds variables with long column vectors. constraint handler for the integrality constraint inference history branching rule gateextraction presolver constraint handler for SOS type 1 constraints rapidlearning separator Simple and fast LP rounding heuristic. largestrepr tree compression presolver that converts integer variables with domain [a,a+1] to binaries Strong CG Cuts (Letchford & Lodi) octane primal heuristic based on Balas, Ceria, Dawande, Margot, and Pataki randomized LP rounding heuristic which also generates conflicts via an auxiliary probing tree ... constraint handler for pseudoboolean constraints constraint handler for SOS type 2 constraints uct node selector which balances exploration and exploitation by considering node visits ... clique separator LP rounding heuristic that tries to recover from intermediate infeasibilities, shifts integer variabl... constraint handler for bound disjunction constraints LP diving heuristic that changes variable's objective value instead of bounds, using pseudo cost valu... Definition: objbranchrule.h:33 fixing roundable variables to best bound oddcycle separator node selector for depth first search improvement heuristic which uses an auxiliary objective instead of the original objective function wh... node selector for breadth-first search SCIP callable library. (extended) MPS file reader heuristic which fixes all integer variables to a bound (lower/upper) and solves the remaining LP ... generalized variable bounds propagator presolver that converts integer variables with domain [a,b] to integer variables with domain [0... OFINS - Objective Function Induced Neighborhood Search - a primal heuristic for reoptimization. |
