heur_mutation.h File Reference Detailed DescriptionLNS 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. #include "scip/scip.h" Go to the source code of this file.
Function Documentation
creates the mutation primal heuristic and includes it in SCIP
Definition at line 643 of file heur_mutation.c. References DEFAULT_COPYCUTS, DEFAULT_MAXNODES, DEFAULT_MINFIXINGRATE, DEFAULT_MINIMPROVE, DEFAULT_MINNODES, DEFAULT_NODESOFS, DEFAULT_NODESQUOT, DEFAULT_NWAITINGNODES, DEFAULT_USELPROWS, FALSE, HEUR_DESC, HEUR_DISPCHAR, HEUR_FREQ, HEUR_FREQOFS, HEUR_MAXDEPTH, HEUR_NAME, HEUR_PRIORITY, HEUR_TIMING, HEUR_USESSUBSCIP, NULL, SCIP_CALL, SCIP_OKAY, SCIPaddBoolParam(), SCIPaddIntParam(), SCIPaddRealParam(), SCIPallocMemory, SCIPincludeHeurBasic(), SCIPsetHeurCopy(), SCIPsetHeurFree(), SCIPsetHeurInit(), SCIPsumepsilon(), and TRUE. Referenced by SCIP_DECL_HEURCOPY(), and SCIPincludeDefaultPlugins(). |