SCIP

Solving Constraint Integer Programs

heur_prune.h
Go to the documentation of this file.
1 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
2 /* */
3 /* This file is part of the program and library */
4 /* SCIP --- Solving Constraint Integer Programs */
5 /* */
7 /* fuer Informationstechnik Berlin */
8 /* */
10 /* */
12 /* along with SCIP; see the file COPYING. If not visit scip.zib.de. */
13 /* */
14 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
15
16 /**@file heur_prune.h
17  * @ingroup PRIMALHEURISTICS
18  * @brief reduction-based primal heuristic for Steiner problems
19  * @author Daniel Rehfeldt
20  *
21  * This file implements a reducion based heuristic for Steiner problems. It is based on an approach
22  * described in T. Polzin's "Algorithms for the Steiner problem in networks".
23  *
24  */
25
26 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
27
28 #ifndef __SCIP_HEUR_PRUNE_H__
29 #define __SCIP_HEUR_PRUNE_H__
30
31 #include "scip/scip.h"
32 #include "grph.h"
33
34 #ifdef __cplusplus
35 extern "C" {
36 #endif
37
38 /** updates solutions for pruned graph */
40  SCIP* scip, /**< SCIP data structure */
41  GRAPH* g, /**< graph data structure */
42  GRAPH* prunegraph, /**< pruned graph data structure */
43  PATH* path, /**< shortest path struct */
44  int* nodearrint, /**< array */
45  int* edgearrint, /**< array */
46  int* solnode, /**< array for best solution nodes wrt prunegraph */
47  int* soledge, /**< array for best solution edges wrt prunegraph */
48  int* globalsoledge, /**< array storing best solution wrt g */
49  STP_Bool* nodearrchar, /**< array */
50  SCIP_Real* globalobj, /**< pointer to objective value of best solution wrt g */
51  SCIP_Bool incumbentgiven, /**< incumbent solution for pruned graph given? */
52  SCIP_Bool* success /**< pointer to store whether a solution could be found */
53  );
54
55 /** creates the prune primal heuristic and includes it in SCIP */
57  SCIP* scip /**< SCIP data structure */
58  );
59
60 /** execute prune heuristic on given graph */
62  SCIP* scip, /**< SCIP data structure */
63  SCIP_VAR** vars, /**< problem variables or NULL */
64  GRAPH* g, /**< the graph */
65  int* soledge, /**< array to store primal solution (if no solution is provided,
66  solgiven must be set to FALSE) */
67  SCIP_Bool* success, /**< feasible solution found? */
68  const SCIP_Bool withinitialsol, /**< solution given? */
69  const SCIP_Bool reducegraph /**< try to reduce graph initially? */
70  );
71
72 #ifdef __cplusplus
73 }
74 #endif
75
76 #endif
Definition: grph.h:57
SCIP_RETCODE SCIPStpHeurPruneUpdateSols(SCIP *scip, GRAPH *g, GRAPH *prunegraph, PATH *path, int *nodearrint, int *edgearrint, int *solnode, int *soledge, int *globalsoledge, STP_Bool *nodearrchar, SCIP_Real *globalobj, SCIP_Bool incumbentgiven, SCIP_Bool *success)
Definition: heur_prune.c:481
enum SCIP_Retcode SCIP_RETCODE
Definition: type_retcode.h:53
unsigned char STP_Bool
Definition: grph.h:52
SCIP_RETCODE SCIPStpIncludeHeurPrune(SCIP *scip)
Definition: heur_prune.c:907
#define SCIP_Bool
Definition: def.h:70
includes various files containing graph methods used for Steiner tree problems
#define SCIP_Real
Definition: def.h:164
SCIP_RETCODE SCIPStpHeurPruneRun(SCIP *scip, SCIP_VAR **vars, GRAPH *g, int *soledge, SCIP_Bool *success, const SCIP_Bool withinitialsol, const SCIP_Bool reducegraph)
Definition: heur_prune.c:597
SCIP callable library.