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-2018 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 scip.zib.de. */
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 extern
57 void SCIPvboundsFree(
58  SCIP_VBOUNDS** vbounds, /**< pointer to store variable bounds data structure */
59  BMS_BLKMEM* blkmem /**< block memory */
60  );
61 
62 /** adds a variable bound to the variable bounds data structure */
63 extern
65  SCIP_VBOUNDS** vbounds, /**< pointer to variable bounds data structure */
66  BMS_BLKMEM* blkmem, /**< block memory */
67  SCIP_SET* set, /**< global SCIP settings */
68  SCIP_BOUNDTYPE vboundtype, /**< type of variable bound (LOWER or UPPER) */
69  SCIP_VAR* var, /**< variable z in x <= b*z + d or x >= b*z + d */
70  SCIP_Real coef, /**< coefficient b in x <= b*z + d or x >= b*z + d */
71  SCIP_Real constant, /**< constant d in x <= b*z + d or x >= b*z + d */
72  SCIP_Bool* added /**< pointer to store whether the variable bound was added */
73  );
74 
75 /** removes from variable x a variable bound x >=/<= b*z + d with binary or integer z */
76 extern
78  SCIP_VBOUNDS** vbounds, /**< pointer to variable bounds data structure */
79  BMS_BLKMEM* blkmem, /**< block memory */
80  SCIP_VAR* vbdvar, /**< variable z in x >=/<= b*z + d */
81  SCIP_Bool negativecoef /**< is coefficient b negative? */
82  );
83 
84 /** reduces the number of variable bounds stored in the given variable bounds data structure */
86  SCIP_VBOUNDS** vbounds, /**< pointer to variable bounds data structure */
87  BMS_BLKMEM* blkmem, /**< block memory */
88  int newnvbds /**< new number of variable bounds */
89  );
90 
91 
92 /** gets number of variable bounds contained in given variable bounds data structure */
93 extern
95  SCIP_VBOUNDS* vbounds /**< variable bounds data structure */
96  );
97 
98 /** gets array of variables contained in given variable bounds data structure */
99 extern
101  SCIP_VBOUNDS* vbounds /**< variable bounds data structure */
102  );
103 
104 /** gets array of coefficients contained in given variable bounds data structure */
105 extern
107  SCIP_VBOUNDS* vbounds /**< variable bounds data structure */
108  );
109 
110 /** gets array of constants contained in given variable bounds data structure */
111 extern
113  SCIP_VBOUNDS* vbounds /**< variable bounds data structure */
114  );
115 
116 #ifdef NDEBUG
117 
118 /* In optimized mode, the function calls are overwritten by defines to reduce the number of function calls and
119  * speed up the algorithms.
120  */
121 
122 #define SCIPvboundsGetNVbds(vbounds) ((vbounds) != NULL ? (vbounds)->len : 0)
123 #define SCIPvboundsGetVars(vbounds) ((vbounds) != NULL ? (vbounds)->vars : NULL)
124 #define SCIPvboundsGetCoefs(vbounds) ((vbounds) != NULL ? (vbounds)->coefs : NULL)
125 #define SCIPvboundsGetConstants(vbounds) ((vbounds) != NULL ? (vbounds)->constants : NULL)
126 
127 #endif
128 
129 
130 
131 
132 /*
133  * Methods for Implications
134  */
135 
136 /** frees an implications data structure */
137 extern
138 void SCIPimplicsFree(
139  SCIP_IMPLICS** implics, /**< pointer of implications data structure to free */
140  BMS_BLKMEM* blkmem /**< block memory */
141  );
142 
143 /** adds an implication x == 0/1 -> y <= b or y >= b to the implications data structure;
144  * the implication must be non-redundant
145  */
146 extern
148  SCIP_IMPLICS** implics, /**< pointer to implications data structure */
149  BMS_BLKMEM* blkmem, /**< block memory */
150  SCIP_SET* set, /**< global SCIP settings */
151  SCIP_STAT* stat, /**< problem statistics */
152  SCIP_Bool varfixing, /**< FALSE if implication for x == 0 has to be added, TRUE for x == 1 */
153  SCIP_VAR* implvar, /**< variable y in implication y <= b or y >= b */
154  SCIP_BOUNDTYPE impltype, /**< type of implication y <= b (SCIP_BOUNDTYPE_UPPER) or y >= b (SCIP_BOUNDTYPE_LOWER) */
155  SCIP_Real implbound, /**< bound b in implication y <= b or y >= b */
156  SCIP_Bool isshortcut, /**< is the implication a shortcut, i.e., added as part of the transitive closure of another implication? */
157  SCIP_Bool* conflict, /**< pointer to store whether implication causes a conflict for variable x */
158  SCIP_Bool* added /**< pointer to store whether the implication was added */
159  );
160 
161 /** removes the implication x <= 0 or x >= 1 ==> y <= b or y >= b from the implications data structure */
162 extern
164  SCIP_IMPLICS** implics, /**< pointer to implications data structure */
165  BMS_BLKMEM* blkmem, /**< block memory */
166  SCIP_SET* set, /**< global SCIP settings */
167  SCIP_Bool varfixing, /**< FALSE if y should be removed from implications for x <= 0, TRUE for x >= 1 */
168  SCIP_VAR* implvar, /**< variable y in implication y <= b or y >= b */
169  SCIP_BOUNDTYPE impltype /**< type of implication y <= b (SCIP_BOUNDTYPE_UPPER) or y >= b (SCIP_BOUNDTYPE_LOWER) */
170  );
171 
172 /** returns which implications on given variable y are contained in implications for x == 0 or x == 1 */
173 extern
175  SCIP_IMPLICS* implics, /**< implications data structure */
176  SCIP_Bool varfixing, /**< FALSE if y should be searched in implications for x == 0, TRUE for x == 1 */
177  SCIP_VAR* implvar, /**< variable y to search for */
178  SCIP_Bool* haslowerimplic, /**< pointer to store whether there exists an implication y >= l */
179  SCIP_Bool* hasupperimplic /**< pointer to store whether there exists an implication y <= u */
180  );
181 
182 /** returns whether an implication y <= b or y >= b is contained in implications for x == 0 or x == 1 */
183 extern
185  SCIP_IMPLICS* implics, /**< implications data structure */
186  SCIP_Bool varfixing, /**< FALSE if y should be searched in implications for x == 0, TRUE for x == 1 */
187  SCIP_VAR* implvar, /**< variable y to search for */
188  SCIP_BOUNDTYPE impltype /**< type of implication y <=/>= b to search for */
189  );
190 
191 
192 /** gets number of implications for a given binary variable fixing */
193 extern
195  SCIP_IMPLICS* implics, /**< implication data */
196  SCIP_Bool varfixing /**< should the implications on var == FALSE or var == TRUE be returned? */
197  );
198 
199 /** gets array with implied variables for a given binary variable fixing */
200 extern
202  SCIP_IMPLICS* implics, /**< implication data */
203  SCIP_Bool varfixing /**< should the implications on var == FALSE or var == TRUE be returned? */
204  );
205 
206 /** gets array with implication types for a given binary variable fixing */
207 extern
209  SCIP_IMPLICS* implics, /**< implication data */
210  SCIP_Bool varfixing /**< should the implications on var == FALSE or var == TRUE be returned? */
211  );
212 
213 /** gets array with implication bounds for a given binary variable fixing */
214 extern
216  SCIP_IMPLICS* implics, /**< implication data */
217  SCIP_Bool varfixing /**< should the implications on var == FALSE or var == TRUE be returned? */
218  );
219 
220 /** Gets array with unique implication identifiers for a given binary variable fixing.
221  * If an implication is a shortcut, i.e., it was added as part of the transitive closure of another implication,
222  * its id is negative, otherwise it is nonnegative.
223  */
224 extern
225 int* SCIPimplicsGetIds(
226  SCIP_IMPLICS* implics, /**< implication data */
227  SCIP_Bool varfixing /**< should the implications on var == FALSE or var == TRUE be returned? */
228  );
229 
230 #ifdef NDEBUG
231 
232 /* In optimized mode, the function calls are overwritten by defines to reduce the number of function calls and
233  * speed up the algorithms.
234  */
235 
236 #define SCIPimplicsGetNImpls(implics, varfixing) ((implics) != NULL ? (implics)->nimpls[varfixing] : 0)
237 #define SCIPimplicsGetNBinImpls(implics, varfixing) ((implics) != NULL ? (implics)->nbinimpls[varfixing] : 0)
238 #define SCIPimplicsGetVars(implics, varfixing) ((implics) != NULL ? (implics)->vars[varfixing] : NULL)
239 #define SCIPimplicsGetTypes(implics, varfixing) ((implics) != NULL ? (implics)->types[varfixing] : NULL)
240 #define SCIPimplicsGetBounds(implics, varfixing) ((implics) != NULL ? (implics)->bounds[varfixing] : NULL)
241 #define SCIPimplicsGetIds(implics, varfixing) ((implics) != NULL ? (implics)->ids[varfixing] : NULL)
242 
243 #endif
244 
245 
246 
247 
248 /*
249  * methods for cliques
250  */
251 
252 /** adds a single variable to the given clique */
253 extern
255  SCIP_CLIQUE* clique, /**< clique data structure */
256  BMS_BLKMEM* blkmem, /**< block memory */
257  SCIP_SET* set, /**< global SCIP settings */
258  SCIP_VAR* var, /**< variable to add to the clique */
259  SCIP_Bool value, /**< value of the variable in the clique */
260  SCIP_Bool* doubleentry, /**< pointer to store whether the variable and value occurs twice in the clique */
261  SCIP_Bool* oppositeentry /**< pointer to store whether the variable with opposite value is in the clique */
262  );
263 
264 /** removes a single variable from the given clique */
265 extern
266 void SCIPcliqueDelVar(
267  SCIP_CLIQUE* clique, /**< clique data structure */
268  SCIP_CLIQUETABLE* cliquetable, /**< clique table data structure */
269  SCIP_VAR* var, /**< variable to remove from the clique */
270  SCIP_Bool value /**< value of the variable in the clique */
271  );
272 
273 /** frees a clique list data structure */
274 extern
275 void SCIPcliquelistFree(
276  SCIP_CLIQUELIST** cliquelist, /**< pointer to the clique list data structure */
277  BMS_BLKMEM* blkmem /**< block memory */
278  );
279 
280 /** adds a clique to the clique list */
281 extern
283  SCIP_CLIQUELIST** cliquelist, /**< pointer to the clique list data structure */
284  BMS_BLKMEM* blkmem, /**< block memory */
285  SCIP_SET* set, /**< global SCIP settings */
286  SCIP_Bool value, /**< value of the variable for which the clique list should be extended */
287  SCIP_CLIQUE* clique /**< clique that should be added to the clique list */
288  );
289 
290 /** removes a clique from the clique list */
291 extern
293  SCIP_CLIQUELIST** cliquelist, /**< pointer to the clique list data structure */
294  BMS_BLKMEM* blkmem, /**< block memory */
295  SCIP_Bool value, /**< value of the variable for which the clique list should be reduced */
296  SCIP_CLIQUE* clique /**< clique that should be deleted from the clique list */
297  );
298 
299 /** returns whether the given clique lists have a non-empty intersection, i.e. whether there is a clique that appears
300  * in both lists
301  */
302 extern
304  SCIP_CLIQUELIST* cliquelist1, /**< first clique list data structure */
305  SCIP_Bool value1, /**< value of first variable */
306  SCIP_CLIQUELIST* cliquelist2, /**< second clique list data structure */
307  SCIP_Bool value2 /**< value of second variable */
308  );
309 
310 /** removes all listed entries from the cliques */
311 extern
313  SCIP_CLIQUELIST* cliquelist, /**< clique list data structure */
314  SCIP_CLIQUETABLE* cliquetable, /**< clique table data structure */
315  SCIP_VAR* var, /**< active problem variable the clique list belongs to */
316  SCIP_Bool irrelevantvar /**< has the variable become irrelevant, meaning that equality
317  * cliques need to be relaxed? */
318  );
319 
320 /** creates a clique table data structure */
321 extern
323  SCIP_CLIQUETABLE** cliquetable, /**< pointer to store clique table data structure */
324  SCIP_SET* set, /**< global SCIP settings */
325  BMS_BLKMEM* blkmem /**< block memory */
326  );
327 
328 /** frees a clique table data structure */
329 extern
331  SCIP_CLIQUETABLE** cliquetable, /**< pointer to store clique table data structure */
332  BMS_BLKMEM* blkmem /**< block memory */
333  );
334 
335 /** adds a clique to the clique table, using the given values for the given variables;
336  * performs implications if the clique contains the same variable twice
337  */
338 extern
340  SCIP_CLIQUETABLE* cliquetable, /**< clique table data structure */
341  BMS_BLKMEM* blkmem, /**< block memory */
342  SCIP_SET* set, /**< global SCIP settings */
343  SCIP_STAT* stat, /**< problem statistics */
344  SCIP_PROB* transprob, /**< transformed problem */
345  SCIP_PROB* origprob, /**< original problem */
346  SCIP_TREE* tree, /**< branch and bound tree if in solving stage */
347  SCIP_REOPT* reopt, /**< reoptimization data structure */
348  SCIP_LP* lp, /**< current LP data */
349  SCIP_BRANCHCAND* branchcand, /**< branching candidate storage */
350  SCIP_EVENTQUEUE* eventqueue, /**< event queue */
351  SCIP_VAR** vars, /**< binary variables in the clique: at most one can be set to the given value */
352  SCIP_Bool* values, /**< values of the variables in the clique; NULL to use TRUE for all vars */
353  int nvars, /**< number of variables in the clique */
354  SCIP_Bool isequation, /**< is the clique an equation or an inequality? */
355  SCIP_Bool* infeasible, /**< pointer to store whether an infeasibility was detected */
356  int* nbdchgs /**< pointer to count the number of performed bound changes, or NULL */
357  );
358 
359 /** removes all empty and single variable cliques from the clique table; removes double entries from the clique table
360  *
361  * @note cliques can be processed several times by this method
362  */
363 extern
365  SCIP_CLIQUETABLE* cliquetable, /**< clique table data structure */
366  BMS_BLKMEM* blkmem, /**< block memory */
367  SCIP_SET* set, /**< global SCIP settings */
368  SCIP_STAT* stat, /**< problem statistics */
369  SCIP_PROB* transprob, /**< transformed problem */
370  SCIP_PROB* origprob, /**< original problem */
371  SCIP_TREE* tree, /**< branch and bound tree if in solving stage */
372  SCIP_REOPT* reopt, /**< reoptimization data structure */
373  SCIP_LP* lp, /**< current LP data */
374  SCIP_BRANCHCAND* branchcand, /**< branching candidate storage */
375  SCIP_EVENTQUEUE* eventqueue, /**< event queue */
376  int* nchgbds, /**< pointer to store number of fixed variables */
377  SCIP_Bool* infeasible /**< pointer to store whether an infeasibility was detected */
378  );
379 
380 /** computes connected components of the clique graph
381  *
382  * use depth-first search similarly to the components presolver/constraint handler, representing a clique as a
383  * path to reduce memory usage, but leaving the connected components the same
384  *
385  * an update becomes necessary if a clique gets added with variables from different components
386  */
387 extern
389  SCIP_CLIQUETABLE* cliquetable, /**< clique table data structure */
390  SCIP_SET* set, /**< global SCIP settings */
391  BMS_BLKMEM* blkmem, /**< block memory */
392  SCIP_VAR** vars, /**< array of problem variables, sorted by variable type */
393  int nbinvars, /**< number of binary variables */
394  int nintvars, /**< number of integer variables */
395  int nimplvars /**< number of implicit integer variables */
396  );
397 
398 /** returns the index of the connected component of the clique graph that the variable belongs to, or -1 */
399 extern
401  SCIP_CLIQUETABLE* cliquetable, /**< clique table data structure */
402  SCIP_VAR* var /**< problem variable */
403  );
404 
405 /** returns the number of cliques stored in the clique list */
406 extern
408  SCIP_CLIQUELIST* cliquelist, /**< clique list data structure */
409  SCIP_Bool value /**< value of the variable for which the cliques should be returned */
410  );
411 
412 /** returns the cliques stored in the clique list, or NULL if the clique list is empty */
413 extern
415  SCIP_CLIQUELIST* cliquelist, /**< clique list data structure */
416  SCIP_Bool value /**< value of the variable for which the cliques should be returned */
417  );
418 
419 /** checks whether variable is contained in all cliques of the cliquelist */
420 extern
422  SCIP_CLIQUELIST* cliquelist, /**< clique list data structure */
423  SCIP_VAR* var /**< variable, the clique list belongs to */
424  );
425 
426 /** gets the number of cliques stored in the clique table */
427 extern
429  SCIP_CLIQUETABLE* cliquetable /**< clique table data structure */
430  );
431 
432 /** gets the number of cliques created so far by the clique table */
433 extern
435  SCIP_CLIQUETABLE* cliquetable /**< clique table data structure */
436  );
437 
438 /** gets the array of cliques stored in the clique table */
439 extern
441  SCIP_CLIQUETABLE* cliquetable /**< clique table data structure */
442  );
443 
444 /** gets the number of entries in the whole clique table */
445 extern
447  SCIP_CLIQUETABLE* cliquetable /**< clique table data structure */
448  );
449 
450 /** returns the number of clique components, or -1 if update is necessary first */
451 extern
453  SCIP_CLIQUETABLE* cliquetable /**< clique table data structure */
454  );
455 
456 /** returns TRUE iff the connected clique components need an update (because new cliques were added) */
457 extern
459  SCIP_CLIQUETABLE* cliquetable /**< clique table data structure */
460  );
461 
462 #ifdef NDEBUG
463 
464 /* In optimized mode, the function calls are overwritten by defines to reduce the number of function calls and
465  * speed up the algorithms.
466  */
467 
468 #define SCIPcliquelistGetNCliques(cliquelist, value) ((cliquelist) != NULL ? (cliquelist)->ncliques[value] : 0)
469 #define SCIPcliquelistGetCliques(cliquelist, value) ((cliquelist) != NULL ? (cliquelist)->cliques[value] : NULL)
470 #define SCIPcliquelistCheck(cliquelist, var) /**/
471 #define SCIPcliquetableGetNCliques(cliquetable) ((cliquetable)->ncliques)
472 #define SCIPcliquetableGetCliques(cliquetable) ((cliquetable)->cliques)
473 #define SCIPcliquetableGetNEntries(cliquetable) ((cliquetable)->nentries)
474 #define SCIPcliquetableGetNCliqueComponents(cliquetable) (cliquetable->compsfromscratch ? -1 : cliquetable->ncliquecomponents)
475 #define SCIPcliquetableNeedsComponentUpdate(cliquetable) (cliquetable->compsfromscratch || cliquetable->djset == NULL)
476 #endif
477 
478 #ifdef __cplusplus
479 }
480 #endif
481 
482 #endif
enum SCIP_BoundType SCIP_BOUNDTYPE
Definition: type_lp.h:50
int SCIPcliquetableGetNCliqueComponents(SCIP_CLIQUETABLE *cliquetable)
Definition: implics.c:3509
void SCIPvboundsShrink(SCIP_VBOUNDS **vbounds, BMS_BLKMEM *blkmem, int newnvbds)
Definition: implics.c:323
SCIP_Longint SCIPcliquetableGetNEntries(SCIP_CLIQUETABLE *cliquetable)
Definition: implics.c:3499
type definitions for implications, variable bounds, and cliques
SCIP_Bool SCIPcliquetableNeedsComponentUpdate(SCIP_CLIQUETABLE *cliquetable)
Definition: implics.c:3517
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:2883
SCIP_RETCODE SCIPcliquelistAdd(SCIP_CLIQUELIST **cliquelist, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_Bool value, SCIP_CLIQUE *clique)
Definition: implics.c:1455
SCIP_Real * SCIPvboundsGetConstants(SCIP_VBOUNDS *vbounds)
Definition: implics.c:3277
SCIP_Real * SCIPvboundsGetCoefs(SCIP_VBOUNDS *vbounds)
Definition: implics.c:3269
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:1124
int SCIPcliquetableGetNCliques(SCIP_CLIQUETABLE *cliquetable)
Definition: implics.c:3469
int SCIPimplicsGetNImpls(SCIP_IMPLICS *implics, SCIP_Bool varfixing)
Definition: implics.c:3285
int SCIPvboundsGetNVbds(SCIP_VBOUNDS *vbounds)
Definition: implics.c:3253
SCIP_Bool SCIPcliquelistsHaveCommonClique(SCIP_CLIQUELIST *cliquelist1, SCIP_Bool value1, SCIP_CLIQUELIST *cliquelist2, SCIP_Bool value2)
Definition: implics.c:1578
enum SCIP_Retcode SCIP_RETCODE
Definition: type_retcode.h:53
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:1761
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:826
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:906
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:884
void SCIPcliquelistRemoveFromCliques(SCIP_CLIQUELIST *cliquelist, SCIP_CLIQUETABLE *cliquetable, SCIP_VAR *var, SCIP_Bool irrelevantvar)
Definition: implics.c:1656
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:623
SCIP_VAR ** SCIPimplicsGetVars(SCIP_IMPLICS *implics, SCIP_Bool varfixing)
Definition: implics.c:3294
SCIP_CLIQUE ** SCIPcliquetableGetCliques(SCIP_CLIQUETABLE *cliquetable)
Definition: implics.c:3489
SCIP_CLIQUE ** SCIPcliquelistGetCliques(SCIP_CLIQUELIST *cliquelist, SCIP_Bool value)
Definition: implics.c:3418
SCIP_BOUNDTYPE * SCIPimplicsGetTypes(SCIP_IMPLICS *implics, SCIP_Bool varfixing)
Definition: implics.c:3303
type definitions for problem variables
void SCIPcliqueDelVar(SCIP_CLIQUE *clique, SCIP_CLIQUETABLE *cliquetable, SCIP_VAR *var, SCIP_Bool value)
Definition: implics.c:1258
type definitions for managing events
datastructures for implications, variable bounds, and cliques
int * SCIPimplicsGetIds(SCIP_IMPLICS *implics, SCIP_Bool varfixing)
Definition: implics.c:3324
void SCIPvboundsFree(SCIP_VBOUNDS **vbounds, BMS_BLKMEM *blkmem)
Definition: implics.c:63
#define SCIP_Bool
Definition: def.h:62
SCIP_RETCODE SCIPcliquetableFree(SCIP_CLIQUETABLE **cliquetable, BMS_BLKMEM *blkmem)
Definition: implics.c:1797
type definitions for branch and bound tree
void SCIPcliquelistCheck(SCIP_CLIQUELIST *cliquelist, SCIP_VAR *var)
Definition: implics.c:3427
SCIP_RETCODE SCIPcliquetableComputeCliqueComponents(SCIP_CLIQUETABLE *cliquetable, SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_VAR **vars, int nbinvars, int nintvars, int nimplvars)
Definition: implics.c:3094
void SCIPimplicsFree(SCIP_IMPLICS **implics, BMS_BLKMEM *blkmem)
Definition: implics.c:441
SCIP_RETCODE SCIPvboundsDel(SCIP_VBOUNDS **vbounds, BMS_BLKMEM *blkmem, SCIP_VAR *vbdvar, SCIP_Bool negativecoef)
Definition: implics.c:278
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:1414
SCIP_VAR ** SCIPvboundsGetVars(SCIP_VBOUNDS *vbounds)
Definition: implics.c:3261
SCIP_Real * SCIPimplicsGetBounds(SCIP_IMPLICS *implics, SCIP_Bool varfixing)
Definition: implics.c:3312
#define SCIP_Real
Definition: def.h:150
int SCIPcliquetableGetNCliquesCreated(SCIP_CLIQUETABLE *cliquetable)
Definition: implics.c:3479
#define SCIP_Longint
Definition: def.h:135
common defines and data types used in all packages of SCIP
struct BMS_BlkMem BMS_BLKMEM
Definition: memory.h:419
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:196
int SCIPcliquelistGetNCliques(SCIP_CLIQUELIST *cliquelist, SCIP_Bool value)
Definition: implics.c:3409
SCIP_RETCODE SCIPcliquelistDel(SCIP_CLIQUELIST **cliquelist, BMS_BLKMEM *blkmem, SCIP_Bool value, SCIP_CLIQUE *clique)
Definition: implics.c:1500
memory allocation routines