stptest_heurtm.c
Go to the documentation of this file.
26 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
48 graph, NULL, NULL, steinertree_edges, graph->terms - 1, 2, graph->cost, graph->cost, NULL, NULL, &success) );
101 STPTEST_ASSERT_MSG_ARGS(EQ(cost_tmfull, cost_expected), "wrong cost: expected=%f, real=%f \n", cost_expected, cost_tmfull);
160 STPTEST_ASSERT_MSG_ARGS(EQ(cost_tmfull, cost_expected), "wrong cost: expected=%f, real=%f \n", cost_expected, cost_tmfull);
225 STPTEST_ASSERT_MSG_ARGS(EQ(cost_tmfull, cost_expected), "wrong cost: expected=%f, real=%f \n", cost_expected, cost_tmfull);
285 STPTEST_ASSERT_MSG_ARGS(EQ(cost_pruned, cost_expected), "wrong cost: expected=%f, real=%f \n", cost_expected, cost_pruned);
350 STPTEST_ASSERT_MSG_ARGS(EQ(cost_pruned, cost_expected), "wrong cost: expected=%f, real=%f \n", cost_expected, cost_pruned);
411 STPTEST_ASSERT_MSG_ARGS(EQ(cost_pruned, cost_expected), "wrong cost: expected=%f, real=%f \n", cost_expected, cost_pruned);
Definition: graphdefs.h:184
Definition: struct_scip.h:59
Definition: heur_tm.h:48
void graph_edge_addBi(SCIP *, GRAPH *, int, int, double)
SCIP_RETCODE stptest_graphSetUpRmwExtended(SCIP *, GRAPH *, int *, int *)
Definition: stptest_graph.c:351
includes methods for Steiner tree problem solutions
SCIP_RETCODE SCIPStpHeurTMRun(SCIP *scip, enum PCMW_TmMode pcmw_tmmode, GRAPH *graph, int *starts, const SCIP_Real *prize, int *best_result, int runs, int bestincstart, SCIP_Real *cost, SCIP_Real *costrev, SCIP_Real *hopfactor, SCIP_Real *nodepriority, SCIP_Bool *success)
Definition: heur_tm.c:3418
static SCIP_RETCODE testTmGivesExpectedTreePcFull3(SCIP *scip)
Definition: stptest_heurtm.c:173
includes various files containing graph methods used for Steiner tree problems
static SCIP_RETCODE runTmPcFull(SCIP *scip, GRAPH *graph, int *steinertree_edges)
Definition: stptest_heurtm.c:39
SCIP_Real graph_pc_getNonLeafTermOffset(SCIP *, const GRAPH *)
Definition: graph_pcbase.c:2209
static SCIP_RETCODE testPrunedSolIsImprovedPc2(SCIP *scip)
Definition: stptest_heurtm.c:299
SCIP_RETCODE graph_pc_initPrizes(SCIP *, GRAPH *, int)
Definition: graph_pcbase.c:741
Definition: type_retcode.h:33
static SCIP_RETCODE testTmGivesExpectedTreePcFull2(SCIP *scip)
Definition: stptest_heurtm.c:113
SCIP_Real solstp_getObjBounded(const GRAPH *g, const int *soledge, SCIP_Real offset, int nedges)
Definition: solstp.c:1833
static SCIP_RETCODE testTmGivesExpectedTreePcFull1(SCIP *scip)
Definition: stptest_heurtm.c:58
Portable definitions.
static SCIP_RETCODE testPrunedSolIsImprovedPc1(SCIP *scip)
Definition: stptest_heurtm.c:237
includes various testing methods for Steiner tree problems
shortest paths based primal heuristics for Steiner problems
SCIP_RETCODE stptest_graphSetUpPcExtended(SCIP *, GRAPH *, int *, int *)
Definition: stptest_graph.c:375
Definition: objbenders.h:33
SCIP_RETCODE solstp_prune(SCIP *scip, const GRAPH *g, int *result, STP_Bool *connected)
Definition: solstp.c:1366