Solving Constraint Integer Programs

Detailed Description

LP rounding heuristic that tries to recover from intermediate infeasibilities.

Tobias Achterberg

Rounding heuristic that starts from an LP-feasible point and reduces the number of fractional variables by one in each step. As long as no LP row is violated, the algorithm iterates over the fractional variables and applies a rounding into the direction of fewer locks, updating the activities of the LP rows after each step. If there is a violated LP row, the heuristic will try to find a fractional variable that can be rounded in a direction such that the violation of the constraint is decreased, using the number of up- and down-locks as a tie breaker. If no rounding can decrease the violation of the constraint, the procedure is aborted.

Definition in file heur_rounding.h.

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

Go to the source code of this file.