coloringplugins.h
Go to the documentation of this file.
30/*--+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
all variables full strong LP branching rule
default branching rule for the vertex coloring problem
full strong LP branching rule
inference history branching rule
least infeasible LP branching rule
most infeasible LP branching rule
pseudo costs branching rule
random variable branching rule
reliable pseudo costs branching rule
branching rule performing strong branching for the vertex coloring problem
SCIP_RETCODE SCIPincludeColoringPlugins(SCIP *scip)
Definition: coloringplugins.c:39
constraint handler for the integrality constraint
Constraint handler for linear constraints in their most general form, .
Constraint handler for the set partitioning / packing / covering constraints .
constraint handler for storing the graph at each node of the tree
default user interface dialog
default display columns
LP diving heuristic that chooses fixings w.r.t. the active constraints the variable appear in.
LP diving heuristic that chooses fixings w.r.t. the matrix coefficients.
LNS heuristic that tries to combine several feasible solutions.
DINS primal heuristic.
Objective Feasibility Pump 2.0.
fix-and-infer primal heuristic
LP diving heuristic that chooses fixings w.r.t. the fractionalities.
LP diving heuristic that chooses fixings in direction of incumbent solutions.
initial primal heuristic for the vertex coloring problem
LP diving heuristic that fixes variables with integral LP value.
LP rounding heuristic that tries to recover from intermediate infeasibilities, shifts integer variabl...
LP diving heuristic that fixes variables with a large difference to their root solution.
Local branching heuristic according to Fischetti and Lodi.
LNS heuristic that tries to randomly mutate the incumbent solution.
LP diving heuristic that changes variable's objective value instead of bounds, using pseudo cost valu...
octane primal heuristic based on Balas, Ceria, Dawande, Margot, and Pataki
Improvement heuristic that alters single variable values.
LP diving heuristic that chooses fixings w.r.t. the pseudo cost values.
LNS heuristic that finds the optimal rounding to a given point.
LNS heuristic that combines the incumbent with the LP optimum.
LP diving heuristic that changes variables' objective values using root LP solution as guide.
LP rounding heuristic that tries to recover from intermediate infeasibilities.
LP rounding heuristic that tries to recover from intermediate infeasibilities and shifts continuous v...
Simple and fast LP rounding heuristic.
trivial primal heuristic
primal heuristic that tries a given solution
Primal heuristic to improve incumbent solution by flipping pairs of variables.
Undercover primal heuristic for MINLPs.
LP diving heuristic that rounds variables with long column vectors.
ZI Round primal heuristic.
Definition: objbenders.h:44
node selector for best first search
node selector for depth first search
node selector for best estimate search
node selector for hybrid best estimate / best bound search
node selector for depth first search with periodical selection of the best node
variable pricer for the vertex coloring problem
Pseudo objective propagator.
reduced cost strengthening using root node reduced costs and the cutoff bound
file reader for vertex coloring instances
file reader and writer for vertex coloring solutions
SCIP callable library.
SCIP command line interface.
Definition: struct_scip.h:70
default statistics tables