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
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
/* */
/* 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_pricestore.h
* @ingroup INTERNALAPI
* @brief data structures for storing priced variables
* @author Tobias Achterberg
*/
/*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
#ifndef __SCIP_STRUCT_PRICESTORE_H__
#define __SCIP_STRUCT_PRICESTORE_H__
#include "scip/def.h"
#include "scip/type_clock.h"
#include "scip/type_var.h"
#include "scip/type_pricestore.h"
#ifdef __cplusplus
extern "C" {
#endif
/** storage for priced variables */
struct SCIP_Pricestore
{
SCIP_CLOCK* probpricingtime; /**< time needed to price existing problem variables */
SCIP_VAR** vars; /**< array with priced variables with violated reduced costs sorted by score */
SCIP_Real* scores; /**< score for each priced variable (e.g. |redcost|/no. of nonzeros) */
SCIP_VAR** bdviolvars; /**< variables where zero violates the bounds */
SCIP_Real* bdviolvarslb; /**< lower bounds of bdviolvars */
SCIP_Real* bdviolvarsub; /**< upper bounds of bdbiolvars */
int varssize; /**< size of vars and score arrays */
int nvars; /**< number of priced variables (max. is set->price_maxvars) */
int bdviolvarssize; /**< size of bdviolvars, bdviolvarslb, and bdviolvarsub arrays */
int nbdviolvars; /**< number of variables, where zero violates the bounds */
int naddedbdviolvars; /**< number of bound violated variables already added to the LP */
int nprobpricings; /**< total number of calls to problem variable pricing */
int nprobvarsfound; /**< total number of problem variables, that were added (and possibly thrown away) */
int nvarsfound; /**< total number of variables, that were added (and possibly thrown away) */
int nvarsapplied; /**< total number of variables, that were added to the LP */
SCIP_Bool initiallp; /**< is the pricing storage currently being filled with the initial LP columns? */
};
#ifdef __cplusplus
}
#endif
#endif