heur_rounding.h
Go to the documentation of this file.
30 * Rounding heuristic that starts from an LP-feasible point and reduces the number of fractional variables by one in
31 * each step. As long as no LP row is violated, the algorithm iterates over the fractional variables and applies a
32 * rounding into the direction of fewer locks, updating the activities of the LP rows after each step. If there is a
33 * violated LP row, the heuristic will try to find a fractional variable that can be rounded in a direction such that
34 * the violation of the constraint is decreased, using the number of up- and down-locks as a tie breaker. If no
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
SCIP_RETCODE SCIPincludeHeurRounding(SCIP *scip)
Definition: heur_rounding.c:762
type definitions for SCIP's main datastructure
common defines and data types used in all packages of SCIP
Definition: objbenders.h:43