branch_coloring.h
Go to the documentation of this file.
35 * consider the following two constraints: SAME(v,w) and DIFFER(v,w). SAME(v,w) requires that both
36 * nodes v and w get the same color, whereas DIFFER(v,w) forbids this. For each pair of nodes, each
37 * feasible solution fulfills exactly one of these constraints. Hence, splitting the solution space
38 * into two parts, one fulfilling SAME(v,w) and the other DIFFER(v,w), does not cut off any feasible
43 * s1. Now choose two nodes v, w and another stable set s2, such that v is part of both stable sets,
45 * one with the restriction SAME(v,w), the other one with restriction DIFFER(v,w). Therefore, each
47 * assures that each coloring of the nodes in the respective subgraph assigns to both nodes the same
51 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
Definition: struct_scip.h:68
problem data for vertex coloring algorithm
SCIP_RETCODE SCIPincludeBranchruleColoring(SCIP *scip)
Definition: branch_coloring.c:351
constraint handler for storing the graph at each node of the tree
Constraint handler for the set partitioning / packing / covering constraints .
Definition: objbenders.h:43
SCIP callable library.