Scippy

SCIP

Solving Constraint Integer Programs

struct_cutpool.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-2016 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 email to scip@zib.de. */
13 /* */
14 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
15 
16 /**@file struct_cutpool.h
17  * @brief datastructures for storing cuts in a cut pool
18  * @author Tobias Achterberg
19  */
20 
21 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
22 
23 #ifndef __SCIP_STRUCT_CUTPOOL_H__
24 #define __SCIP_STRUCT_CUTPOOL_H__
25 
26 
27 #include "scip/def.h"
28 #include "scip/type_clock.h"
29 #include "scip/type_misc.h"
30 #include "scip/type_lp.h"
31 #include "scip/type_cutpool.h"
32 
33 #ifdef __cplusplus
34 extern "C" {
35 #endif
36 
37 /** datastructure for cuts in a cut pool */
38 struct SCIP_Cut
39 {
40  SCIP_ROW* row; /**< LP row of this cut */
41  SCIP_Longint processedlp; /**< last LP, where this cut was processed in separation of the LP solution */
42  SCIP_Longint processedlpsol; /**< last LP, where this cut was processed in separation of other solutions */
43  int age; /**< age of the cut: number of successive times, the cut was not violated */
44  int pos; /**< position of cut in the cuts array of the cut pool */
45 };
46 
47 /** storage for pooled cuts */
49 {
50  SCIP_Longint ncalls; /**< number of times, the cutpool was separated */
51  SCIP_Longint ncutsfound; /**< total number of cuts that were separated from the pool */
52  SCIP_CLOCK* poolclock; /**< separation time */
53  SCIP_HASHTABLE* hashtable; /**< hash table to identify already stored cuts */
54  SCIP_CUT** cuts; /**< stored cuts of the pool */
55  SCIP_Longint processedlp; /**< last LP that has been processed for separating the LP */
56  SCIP_Longint processedlpsol; /**< last LP that has been processed for separating other solutions */
57  int cutssize; /**< size of cuts array */
58  int ncuts; /**< number of cuts stored in the pool */
59  int nremovablecuts; /**< number of cuts stored in the pool that are marked to be removable */
60  int agelimit; /**< maximum age a cut can reach before it is deleted from the pool */
61  int firstunprocessed; /**< first cut that has not been processed in the last LP */
62  int firstunprocessedsol;/**< first cut that has not been processed in the last LP when separating other solutions */
63  int maxncuts; /**< maximal number of cuts stored in the pool at the same time */
64  SCIP_Bool globalcutpool; /**< is this the global cut pool of SCIP? */
65 };
66 
67 #ifdef __cplusplus
68 }
69 #endif
70 
71 #endif
SCIP_ROW * row
SCIP_HASHTABLE * hashtable
type definitions for miscellaneous datastructures
SCIP_Longint processedlp
SCIP_CUT ** cuts
SCIP_Longint processedlpsol
SCIP_Longint processedlp
type definitions for LP management
type definitions for storing cuts in a cut pool
SCIP_Longint processedlpsol
#define SCIP_Bool
Definition: def.h:53
int firstunprocessedsol
type definitions for clocks and timing issues
SCIP_CLOCK * poolclock
SCIP_Longint ncalls
SCIP_Longint ncutsfound
#define SCIP_Longint
Definition: def.h:112
SCIP_Bool globalcutpool
common defines and data types used in all packages of SCIP