1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
/* */
/* This file is part of the program and library */
/* SCIP --- Solving Constraint Integer Programs */
/* */
/* Copyright 2002-2022 Zuse Institute Berlin */
/* */
/* Licensed under the Apache License, Version 2.0 (the "License"); */
/* you may not use this file except in compliance with the License. */
/* You may obtain a copy of the License at */
/* */
/* http://www.apache.org/licenses/LICENSE-2.0 */
/* */
/* Unless required by applicable law or agreed to in writing, software */
/* distributed under the License is distributed on an "AS IS" BASIS, */
/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. */
/* See the License for the specific language governing permissions and */
/* limitations under the License. */
/* */
/* You should have received a copy of the Apache-2.0 license */
/* along with SCIP; see the file LICENSE. If not visit scipopt.org. */
/* */
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
/**@file struct_cutpool.h
* @ingroup INTERNALAPI
* @brief datastructures for storing cuts in a cut pool
* @author Tobias Achterberg
*/
/*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
#ifndef __SCIP_STRUCT_CUTPOOL_H__
#define __SCIP_STRUCT_CUTPOOL_H__
#include "scip/def.h"
#include "scip/type_clock.h"
#include "scip/type_misc.h"
#include "scip/type_lp.h"
#include "scip/type_cutpool.h"
#ifdef __cplusplus
extern "C" {
#endif
/** datastructure for cuts in a cut pool */
struct SCIP_Cut
{
SCIP_ROW* row; /**< LP row of this cut */
SCIP_Longint processedlp; /**< last LP, where this cut was processed in separation of the LP solution */
SCIP_Longint processedlpsol; /**< last LP, where this cut was processed in separation of other solutions */
int age; /**< age of the cut: number of successive times, the cut was not violated */
int pos; /**< position of cut in the cuts array of the cut pool */
};
/** storage for pooled cuts */
struct SCIP_Cutpool
{
SCIP_Longint ncalls; /**< number of times, the cutpool was separated */
SCIP_Longint nrootcalls; /**< number of times, the cutpool was separated at the root */
SCIP_Longint ncutsfound; /**< total number of cuts that were added to the pool */
SCIP_Longint ncutsadded; /**< total number of cuts that were added from the pool */
SCIP_CLOCK* poolclock; /**< separation time */
SCIP_HASHTABLE* hashtable; /**< hash table to identify already stored cuts */
SCIP_CUT** cuts; /**< stored cuts of the pool */
SCIP_Longint processedlp; /**< last LP that has been processed for separating the LP */
SCIP_Longint processedlpsol; /**< last LP that has been processed for separating other solutions */
SCIP_Real processedlpefficacy;/**< minimal efficacy used in last processed LP */
SCIP_Real processedlpsolefficacy;/**< minimal efficacy used in last processed LP for separating other solutions */
int cutssize; /**< size of cuts array */
int ncuts; /**< number of cuts stored in the pool */
int nremovablecuts; /**< number of cuts stored in the pool that are marked to be removable */
int agelimit; /**< maximum age a cut can reach before it is deleted from the pool */
int firstunprocessed; /**< first cut that has not been processed in the last LP */
int firstunprocessedsol;/**< first cut that has not been processed in the last LP when separating other solutions */
SCIP_Longint maxncuts; /**< maximal number of cuts stored in the pool at the same time */
SCIP_Bool globalcutpool; /**< is this the global cut pool of SCIP? */
};
#ifdef __cplusplus
}
#endif
#endif