heur_actconsdiving.h
Go to the documentation of this file.
27 * @brief LP diving heuristic that chooses fixings w.r.t. the active constraints the variable appear in
30 * Diving heuristic: Iteratively fixes some fractional variable and resolves the LP-relaxation, thereby simulating a
31 * depth-first-search in the tree. Active Constraint Diving chooses a variable based on the active LP rows (equations
32 * are counted twice here). The variable score is calculated as a convex combination of the number of constraints the
33 * variable appears in, the sum of all positive coefficients and the absolute sum of all negative coefficients. The
34 * chosen variable is then rounded to the closest integer. One-level backtracking is applied: If the LP gets infeasible,
35 * the last fixings is undone, and the opposite fixing is tried. If this is infeasible, too, the procedure aborts.
38 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
Definition: struct_scip.h:68
type definitions for return codes for SCIP methods
type definitions for SCIP's main datastructure
common defines and data types used in all packages of SCIP
SCIP_RETCODE SCIPincludeHeurActconsdiving(SCIP *scip)
Definition: heur_actconsdiving.c:374
Definition: objbenders.h:43