heur_rounding.h
Go to the documentation of this file.
21 * Rounding heuristic that starts from an LP-feasible point and reduces the number of fractional variables by one in 22 * each step. As long as no LP row is violated, the algorithm iterates over the fractional variables and applies a 23 * rounding into the direction of fewer locks, updating the activities of the LP rows after each step. If there is a 24 * violated LP row, the heuristic will try to find a fractional variable that can be rounded in a direction such that 25 * the violation of the constraint is decreased, using the number of up- and down-locks as a tie breaker. If no 29 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/ SCIP_RETCODE SCIPincludeHeurRounding(SCIP *scip) Definition: objbranchrule.h:33 SCIP callable library. |