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 conflicts
28   	 * @author Jakob Witzig
29   	 */
30   	
31   	/*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
32   	
33   	#ifndef __SCIP_STRUCT_CONFLICTSTORE_H__
34   	#define __SCIP_STRUCT_CONFLICTSTORE_H__
35   	
36   	
37   	#include "scip/def.h"
38   	#include "scip/type_conflictstore.h"
39   	
40   	#ifdef __cplusplus
41   	extern "C" {
42   	#endif
43   	
44   	/** storage for conflicts */
45   	struct SCIP_ConflictStore
46   	{
47   	   SCIP_EVENTHDLR*       eventhdlr;          /**< event handler to catch improving solutions */
48   	   SCIP_CONS**           conflicts;          /**< array with conflicts */
49   	   SCIP_CONS**           dualrayconfs;       /**< array with proofs based on dual rays */
50   	   SCIP_CONS**           dualsolconfs;       /**< array with proofs based on dual solutions */
51   	   SCIP_CONS**           origconfs;          /**< array of original conflicts added in stage SCIP_STAGE_PROBLEM */
52   	   SCIP_Real*            confprimalbnds;     /**< array of primal bounds valid at the time the corresponding bound exceeding
53   	                                              *   conflict was found (-infinity if the conflict based on an infeasible LP) */
54   	   SCIP_Real*            dualprimalbnds;     /**< array of primal bounds valid at the time the corresponding dual proof
55   	                                              *   based on a dual solution was found */
56   	   SCIP_Real*            scalefactors;       /**< scaling factor that needs to be considered when updating the side */
57   	   SCIP_Bool*            updateside;         /**< array to store whether the side should be updated whenever a new incumbent is found */
58   	   SCIP_Bool*            drayrelaxonly;      /**< array to store whether the dual proof is valid for the current relaxation only */
59   	   SCIP_Bool*            dsolrelaxonly;      /**< array to store whether the dual proof is valid for the current relaxation only */
60   	   SCIP_Real             avgswitchlength;    /**< average length of switched paths */
61   	   SCIP_Real             lastcutoffbound;    /**< last cutoff bound for which the conflict store was cleaned */
62   	   SCIP_Longint          lastnodenum;        /**< number of the last seen node */
63   	   SCIP_Longint          ncleanups;          /**< number of storage cleanups */
64   	   SCIP_Longint          nnzdualrays;        /**< number of non-zeros in all stored proofs based on dual rays */
65   	   SCIP_Longint          nnzdualsols;        /**< number of non-zeros in all stored proofs based on dual solutions */
66   	   int                   conflictsize;       /**< size of conflict array (bounded by conflict->maxpoolsize) */
67   	   int                   origconflictsize;   /**< size of origconfs array */
68   	   int                   nconflicts;         /**< number of stored conflicts */
69   	   int                   ndualrayconfs;      /**< number of stored proofs based on dual rays */
70   	   int                   ndualsolconfs;      /**< number of stored proofs based on dual solutions */
71   	   int                   norigconfs;         /**< number of original conflicts */
72   	   int                   ncbconflicts;       /**< number of conflicts depending on cutoff bound */
73   	   int                   nconflictsfound;    /**< total number of conflicts found so far */
74   	   int                   cleanupfreq;        /**< frequency to cleanup the storage if the storage is not full */
75   	   int                   nswitches;          /**< number of path switches */
76   	   int                   initstoresize;      /**< initial size of the storage (different to maxstoresize iff dynamic) */
77   	   int                   storesize;          /**< current size of the storage (different to maxstoresize iff dynamic) */
78   	   int                   maxstoresize;       /**< maximal size of the storage */
79   	};
80   	
81   	#ifdef __cplusplus
82   	}
83   	#endif
84   	
85   	#endif
86