type definitions for primal heuristics
This file defines the interface for primal heuristics implemented in C.
Definition in file type_heur.h.
|#define||SCIP_DECL_HEURCOPY(x) SCIP_RETCODE x (SCIP* scip, SCIP_HEUR* heur)|
|#define||SCIP_DECL_HEURFREE(x) SCIP_RETCODE x (SCIP* scip, SCIP_HEUR* heur)|
|#define||SCIP_DECL_HEURINIT(x) SCIP_RETCODE x (SCIP* scip, SCIP_HEUR* heur)|
|#define||SCIP_DECL_HEUREXIT(x) SCIP_RETCODE x (SCIP* scip, SCIP_HEUR* heur)|
|#define||SCIP_DECL_HEURINITSOL(x) SCIP_RETCODE x (SCIP* scip, SCIP_HEUR* heur)|
|#define||SCIP_DECL_HEUREXITSOL(x) SCIP_RETCODE x (SCIP* scip, SCIP_HEUR* heur)|
|typedef unsigned int||SCIP_DIVETYPE|
|typedef struct SCIP_Heur||SCIP_HEUR|
|typedef struct SCIP_HeurData||SCIP_HEURDATA|
|typedef struct SCIP_Diveset||SCIP_DIVESET|
|#define SCIP_DIVETYPE_NONE 0x000u|
|#define SCIP_DIVETYPE_INTEGRALITY 0x001u|
|#define SCIP_DIVETYPE_SOS1VARIABLE 0x002u|
solving process initialization method of primal heuristic (called when branch and bound process is about to begin)
This method is called when the presolving was finished and the branch and bound process is about to begin. The primal heuristic may use this call to initialize its branch and bound specific data.
solving process deinitialization method of primal heuristic (called before branch and bound process data is freed)
This method is called before the branch and bound process is freed. The primal heuristic should use this call to clean up its branch and bound data.
execution method of primal heuristic
Searches for feasible primal solutions. The method is called in the node processing loop.
possible return values for *result:
calculate score and preferred rounding direction for the candidate variable; the best candidate maximizes the score
returns SCIP_OKAY if everything worked, otherwise, a suitable error code
|typedef struct SCIP_HeurData SCIP_HEURDATA|