repair primal heuristic
repair is a large neighborhood search heuristic, which starts with an infeasible solution and tries to repair it. This can happen by variable fixing as long as the sum of all potential possible shiftings is higher than alpha*slack or slack variables with a strong penalty on the objective function.
Definition in file heur_repair.h.
|SCIP_RETCODE||SCIPincludeHeurRepair (SCIP *scip)|