Scippy

SCIP

Solving Constraint Integer Programs

struct_sepastore.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-2023 Zuse Institute Berlin (ZIB) */
7 /* */
8 /* Licensed under the Apache License, Version 2.0 (the "License"); */
9 /* you may not use this file except in compliance with the License. */
10 /* You may obtain a copy of the License at */
11 /* */
12 /* http://www.apache.org/licenses/LICENSE-2.0 */
13 /* */
14 /* Unless required by applicable law or agreed to in writing, software */
15 /* distributed under the License is distributed on an "AS IS" BASIS, */
16 /* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. */
17 /* See the License for the specific language governing permissions and */
18 /* limitations under the License. */
19 /* */
20 /* You should have received a copy of the Apache-2.0 license */
21 /* along with SCIP; see the file LICENSE. If not visit scipopt.org. */
22 /* */
23 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
24 
25 /**@file struct_sepastore.h
26  * @ingroup INTERNALAPI
27  * @brief datastructures for storing separated cuts
28  * @author Tobias Achterberg
29  * @author Leona Gottwald
30  */
31 
32 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
33 
34 #ifndef __SCIP_STRUCT_SEPASTORE_H__
35 #define __SCIP_STRUCT_SEPASTORE_H__
36 
37 
38 #include "scip/def.h"
39 #include "scip/type_lp.h"
40 #include "scip/type_var.h"
41 #include "scip/type_sepastore.h"
42 
43 #ifdef __cplusplus
44 extern "C" {
45 #endif
46 
47 /** storage for separated cuts */
49 {
50  SCIP_ROW** cuts; /**< array with separated cuts sorted by score */
51  SCIP_RANDNUMGEN* randnumgen; /**< random number generator used for tie breaking */
52  int cutssize; /**< size of cuts and score arrays */
53  int ncuts; /**< number of separated cuts (max. is set->sepa_maxcuts) */
54  int nforcedcuts; /**< number of forced separated cuts (first positions in cuts array) */
55  int ncutsadded; /**< total number of cuts added so far */
56  int ncutsaddedviapool; /**< total number of cuts added from cutpool */
57  int ncutsaddeddirect; /**< total number of cuts added directly */
58  int ncutsfoundround; /**< number of cuts found so far in this separation round */
59  int ncutsapplied; /**< total number of cuts applied to the LP */
60  SCIP_Bool initiallp; /**< is the separation storage currently being filled with the initial LP rows? */
61  SCIP_Bool forcecuts; /**< should the cuts be used despite the number of cuts parameter limit? */
62 };
63 
64 #ifdef __cplusplus
65 }
66 #endif
67 
68 #endif
type definitions for LP management
SCIP_ROW ** cuts
type definitions for problem variables
type definitions for storing separated cuts
#define SCIP_Bool
Definition: def.h:93
SCIP_RANDNUMGEN * randnumgen
SCIP_Bool initiallp
common defines and data types used in all packages of SCIP
SCIP_Bool forcecuts