LNS heuristic that tries to randomly mutate the incumbent solution.
Mutation is a large neighborhood search improvement heuristic that is inspired by genetic algorithms and requires a known feasible solution. It randomly fixes variables to their value in the incumbent solution and solves a sub-SCIP, consisting of the remaining variables. See also heur_crossover.h
Definition in file heur_mutation.h.
|SCIP_RETCODE||SCIPincludeHeurMutation (SCIP *scip)|