heur_locks.h
Go to the documentation of this file.
31 * The locks heuristic is a start heuristic that first tries to fix all binary variables, then solves the resulting LP
32 * and tries to round the solution and finally solves a sub-MIP on the remaining problem if the LP solution could not be
33 * rounded. The fixing works as follows: First, all variables are sorted by their total number of rounding locks (up-
34 * and down-locks summed up). Then, looking at the variable with the highest number of locks first, the variable is
35 * fixed to the bound where there are fewer locks (in case of ties, the bound which is better w.r.t. the objective
36 * function). This fix is propagated and the activities of all LP rows are updated. If any LP row becomes redundant
40 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
Definition: struct_scip.h:68
SCIP_RETCODE SCIPapplyLockFixings(SCIP *scip, SCIP_HEURDATA *heurdata, SCIP_Bool *cutoff, SCIP_Bool *allrowsfulfilled)
Definition: heur_locks.c:196
type definitions for return codes for SCIP methods
type definitions for primal heuristics
type definitions for SCIP's main datastructure
common defines and data types used in all packages of SCIP
Definition: objbenders.h:43