heur_ascendprune.h
Go to the documentation of this file.
21 * This file implements a reducion and dual-cost based heuristic for Steiner problems. It is based on an approach
26 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
Definition: struct_scip.h:59
SCIP_RETCODE SCIPStpHeurAscendPruneRun(SCIP *scip, SCIP_HEUR *heur, const GRAPH *g, const SCIP_Real *redcosts, int *edgearrint, int *nodearrint, int root, STP_Bool *nodearrchar, SCIP_Bool *solfound, SCIP_Bool addsol)
Definition: heur_ascendprune.c:290
Definition: struct_heur.h:88
SCIP_RETCODE SCIPStpIncludeHeurAscendPrune(SCIP *scip)
Definition: heur_ascendprune.c:619
includes various files containing graph methods used for Steiner tree problems
Definition: objbenders.h:33
SCIP callable library.