|
All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
Detailed Descriptionlargestrepr tree compression Definition in file compr_largestrepr.c. #include <assert.h>#include "scip/compr_largestrepr.h"#include "scip/compr.h"#include "scip/pub_reopt.h"Go to the source code of this file.
Macro Definition Documentation
Definition at line 30 of file compr_largestrepr.c. Referenced by constructCompression(), SCIP_DECL_COMPREXEC(), and SCIPincludeComprLargestrepr().
Definition at line 31 of file compr_largestrepr.c. Referenced by SCIPincludeComprLargestrepr().
Definition at line 32 of file compr_largestrepr.c. Referenced by SCIPincludeComprLargestrepr().
Definition at line 33 of file compr_largestrepr.c. Referenced by SCIPincludeComprLargestrepr().
Definition at line 35 of file compr_largestrepr.c. Referenced by SCIP_DECL_COMPREXEC(). Function Documentation
calculate a signature of variables fixed to 0 and 1 by using binary shift and or operations. we calculate the signature on the basis of SCIPvarGetProbindex() % 64
Definition at line 69 of file compr_largestrepr.c. References SCIPvarGetProbindex(). Referenced by constructCompression().
try to find a representation of the current search frontier. We use the signatures of variables fixed to 0 and 1 to decide if there is definitely no intersection or if the intersection is potentially non-empty. To find a good representation we start the procedure with a node and choose the best one. the heuristic tries to find a representation of size 2 in each iteration, i.e., runs in the constrained part.
Definition at line 103 of file compr_largestrepr.c. References calcSignature(), COMPR_NAME, FALSE, MAX, NULL, REOPT_CONSTYPE_STRBRANCHED, SCIP_Bool, SCIP_BOUNDTYPE_LOWER, SCIP_BOUNDTYPE_UPPER, SCIP_CALL, SCIP_DIDNOTFIND, SCIP_DIDNOTRUN, SCIP_Longint, SCIP_OKAY, SCIP_Real, SCIP_STAGE_PRESOLVED, SCIP_SUCCESS, SCIPaddReoptnodeBndchg(), SCIPaddReoptnodeCons(), SCIPallocBlockMemoryArray, SCIPallocBufferArray, SCIPallocClearMemoryArray, SCIPcomprGetMinNodes(), SCIPdebugMessage, SCIPfindVar(), SCIPfreeBlockMemoryArray, SCIPfreeBufferArray, SCIPfreeMemoryArray, SCIPfreeRepresentation(), SCIPgetNBinVars(), SCIPgetNOrigVars(), SCIPgetNReoptLeaves(), SCIPgetReoptLeaveIDs(), SCIPgetReoptnode(), SCIPgetReoptnodePath(), SCIPgetStage(), SCIPinitRepresentation(), SCIPisFeasEQ(), SCIPisFeasLT(), SCIPreallocMemoryArray, SCIPreoptnodeGetNVars(), SCIPresetRepresentation(), SCIPvarGetName(), SCIPvarGetProbindex(), and TRUE. Referenced by SCIP_DECL_COMPREXEC().
apply the found representation to the reopttree.
Definition at line 556 of file compr_largestrepr.c. References FALSE, NULL, SCIP_Bool, SCIP_CALL, SCIP_DIDNOTRUN, SCIP_OKAY, SCIP_SUCCESS, SCIPfreeRepresentation(), SCIPreoptnodeSetParentID(), and SCIPsetReoptCompression(). Referenced by SCIP_DECL_COMPREXEC().
destructor of tree compression to free user data (called when SCIP is exiting) Definition at line 596 of file compr_largestrepr.c. References NULL, SCIP_OKAY, SCIPcomprGetData(), SCIPcomprSetData(), and SCIPfreeMemory.
deinitialization method of tree compression (called before transformed problem is freed) Definition at line 614 of file compr_largestrepr.c. References FALSE, NULL, SCIP_OKAY, SCIPcomprGetData(), and SCIPfreeMemoryArray.
execution method of tree compression Definition at line 642 of file compr_largestrepr.c. References applyCompression(), COMPR_NAME, constructCompression(), DEFAUL_MEM_REPR, NULL, SCIP_CALL, SCIP_DIDNOTFIND, SCIP_DIDNOTRUN, SCIP_OKAY, SCIP_SUCCESS, SCIPallocClearMemoryArray, SCIPcomprGetData(), SCIPdebugMessage, SCIPinfinity(), SCIPinitRepresentation(), and TRUE.
creates the largestrepr tree compression and includes it in SCIP
Definition at line 690 of file compr_largestrepr.c. References COMPR_DESC, COMPR_MINNNODES, COMPR_NAME, COMPR_PRIORITY, FALSE, NULL, SCIP_CALL, SCIP_OKAY, SCIPaddIntParam(), SCIPallocMemory, SCIPincludeComprBasic(), SCIPsetComprExit(), and SCIPsetComprFree(). Referenced by SCIPincludeDefaultPlugins(). |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||