pricer_coloring.h
Go to the documentation of this file.
23 * the current LP solution. This is done by computing a maximum weighted stable set in the current
28 * The pricer first tries to compute such a stable set using a a greedy-method. If it fails, the tclique-algorithm is
29 * used on the complementary graph. This is a branch-and-bound based algorithm for maximal cliques,
30 * included in SCIP. In this case, not only the best solution is added to the LP, but also all other
31 * stable sets found during the branch-and-bound process that could improve the current LP solution
35 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
51 /** sets the way, the pricer handles variables with negative reduced costs found during the tclique-algorithm
52 if onlybest is true, only the best n variables are added to the lp, while onlybest = false means, that
Definition: struct_scip.h:59
problem data for vertex coloring algorithm
void COLORpricerUseTclique(SCIP *scip, SCIP_Bool usetclique)
void COLORpricerUseGreedy(SCIP *scip, SCIP_Bool usegreedy)
void COLORpricerSetNVarsCreatedPerRound(SCIP *scip, int nvars)
void COLORpricerUseOnlyBestStableSets(SCIP *scip, SCIP_Bool onlybest)
SCIP_RETCODE SCIPincludePricerColoring(SCIP *scip)
Definition: pricer_coloring.c:875
Definition: objbenders.h:33