Scippy

SCIP

Solving Constraint Integer Programs

implics.h
Go to the documentation of this file.
1 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
2 /* */
3 /* This file is part of the program and library */
4 /* SCIP --- Solving Constraint Integer Programs */
5 /* */
6 /* Copyright (C) 2002-2021 Konrad-Zuse-Zentrum */
7 /* fuer Informationstechnik Berlin */
8 /* */
9 /* SCIP is distributed under the terms of the ZIB Academic License. */
10 /* */
11 /* You should have received a copy of the ZIB Academic License */
12 /* along with SCIP; see the file COPYING. If not visit scipopt.org. */
13 /* */
14 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
15 
16 /**@file implics.h
17  * @ingroup INTERNALAPI
18  * @brief methods for implications, variable bounds, and cliques
19  * @author Tobias Achterberg
20  */
21 
22 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
23 
24 #ifndef __SCIP_IMPLICS_H__
25 #define __SCIP_IMPLICS_H__
26 
27 
28 #include "blockmemshell/memory.h"
29 #include "scip/def.h"
30 #include "scip/type_branch.h"
31 #include "scip/type_event.h"
32 #include "scip/type_implics.h"
33 #include "scip/type_lp.h"
34 #include "scip/type_prob.h"
35 #include "scip/type_reopt.h"
36 #include "scip/type_retcode.h"
37 #include "scip/type_set.h"
38 #include "scip/type_stat.h"
39 #include "scip/type_tree.h"
40 #include "scip/type_var.h"
41 
42 #ifdef NDEBUG
43 #include "scip/pub_implics.h"
44 #include "scip/struct_implics.h"
45 #endif
46 
47 #ifdef __cplusplus
48 extern "C" {
49 #endif
50 
51 /*
52  * Methods for Variable Bounds
53  */
54 
55 /** frees a variable bounds data structure */
56 void SCIPvboundsFree(
57  SCIP_VBOUNDS** vbounds, /**< pointer to store variable bounds data structure */
58  BMS_BLKMEM* blkmem /**< block memory */
59  );
60 
61 /** adds a variable bound to the variable bounds data structure */
63  SCIP_VBOUNDS** vbounds, /**< pointer to variable bounds data structure */
64  BMS_BLKMEM* blkmem, /**< block memory */
65  SCIP_SET* set, /**< global SCIP settings */
66  SCIP_BOUNDTYPE vboundtype, /**< type of variable bound (LOWER or UPPER) */
67  SCIP_VAR* var, /**< variable z in x <= b*z + d or x >= b*z + d */
68  SCIP_Real coef, /**< coefficient b in x <= b*z + d or x >= b*z + d */
69  SCIP_Real constant, /**< constant d in x <= b*z + d or x >= b*z + d */
70  SCIP_Bool* added /**< pointer to store whether the variable bound was added */
71  );
72 
73 /** removes from variable x a variable bound x >=/<= b*z + d with binary or integer z */
75  SCIP_VBOUNDS** vbounds, /**< pointer to variable bounds data structure */
76  BMS_BLKMEM* blkmem, /**< block memory */
77  SCIP_VAR* vbdvar, /**< variable z in x >=/<= b*z + d */
78  SCIP_Bool negativecoef /**< is coefficient b negative? */
79  );
80 
81 /** reduces the number of variable bounds stored in the given variable bounds data structure */
83  SCIP_VBOUNDS** vbounds, /**< pointer to variable bounds data structure */
84  BMS_BLKMEM* blkmem, /**< block memory */
85  int newnvbds /**< new number of variable bounds */
86  );
87 
88 
89 /** gets number of variable bounds contained in given variable bounds data structure */
91  SCIP_VBOUNDS* vbounds /**< variable bounds data structure */
92  );
93 
94 /** gets array of variables contained in given variable bounds data structure */
96  SCIP_VBOUNDS* vbounds /**< variable bounds data structure */
97  );
98 
99 /** gets array of coefficients contained in given variable bounds data structure */
101  SCIP_VBOUNDS* vbounds /**< variable bounds data structure */
102  );
103 
104 /** gets array of constants contained in given variable bounds data structure */
106  SCIP_VBOUNDS* vbounds /**< variable bounds data structure */
107  );
108 
109 #ifdef NDEBUG
110 
111 /* In optimized mode, the function calls are overwritten by defines to reduce the number of function calls and
112  * speed up the algorithms.
113  */
114 
115 #define SCIPvboundsGetNVbds(vbounds) ((vbounds) != NULL ? (vbounds)->len : 0)
116 #define SCIPvboundsGetVars(vbounds) ((vbounds) != NULL ? (vbounds)->vars : NULL)
117 #define SCIPvboundsGetCoefs(vbounds) ((vbounds) != NULL ? (vbounds)->coefs : NULL)
118 #define SCIPvboundsGetConstants(vbounds) ((vbounds) != NULL ? (vbounds)->constants : NULL)
119 
120 #endif
121 
122 
123 
124 
125 /*
126  * Methods for Implications
127  */
128 
129 /** frees an implications data structure */
130 void SCIPimplicsFree(
131  SCIP_IMPLICS** implics, /**< pointer of implications data structure to free */
132  BMS_BLKMEM* blkmem /**< block memory */
133  );
134 
135 /** adds an implication x == 0/1 -> y <= b or y >= b to the implications data structure;
136  * the implication must be non-redundant
137  */
139  SCIP_IMPLICS** implics, /**< pointer to implications data structure */
140  BMS_BLKMEM* blkmem, /**< block memory */
141  SCIP_SET* set, /**< global SCIP settings */
142  SCIP_STAT* stat, /**< problem statistics */
143  SCIP_Bool varfixing, /**< FALSE if implication for x == 0 has to be added, TRUE for x == 1 */
144  SCIP_VAR* implvar, /**< variable y in implication y <= b or y >= b */
145  SCIP_BOUNDTYPE impltype, /**< type of implication y <= b (SCIP_BOUNDTYPE_UPPER) or y >= b (SCIP_BOUNDTYPE_LOWER) */
146  SCIP_Real implbound, /**< bound b in implication y <= b or y >= b */
147  SCIP_Bool isshortcut, /**< is the implication a shortcut, i.e., added as part of the transitive closure of another implication? */
148  SCIP_Bool* conflict, /**< pointer to store whether implication causes a conflict for variable x */
149  SCIP_Bool* added /**< pointer to store whether the implication was added */
150  );
151 
152 /** removes the implication x <= 0 or x >= 1 ==> y <= b or y >= b from the implications data structure */
154  SCIP_IMPLICS** implics, /**< pointer to implications data structure */
155  BMS_BLKMEM* blkmem, /**< block memory */
156  SCIP_SET* set, /**< global SCIP settings */
157  SCIP_Bool varfixing, /**< FALSE if y should be removed from implications for x <= 0, TRUE for x >= 1 */
158  SCIP_VAR* implvar, /**< variable y in implication y <= b or y >= b */
159  SCIP_BOUNDTYPE impltype /**< type of implication y <= b (SCIP_BOUNDTYPE_UPPER) or y >= b (SCIP_BOUNDTYPE_LOWER) */
160  );
161 
162 /** returns which implications on given variable y are contained in implications for x == 0 or x == 1 */
164  SCIP_IMPLICS* implics, /**< implications data structure */
165  SCIP_Bool varfixing, /**< FALSE if y should be searched in implications for x == 0, TRUE for x == 1 */
166  SCIP_VAR* implvar, /**< variable y to search for */
167  SCIP_Bool* haslowerimplic, /**< pointer to store whether there exists an implication y >= l */
168  SCIP_Bool* hasupperimplic /**< pointer to store whether there exists an implication y <= u */
169  );
170 
171 /** returns whether an implication y <= b or y >= b is contained in implications for x == 0 or x == 1 */
173  SCIP_IMPLICS* implics, /**< implications data structure */
174  SCIP_Bool varfixing, /**< FALSE if y should be searched in implications for x == 0, TRUE for x == 1 */
175  SCIP_VAR* implvar, /**< variable y to search for */
176  SCIP_BOUNDTYPE impltype /**< type of implication y <=/>= b to search for */
177  );
178 
179 
180 /** gets number of implications for a given binary variable fixing */
182  SCIP_IMPLICS* implics, /**< implication data */
183  SCIP_Bool varfixing /**< should the implications on var == FALSE or var == TRUE be returned? */
184  );
185 
186 /** gets array with implied variables for a given binary variable fixing */
188  SCIP_IMPLICS* implics, /**< implication data */
189  SCIP_Bool varfixing /**< should the implications on var == FALSE or var == TRUE be returned? */
190  );
191 
192 /** gets array with implication types for a given binary variable fixing */
194  SCIP_IMPLICS* implics, /**< implication data */
195  SCIP_Bool varfixing /**< should the implications on var == FALSE or var == TRUE be returned? */
196  );
197 
198 /** gets array with implication bounds for a given binary variable fixing */
200  SCIP_IMPLICS* implics, /**< implication data */
201  SCIP_Bool varfixing /**< should the implications on var == FALSE or var == TRUE be returned? */
202  );
203 
204 /** Gets array with unique implication identifiers for a given binary variable fixing.
205  * If an implication is a shortcut, i.e., it was added as part of the transitive closure of another implication,
206  * its id is negative, otherwise it is nonnegative.
207  */
208 int* SCIPimplicsGetIds(
209  SCIP_IMPLICS* implics, /**< implication data */
210  SCIP_Bool varfixing /**< should the implications on var == FALSE or var == TRUE be returned? */
211  );
212 
213 #ifdef NDEBUG
214 
215 /* In optimized mode, the function calls are overwritten by defines to reduce the number of function calls and
216  * speed up the algorithms.
217  */
218 
219 #define SCIPimplicsGetNImpls(implics, varfixing) ((implics) != NULL ? (implics)->nimpls[varfixing] : 0)
220 #define SCIPimplicsGetNBinImpls(implics, varfixing) ((implics) != NULL ? (implics)->nbinimpls[varfixing] : 0)
221 #define SCIPimplicsGetVars(implics, varfixing) ((implics) != NULL ? (implics)->vars[varfixing] : NULL)
222 #define SCIPimplicsGetTypes(implics, varfixing) ((implics) != NULL ? (implics)->types[varfixing] : NULL)
223 #define SCIPimplicsGetBounds(implics, varfixing) ((implics) != NULL ? (implics)->bounds[varfixing] : NULL)
224 #define SCIPimplicsGetIds(implics, varfixing) ((implics) != NULL ? (implics)->ids[varfixing] : NULL)
225 
226 #endif
227 
228 
229 
230 
231 /*
232  * methods for cliques
233  */
234 
235 /** adds a single variable to the given clique */
237  SCIP_CLIQUE* clique, /**< clique data structure */
238  BMS_BLKMEM* blkmem, /**< block memory */
239  SCIP_SET* set, /**< global SCIP settings */
240  SCIP_VAR* var, /**< variable to add to the clique */
241  SCIP_Bool value, /**< value of the variable in the clique */
242  SCIP_Bool* doubleentry, /**< pointer to store whether the variable and value occurs twice in the clique */
243  SCIP_Bool* oppositeentry /**< pointer to store whether the variable with opposite value is in the clique */
244  );
245 
246 /** removes a single variable from the given clique */
247 void SCIPcliqueDelVar(
248  SCIP_CLIQUE* clique, /**< clique data structure */
249  SCIP_CLIQUETABLE* cliquetable, /**< clique table data structure */
250  SCIP_VAR* var, /**< variable to remove from the clique */
251  SCIP_Bool value /**< value of the variable in the clique */
252  );
253 
254 /** frees a clique list data structure */
255 void SCIPcliquelistFree(
256  SCIP_CLIQUELIST** cliquelist, /**< pointer to the clique list data structure */
257  BMS_BLKMEM* blkmem /**< block memory */
258  );
259 
260 /** adds a clique to the clique list */
262  SCIP_CLIQUELIST** cliquelist, /**< pointer to the clique list data structure */
263  BMS_BLKMEM* blkmem, /**< block memory */
264  SCIP_SET* set, /**< global SCIP settings */
265  SCIP_Bool value, /**< value of the variable for which the clique list should be extended */
266  SCIP_CLIQUE* clique /**< clique that should be added to the clique list */
267  );
268 
269 /** removes a clique from the clique list */
271  SCIP_CLIQUELIST** cliquelist, /**< pointer to the clique list data structure */
272  BMS_BLKMEM* blkmem, /**< block memory */
273  SCIP_Bool value, /**< value of the variable for which the clique list should be reduced */
274  SCIP_CLIQUE* clique /**< clique that should be deleted from the clique list */
275  );
276 
277 /** returns whether the given clique lists have a non-empty intersection, i.e. whether there is a clique that appears
278  * in both lists
279  */
281  SCIP_CLIQUELIST* cliquelist1, /**< first clique list data structure */
282  SCIP_Bool value1, /**< value of first variable */
283  SCIP_CLIQUELIST* cliquelist2, /**< second clique list data structure */
284  SCIP_Bool value2 /**< value of second variable */
285  );
286 
287 /** removes all listed entries from the cliques */
289  SCIP_CLIQUELIST* cliquelist, /**< clique list data structure */
290  SCIP_CLIQUETABLE* cliquetable, /**< clique table data structure */
291  SCIP_VAR* var, /**< active problem variable the clique list belongs to */
292  SCIP_Bool irrelevantvar /**< has the variable become irrelevant, meaning that equality
293  * cliques need to be relaxed? */
294  );
295 
296 /** creates a clique table data structure */
298  SCIP_CLIQUETABLE** cliquetable, /**< pointer to store clique table data structure */
299  SCIP_SET* set, /**< global SCIP settings */
300  BMS_BLKMEM* blkmem /**< block memory */
301  );
302 
303 /** frees a clique table data structure */
305  SCIP_CLIQUETABLE** cliquetable, /**< pointer to store clique table data structure */
306  BMS_BLKMEM* blkmem /**< block memory */
307  );
308 
309 /** adds a clique to the clique table, using the given values for the given variables;
310  * performs implications if the clique contains the same variable twice
311  */
313  SCIP_CLIQUETABLE* cliquetable, /**< clique table data structure */
314  BMS_BLKMEM* blkmem, /**< block memory */
315  SCIP_SET* set, /**< global SCIP settings */
316  SCIP_STAT* stat, /**< problem statistics */
317  SCIP_PROB* transprob, /**< transformed problem */
318  SCIP_PROB* origprob, /**< original problem */
319  SCIP_TREE* tree, /**< branch and bound tree if in solving stage */
320  SCIP_REOPT* reopt, /**< reoptimization data structure */
321  SCIP_LP* lp, /**< current LP data */
322  SCIP_BRANCHCAND* branchcand, /**< branching candidate storage */
323  SCIP_EVENTQUEUE* eventqueue, /**< event queue */
324  SCIP_VAR** vars, /**< binary variables in the clique: at most one can be set to the given value */
325  SCIP_Bool* values, /**< values of the variables in the clique; NULL to use TRUE for all vars */
326  int nvars, /**< number of variables in the clique */
327  SCIP_Bool isequation, /**< is the clique an equation or an inequality? */
328  SCIP_Bool* infeasible, /**< pointer to store whether an infeasibility was detected */
329  int* nbdchgs /**< pointer to count the number of performed bound changes, or NULL */
330  );
331 
332 /** removes all empty and single variable cliques from the clique table; removes double entries from the clique table
333  *
334  * @note cliques can be processed several times by this method
335  */
337  SCIP_CLIQUETABLE* cliquetable, /**< clique table data structure */
338  BMS_BLKMEM* blkmem, /**< block memory */
339  SCIP_SET* set, /**< global SCIP settings */
340  SCIP_STAT* stat, /**< problem statistics */
341  SCIP_PROB* transprob, /**< transformed problem */
342  SCIP_PROB* origprob, /**< original problem */
343  SCIP_TREE* tree, /**< branch and bound tree if in solving stage */
344  SCIP_REOPT* reopt, /**< reoptimization data structure */
345  SCIP_LP* lp, /**< current LP data */
346  SCIP_BRANCHCAND* branchcand, /**< branching candidate storage */
347  SCIP_EVENTQUEUE* eventqueue, /**< event queue */
348  int* nchgbds, /**< pointer to store number of fixed variables */
349  SCIP_Bool* infeasible /**< pointer to store whether an infeasibility was detected */
350  );
351 
352 /** computes connected components of the clique graph
353  *
354  * use depth-first search similarly to the components presolver/constraint handler, representing a clique as a
355  * path to reduce memory usage, but leaving the connected components the same
356  *
357  * an update becomes necessary if a clique gets added with variables from different components
358  */
360  SCIP_CLIQUETABLE* cliquetable, /**< clique table data structure */
361  SCIP_SET* set, /**< global SCIP settings */
362  BMS_BLKMEM* blkmem, /**< block memory */
363  SCIP_VAR** vars, /**< array of problem variables, sorted by variable type */
364  int nbinvars, /**< number of binary variables */
365  int nintvars, /**< number of integer variables */
366  int nimplvars /**< number of implicit integer variables */
367  );
368 
369 /** returns the index of the connected component of the clique graph that the variable belongs to, or -1 */
371  SCIP_CLIQUETABLE* cliquetable, /**< clique table data structure */
372  SCIP_VAR* var /**< problem variable */
373  );
374 
375 /** returns the number of cliques stored in the clique list */
377  SCIP_CLIQUELIST* cliquelist, /**< clique list data structure */
378  SCIP_Bool value /**< value of the variable for which the cliques should be returned */
379  );
380 
381 /** returns the cliques stored in the clique list, or NULL if the clique list is empty */
383  SCIP_CLIQUELIST* cliquelist, /**< clique list data structure */
384  SCIP_Bool value /**< value of the variable for which the cliques should be returned */
385  );
386 
387 /** checks whether variable is contained in all cliques of the cliquelist */
389  SCIP_CLIQUELIST* cliquelist, /**< clique list data structure */
390  SCIP_VAR* var /**< variable, the clique list belongs to */
391  );
392 
393 /** gets the number of cliques stored in the clique table */
395  SCIP_CLIQUETABLE* cliquetable /**< clique table data structure */
396  );
397 
398 /** gets the number of cliques created so far by the clique table */
400  SCIP_CLIQUETABLE* cliquetable /**< clique table data structure */
401  );
402 
403 /** gets the array of cliques stored in the clique table */
405  SCIP_CLIQUETABLE* cliquetable /**< clique table data structure */
406  );
407 
408 /** gets the number of entries in the whole clique table */
410  SCIP_CLIQUETABLE* cliquetable /**< clique table data structure */
411  );
412 
413 /** returns the number of clique components, or -1 if update is necessary first */
415  SCIP_CLIQUETABLE* cliquetable /**< clique table data structure */
416  );
417 
418 /** returns TRUE iff the connected clique components need an update (because new cliques were added) */
420  SCIP_CLIQUETABLE* cliquetable /**< clique table data structure */
421  );
422 
423 #ifdef NDEBUG
424 
425 /* In optimized mode, the function calls are overwritten by defines to reduce the number of function calls and
426  * speed up the algorithms.
427  */
428 
429 #define SCIPcliquelistGetNCliques(cliquelist, value) ((cliquelist) != NULL ? (cliquelist)->ncliques[value] : 0)
430 #define SCIPcliquelistGetCliques(cliquelist, value) ((cliquelist) != NULL ? (cliquelist)->cliques[value] : NULL)
431 #define SCIPcliquelistCheck(cliquelist, var) /**/
432 #define SCIPcliquetableGetNCliques(cliquetable) ((cliquetable)->ncliques)
433 #define SCIPcliquetableGetCliques(cliquetable) ((cliquetable)->cliques)
434 #define SCIPcliquetableGetNEntries(cliquetable) ((cliquetable)->nentries)
435 #define SCIPcliquetableGetNCliqueComponents(cliquetable) (cliquetable->compsfromscratch ? -1 : cliquetable->ncliquecomponents)
436 #define SCIPcliquetableNeedsComponentUpdate(cliquetable) (cliquetable->compsfromscratch || cliquetable->djset == NULL)
437 #endif
438 
439 #ifdef __cplusplus
440 }
441 #endif
442 
443 #endif
enum SCIP_BoundType SCIP_BOUNDTYPE
Definition: type_lp.h:50
int SCIPcliquetableGetNCliqueComponents(SCIP_CLIQUETABLE *cliquetable)
Definition: implics.c:3517
void SCIPvboundsShrink(SCIP_VBOUNDS **vbounds, BMS_BLKMEM *blkmem, int newnvbds)
Definition: implics.c:324
SCIP_Longint SCIPcliquetableGetNEntries(SCIP_CLIQUETABLE *cliquetable)
Definition: implics.c:3507
type definitions for implications, variable bounds, and cliques
SCIP_Bool SCIPcliquetableNeedsComponentUpdate(SCIP_CLIQUETABLE *cliquetable)
Definition: implics.c:3525
public methods for implications, variable bounds, and cliques
SCIP_RETCODE SCIPcliquetableCleanup(SCIP_CLIQUETABLE *cliquetable, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, int *nchgbds, SCIP_Bool *infeasible)
Definition: implics.c:2891
SCIP_RETCODE SCIPcliquelistAdd(SCIP_CLIQUELIST **cliquelist, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_Bool value, SCIP_CLIQUE *clique)
Definition: implics.c:1456
SCIP_Real * SCIPvboundsGetConstants(SCIP_VBOUNDS *vbounds)
Definition: implics.c:3285
SCIP_Real * SCIPvboundsGetCoefs(SCIP_VBOUNDS *vbounds)
Definition: implics.c:3277
SCIP_RETCODE SCIPcliqueAddVar(SCIP_CLIQUE *clique, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_VAR *var, SCIP_Bool value, SCIP_Bool *doubleentry, SCIP_Bool *oppositeentry)
Definition: implics.c:1125
int SCIPcliquetableGetNCliques(SCIP_CLIQUETABLE *cliquetable)
Definition: implics.c:3477
int SCIPimplicsGetNImpls(SCIP_IMPLICS *implics, SCIP_Bool varfixing)
Definition: implics.c:3293
int SCIPvboundsGetNVbds(SCIP_VBOUNDS *vbounds)
Definition: implics.c:3261
SCIP_Bool SCIPcliquelistsHaveCommonClique(SCIP_CLIQUELIST *cliquelist1, SCIP_Bool value1, SCIP_CLIQUELIST *cliquelist2, SCIP_Bool value2)
Definition: implics.c:1579
enum SCIP_Retcode SCIP_RETCODE
Definition: type_retcode.h:54
type definitions for global SCIP settings
type definitions for return codes for SCIP methods
SCIP_RETCODE SCIPcliquetableCreate(SCIP_CLIQUETABLE **cliquetable, SCIP_SET *set, BMS_BLKMEM *blkmem)
Definition: implics.c:1760
type definitions for collecting reoptimization information
SCIP_RETCODE SCIPimplicsDel(SCIP_IMPLICS **implics, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_Bool varfixing, SCIP_VAR *implvar, SCIP_BOUNDTYPE impltype)
Definition: implics.c:827
type definitions for branching rules
type definitions for problem statistics
SCIP_Bool SCIPimplicsContainsImpl(SCIP_IMPLICS *implics, SCIP_Bool varfixing, SCIP_VAR *implvar, SCIP_BOUNDTYPE impltype)
Definition: implics.c:907
SCIP_RETCODE SCIPcliquetableAdd(SCIP_CLIQUETABLE *cliquetable, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_VAR **vars, SCIP_Bool *values, int nvars, SCIP_Bool isequation, SCIP_Bool *infeasible, int *nbdchgs)
Definition: implics.c:2350
type definitions for LP management
void SCIPimplicsGetVarImplics(SCIP_IMPLICS *implics, SCIP_Bool varfixing, SCIP_VAR *implvar, SCIP_Bool *haslowerimplic, SCIP_Bool *hasupperimplic)
Definition: implics.c:885
void SCIPcliquelistRemoveFromCliques(SCIP_CLIQUELIST *cliquelist, SCIP_CLIQUETABLE *cliquetable, SCIP_VAR *var, SCIP_Bool irrelevantvar)
Definition: implics.c:1657
SCIP_RETCODE SCIPimplicsAdd(SCIP_IMPLICS **implics, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_Bool varfixing, SCIP_VAR *implvar, SCIP_BOUNDTYPE impltype, SCIP_Real implbound, SCIP_Bool isshortcut, SCIP_Bool *conflict, SCIP_Bool *added)
Definition: implics.c:624
SCIP_VAR ** SCIPimplicsGetVars(SCIP_IMPLICS *implics, SCIP_Bool varfixing)
Definition: implics.c:3302
SCIP_CLIQUE ** SCIPcliquetableGetCliques(SCIP_CLIQUETABLE *cliquetable)
Definition: implics.c:3497
SCIP_CLIQUE ** SCIPcliquelistGetCliques(SCIP_CLIQUELIST *cliquelist, SCIP_Bool value)
Definition: implics.c:3426
SCIP_BOUNDTYPE * SCIPimplicsGetTypes(SCIP_IMPLICS *implics, SCIP_Bool varfixing)
Definition: implics.c:3311
type definitions for problem variables
void SCIPcliqueDelVar(SCIP_CLIQUE *clique, SCIP_CLIQUETABLE *cliquetable, SCIP_VAR *var, SCIP_Bool value)
Definition: implics.c:1259
type definitions for managing events
datastructures for implications, variable bounds, and cliques
int * SCIPimplicsGetIds(SCIP_IMPLICS *implics, SCIP_Bool varfixing)
Definition: implics.c:3332
void SCIPvboundsFree(SCIP_VBOUNDS **vbounds, BMS_BLKMEM *blkmem)
Definition: implics.c:64
#define SCIP_Bool
Definition: def.h:70
SCIP_RETCODE SCIPcliquetableFree(SCIP_CLIQUETABLE **cliquetable, BMS_BLKMEM *blkmem)
Definition: implics.c:1796
type definitions for branch and bound tree
void SCIPcliquelistCheck(SCIP_CLIQUELIST *cliquelist, SCIP_VAR *var)
Definition: implics.c:3435
SCIP_RETCODE SCIPcliquetableComputeCliqueComponents(SCIP_CLIQUETABLE *cliquetable, SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_VAR **vars, int nbinvars, int nintvars, int nimplvars)
Definition: implics.c:3102
void SCIPimplicsFree(SCIP_IMPLICS **implics, BMS_BLKMEM *blkmem)
Definition: implics.c:442
SCIP_RETCODE SCIPvboundsDel(SCIP_VBOUNDS **vbounds, BMS_BLKMEM *blkmem, SCIP_VAR *vbdvar, SCIP_Bool negativecoef)
Definition: implics.c:279
type definitions for storing and manipulating the main problem
int SCIPcliquetableGetVarComponentIdx(SCIP_CLIQUETABLE *cliquetable, SCIP_VAR *var)
Definition: implics.c:2322
void SCIPcliquelistFree(SCIP_CLIQUELIST **cliquelist, BMS_BLKMEM *blkmem)
Definition: implics.c:1415
SCIP_VAR ** SCIPvboundsGetVars(SCIP_VBOUNDS *vbounds)
Definition: implics.c:3269
SCIP_Real * SCIPimplicsGetBounds(SCIP_IMPLICS *implics, SCIP_Bool varfixing)
Definition: implics.c:3320
#define SCIP_Real
Definition: def.h:163
int SCIPcliquetableGetNCliquesCreated(SCIP_CLIQUETABLE *cliquetable)
Definition: implics.c:3487
#define SCIP_Longint
Definition: def.h:148
common defines and data types used in all packages of SCIP
struct BMS_BlkMem BMS_BLKMEM
Definition: memory.h:429
SCIP_RETCODE SCIPvboundsAdd(SCIP_VBOUNDS **vbounds, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_BOUNDTYPE vboundtype, SCIP_VAR *var, SCIP_Real coef, SCIP_Real constant, SCIP_Bool *added)
Definition: implics.c:197
int SCIPcliquelistGetNCliques(SCIP_CLIQUELIST *cliquelist, SCIP_Bool value)
Definition: implics.c:3417
SCIP_RETCODE SCIPcliquelistDel(SCIP_CLIQUELIST **cliquelist, BMS_BLKMEM *blkmem, SCIP_Bool value, SCIP_CLIQUE *clique)
Definition: implics.c:1501
memory allocation routines