Detailed DescriptionLNS heuristic using a clique partition to restrict the search neighborhood. clique primal heuristic Definition in file heur_clique.c. #include <assert.h> #include <string.h> #include "scip/scip.h" #include "scip/heur_clique.h" #include "scip/cons_logicor.h" Go to the source code of this file.
Macro Definition Documentation
Definition at line 36 of file heur_clique.c. Referenced by createNewSol().
Definition at line 37 of file heur_clique.c.
Definition at line 38 of file heur_clique.c.
Definition at line 39 of file heur_clique.c.
Definition at line 40 of file heur_clique.c.
Definition at line 41 of file heur_clique.c.
Definition at line 42 of file heur_clique.c.
Definition at line 43 of file heur_clique.c.
does the heuristic use a secondary SCIP instance? Definition at line 44 of file heur_clique.c.
maximum number of nodes to regard in the subproblem Definition at line 46 of file heur_clique.c.
minimum percentage of variables that have to be fixed Definition at line 47 of file heur_clique.c.
factor by which clique heuristic should at least improve the incumbent Definition at line 48 of file heur_clique.c.
minimum number of nodes to regard in the subproblem Definition at line 53 of file heur_clique.c.
number of nodes added to the contingent of the total nodes Definition at line 54 of file heur_clique.c.
subproblem nodes in relation to nodes of the original problem Definition at line 55 of file heur_clique.c.
maximum number of propagation rounds during probing Definition at line 56 of file heur_clique.c.
random seed value to initialize the random permutation value for variables Definition at line 57 of file heur_clique.c.
value to increase node number to determine the next run Definition at line 62 of file heur_clique.c.
should all active cuts from the cutpool of the original scip be copied to constraints of the subscip Definition at line 63 of file heur_clique.c. Function Documentation
comparison method for sorting variables by non-decreasing index Definition at line 100 of file heur_clique.c.
sort the binary variable array w.r.t. the clique partition; thereby ensure the current order within the cliques are not changed
Definition at line 123 of file heur_clique.c. References applyCliqueFixings(), BMSclearMemoryArray, BMScopyMemoryArray, NULL, SCIP_CALL, SCIP_OKAY, SCIPallocBufferArray, SCIPfreeBufferArray, and SCIPvarGetObj().
apply clique fixing using probing
Definition at line 225 of file heur_clique.c. References createNewSol(), FALSE, NULL, SCIP_Bool, SCIP_CALL, SCIP_FOUNDSOL, SCIP_OKAY, SCIPdebugMessage, SCIPfixVarProbing(), SCIPgetDepth(), SCIPgetDepthLimit(), SCIPgetProbingDepth(), SCIPgetSolOrigObj(), SCIPisStopped(), SCIPlinkCurrentSol(), SCIPnewProbingNode(), SCIPpropagateProbing(), SCIProundSol(), SCIPtrySol(), SCIPvarGetLbLocal(), SCIPvarGetName(), SCIPvarGetUbLocal(), and TRUE. Referenced by stableSortBinvars().
creates a new solution for the original problem by copying the solution of the subproblem
Definition at line 390 of file heur_clique.c. References FALSE, HEUR_NAME, NULL, SCIP_CALL, SCIP_DECL_HEURCOPY(), SCIP_OKAY, SCIP_Real, SCIPallocBufferArray, SCIPfreeBufferArray, SCIPgetNOrigVars(), SCIPgetSolVals(), SCIPgetVarsData(), SCIPheurGetName(), SCIPsetSolVals(), SCIPtrySol(), and TRUE. Referenced by applyCliqueFixings().
copy method for primal heuristic plugins (called when SCIP copies plugins) Definition at line 438 of file heur_clique.c. Referenced by createNewSol().
destructor of primal heuristic to free user data (called when SCIP is exiting) Definition at line 452 of file heur_clique.c.
initialization method of primal heuristic (called after problem was transformed) Definition at line 473 of file heur_clique.c.
execution method of primal heuristic Definition at line 496 of file heur_clique.c.
creates the clique primal heuristic and includes it in SCIP
Definition at line 1080 of file heur_clique.c. Referenced by SCIPincludeDefaultPlugins(). |