Solving Constraint Integer Programs

heur_coefdiving.h File Reference

Detailed Description

LP diving heuristic that chooses fixings w.r.t. the matrix coefficients.

Tobias Achterberg

Diving heuristic: Iteratively fixes some fractional variable and resolves the LP-relaxation, thereby simulating a depth-first-search in the tree. Coefficient Diving chooses the variable with the fewest locking number in any direction and rounds it into this direction. One-level backtracking is applied: If the LP gets infeasible, the last fixing is undone, and the opposite fixing is tried. If this is infeasible, too, the procedure aborts.

Definition in file heur_coefdiving.h.

#include "scip/def.h"
#include "scip/type_retcode.h"
#include "scip/type_scip.h"

Go to the source code of this file.


SCIP_RETCODE SCIPincludeHeurCoefdiving (SCIP *scip)