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_pricestore.h
26   	 * @ingroup INTERNALAPI
27   	 * @brief  data structures for storing priced variables
28   	 * @author Tobias Achterberg
29   	 */
30   	
31   	/*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
32   	
33   	#ifndef __SCIP_STRUCT_PRICESTORE_H__
34   	#define __SCIP_STRUCT_PRICESTORE_H__
35   	
36   	
37   	#include "scip/def.h"
38   	#include "scip/type_clock.h"
39   	#include "scip/type_var.h"
40   	#include "scip/type_pricestore.h"
41   	
42   	#ifdef __cplusplus
43   	extern "C" {
44   	#endif
45   	
46   	/** storage for priced variables */
47   	struct SCIP_Pricestore
48   	{
49   	   SCIP_CLOCK*           probpricingtime;    /**< time needed to price existing problem variables */
50   	   SCIP_VAR**            vars;               /**< array with priced variables with violated reduced costs sorted by score */
51   	   SCIP_Real*            scores;             /**< score for each priced variable (e.g. |redcost|/no. of nonzeros) */
52   	   SCIP_VAR**            bdviolvars;         /**< variables where zero violates the bounds */
53   	   SCIP_Real*            bdviolvarslb;       /**< lower bounds of bdviolvars */
54   	   SCIP_Real*            bdviolvarsub;       /**< upper bounds of bdbiolvars */
55   	   int                   varssize;           /**< size of vars and score arrays */
56   	   int                   nvars;              /**< number of priced variables (max. is set->price_maxvars) */
57   	   int                   bdviolvarssize;     /**< size of bdviolvars, bdviolvarslb, and bdviolvarsub arrays */
58   	   int                   nbdviolvars;        /**< number of variables, where zero violates the bounds */
59   	   int                   naddedbdviolvars;   /**< number of bound violated variables already added to the LP */
60   	   int                   nprobpricings;      /**< total number of calls to problem variable pricing */
61   	   int                   nprobvarsfound;     /**< total number of problem variables, that were added (and possibly thrown away) */
62   	   int                   nvarsfound;         /**< total number of variables, that were added (and possibly thrown away) */
63   	   int                   nvarsapplied;       /**< total number of variables, that were added to the LP */
64   	   SCIP_Bool             initiallp;          /**< is the pricing storage currently being filled with the initial LP columns? */
65   	};
66   	
67   	#ifdef __cplusplus
68   	}
69   	#endif
70   	
71   	#endif
72