Simple and fast LP rounding heuristic.
Simple rounding is a very cheap heuristic that iterates over the set of fractional variables of an LP-feasible point. It only performs roundings for variable that have zero up- or downlocks. Hence, they are guaranteed to keep all constraints satisfied. If all fractional variables can be rounded that way, the resulting solution will bve integral and LP-feasible.
Definition in file heur_simplerounding.h.
|SCIP_RETCODE||SCIPincludeHeurSimplerounding (SCIP *scip)|