type_heur.h File Reference Detailed Descriptiontype definitions for primal heuristics This file defines the interface for primal heuristics implemented in C.
Definition in file type_heur.h. #include "scip/def.h" #include "scip/type_scip.h" #include "scip/type_result.h" #include "scip/type_timing.h" Go to the source code of this file.
Macro Definition Documentation
represents different methods for a dive set to explore the next children no method specified Definition at line 44 of file type_heur.h.
use branching on a variable by shrinking the domain in the child nodes Definition at line 45 of file type_heur.h.
branch on a variable solution value by exploiting special-ordered set conflict structure Definition at line 46 of file type_heur.h.
copy method for heuristic plugins (called when SCIP copies plugins) input:
Definition at line 60 of file type_heur.h.
destructor of primal heuristic to free user data (called when SCIP is exiting) input:
Definition at line 68 of file type_heur.h.
initialization method of primal heuristic (called after problem was transformed) input:
Definition at line 76 of file type_heur.h.
deinitialization method of primal heuristic (called before transformed problem is freed) input:
Definition at line 84 of file type_heur.h.
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. input:
Definition at line 95 of file type_heur.h.
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. input:
Definition at line 106 of file type_heur.h.
Value:
SCIP_Bool nodeinfeasible, SCIP_RESULT* result)
Definition: objbranchrule.h:33 execution method of primal heuristic Searches for feasible primal solutions. The method is called in the node processing loop. input:
possible return values for *result:
Definition at line 126 of file type_heur.h.
Value:
SCIP_RETCODE x (SCIP* scip, SCIP_DIVESET* diveset, SCIP_DIVETYPE divetype, SCIP_VAR* cand, SCIP_Real candsol, SCIP_Real candsfrac, \
Definition: objbranchrule.h:33 calculate score and preferred rounding direction for the candidate variable; the best candidate maximizes the score input:
returns SCIP_OKAY if everything worked, otherwise, a suitable error code Definition at line 146 of file type_heur.h. Typedef Documentation
Definition at line 48 of file type_heur.h.
primal heuristic Definition at line 50 of file type_heur.h.
locally defined primal heuristic data Definition at line 51 of file type_heur.h.
common parameters for all diving heuristics Definition at line 52 of file type_heur.h. |