branch_strongcoloring.h
Go to the documentation of this file.
31 * We are looking for two nodes v and w, which are not adjacent in the current graph, and consider
32 * the following two constraints: SAME(v,w) and DIFFER(v,w). More information about the meaning of
33 * these constraints can be found in the documentation of the branching rule in branch_coloring.c.
36 * strongbranching. This means that for every possible choice of two nodes, it solves the LPs of the
42 * done. There are also some improvements, since testing all possible combination of nodes is very
44 * possible branching is found that has only one feasible child. This results in more restrictions
48 * fractional values of the variables. Then, only the first best k combinations are investigated by
51 * This code is not optimized and in most cases inferior to the standard branching rule. It is only
55 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
Definition: struct_scip.h:68
problem data for vertex coloring algorithm
constraint handler for storing the graph at each node of the tree
SCIP_RETCODE SCIPincludeBranchruleStrongcoloring(SCIP *scip)
Definition: branch_strongcoloring.c:743
Constraint handler for linear constraints in their most general form, .
Definition: objbenders.h:43
SCIP callable library.