All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
heur_rins.h File Reference Detailed DescriptionLNS heuristic that combines the incumbent with the LP optimum. RINS is a large neighborhood search improvement heuristic, i.e., it requires a known feasible solution. It solves a sub-SCIP that is created by fixing variables which take the same value in the incumbent and the current node's LP relaxation. Definition in file heur_rins.h. #include "scip/scip.h" Go to the source code of this file.
Function Documentation
creates RINS primal heuristic and includes it in SCIP creates the RINS primal heuristic and includes it in SCIP
Definition at line 671 of file heur_rins.c. References DEFAULT_COPYCUTS, DEFAULT_LPLIMFAC, 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, SCIP_REAL_MAX, SCIPaddBoolParam(), SCIPaddIntParam(), SCIPaddRealParam(), SCIPallocMemory, SCIPincludeHeurBasic(), SCIPsetHeurCopy(), SCIPsetHeurFree(), SCIPsetHeurInit(), and TRUE. Referenced by SCIP_DECL_HEURCOPY(), and SCIPincludeDefaultPlugins(). |