Scippy

SCIP

Solving Constraint Integer Programs

struct_pricestore.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_pricestore.h
17  * @brief datastructures for storing priced variables
18  * @author Tobias Achterberg
19  */
20 
21 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
22 
23 #ifndef __SCIP_STRUCT_PRICESTORE_H__
24 #define __SCIP_STRUCT_PRICESTORE_H__
25 
26 
27 #include "scip/def.h"
28 #include "scip/type_clock.h"
29 #include "scip/type_var.h"
30 #include "scip/type_pricestore.h"
31 
32 #ifdef __cplusplus
33 extern "C" {
34 #endif
35 
36 /** storage for priced variables */
38 {
39  SCIP_CLOCK* probpricingtime; /**< time needed to price existing problem variables */
40  SCIP_VAR** vars; /**< array with priced variables with violated reduced costs sorted by score */
41  SCIP_Real* scores; /**< score for each priced variable (e.g. |redcost|/no. of nonzeros) */
42  SCIP_VAR** bdviolvars; /**< variables where zero violates the bounds */
43  SCIP_Real* bdviolvarslb; /**< lower bounds of bdviolvars */
44  SCIP_Real* bdviolvarsub; /**< upper bounds of bdbiolvars */
45  int varssize; /**< size of vars and score arrays */
46  int nvars; /**< number of priced variables (max. is set->price_maxvars) */
47  int bdviolvarssize; /**< size of bdviolvars, bdviolvarslb, and bdviolvarsub arrays */
48  int nbdviolvars; /**< number of variables, where zero violates the bounds */
49  int naddedbdviolvars; /**< number of bound violated variables already added to the LP */
50  int nprobpricings; /**< total number of calls to problem variable pricing */
51  int nprobvarsfound; /**< total number of problem variables, that were added (and possibly thrown away) */
52  int nvarsfound; /**< total number of variables, that were added (and possibly thrown away) */
53  int nvarsapplied; /**< total number of variables, that were added to the LP */
54  SCIP_Bool initiallp; /**< is the pricing storage currently being filled with the initial LP columns? */
55 };
56 
57 #ifdef __cplusplus
58 }
59 #endif
60 
61 #endif
type definitions for storing priced variables
SCIP_CLOCK * probpricingtime
type definitions for problem variables
#define SCIP_Bool
Definition: def.h:53
SCIP_Real * scores
SCIP_Real * bdviolvarslb
type definitions for clocks and timing issues
SCIP_VAR ** bdviolvars
#define SCIP_Real
Definition: def.h:127
SCIP_Real * bdviolvarsub
common defines and data types used in all packages of SCIP