dpterms.h
Go to the documentation of this file.
17 * @brief Dynamic programming solver for Steiner tree (sub-) problems with small number of terminals
20 * This file implements a dynamic programming method to solve Steiner tree problems to optimality.
21 * FPT with respect to the number of terminals. Based on algorithm by Erickson, Monma and Veinott,
24 * It also uses a node-separator technique from "Separator-Based Pruned Dynamic Programming for Steiner Tree"
29 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
Definition: graphdefs.h:184
Definition: struct_scip.h:59
includes various files containing graph methods used for Steiner tree problems
SCIP_RETCODE dpterms_solve(SCIP *, GRAPH *, int *, SCIP_Bool *)
Definition: dpterms_base.c:489
SCIP_Bool dpterms_isPromisingPartly(const GRAPH *)
Definition: dpterms_base.c:518
SCIP_Bool dpterms_isPromisingFully(const GRAPH *)
Definition: dpterms_base.c:563
SCIP_Bool dpterms_isPromisingEmbarrassingly(const GRAPH *)
Definition: dpterms_base.c:554
SCIP callable library.