×
☰
Toggle navigation
SCIP Optimization Suite
SCIP
SoPlex
ZIMPL
UG
GCG
Documentation
GCG 3.5.0
PyGCGOpt (0.1.3)
GCG
Branch-and-Price & Column Generation for Everyone
type_pricestore_gcg.h
Go to the documentation of this file.
1
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
2
/* */
3
/* This file is part of the program */
4
/* GCG --- Generic Column Generation */
5
/* a Dantzig-Wolfe decomposition based extension */
6
/* of the branch-cut-and-price framework */
7
/* SCIP --- Solving Constraint Integer Programs */
8
/* */
9
/* Copyright (C) 2010-2021 Operations Research, RWTH Aachen University */
10
/* Zuse Institute Berlin (ZIB) */
11
/* */
12
/* This program is free software; you can redistribute it and/or */
13
/* modify it under the terms of the GNU Lesser General Public License */
14
/* as published by the Free Software Foundation; either version 3 */
15
/* of the License, or (at your option) any later version. */
16
/* */
17
/* This program is distributed in the hope that it will be useful, */
18
/* but WITHOUT ANY WARRANTY; without even the implied warranty of */
19
/* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the */
20
/* GNU Lesser General Public License for more details. */
21
/* */
22
/* You should have received a copy of the GNU Lesser General Public License */
23
/* along with this program; if not, write to the Free Software */
24
/* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA.*/
25
/* */
26
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
27
28
/**@file type_pricestore_gcg.h
29
* @ingroup TYPEDEFINITIONS
30
* @brief type definitions for storing priced cols
31
* @author Jonas Witt
32
*/
33
34
/*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
35
36
#ifndef __GCG_TYPE_PRICESTORE_H__
37
#define __GCG_TYPE_PRICESTORE_H__
38
39
#ifdef __cplusplus
40
extern
"C"
{
41
#endif
42
43
/** possible settings for specifying the solution for which cuts are selected */
44
enum
GCG_Efficiacychoice
45
{
46
GCG_EFFICIACYCHOICE_DANTZIG
= 0,
/**< use Dantzig's rule (reduced cost) to base efficacy on */
47
GCG_EFFICIACYCHOICE_STEEPESTEDGE
= 1,
/**< use steepest edge rule s( to base efficacy on */
48
GCG_EFFICIACYCHOICE_LAMBDA
= 2
/**< use lambda pricing to base efficacy on */
49
};
50
typedef
enum
GCG_Efficiacychoice
GCG_EFFICIACYCHOICE
;
51
52
typedef
struct
GCG_PriceStore
GCG_PRICESTORE
;
/**< storage for priced variables */
53
54
#ifdef __cplusplus
55
}
56
#endif
57
58
#endif
GCG_EFFICIACYCHOICE
enum GCG_Efficiacychoice GCG_EFFICIACYCHOICE
Definition:
type_pricestore_gcg.h:50
GCG_EFFICIACYCHOICE_STEEPESTEDGE
@ GCG_EFFICIACYCHOICE_STEEPESTEDGE
Definition:
type_pricestore_gcg.h:47
GCG_Efficiacychoice
GCG_Efficiacychoice
Definition:
type_pricestore_gcg.h:44
GCG_PriceStore
Definition:
struct_pricestore_gcg.h:52
GCG_EFFICIACYCHOICE_DANTZIG
@ GCG_EFFICIACYCHOICE_DANTZIG
Definition:
type_pricestore_gcg.h:46
GCG_EFFICIACYCHOICE_LAMBDA
@ GCG_EFFICIACYCHOICE_LAMBDA
Definition:
type_pricestore_gcg.h:48
src
type_pricestore_gcg.h
© 2010-2021 by Operations Research, RWTH Aachen University,
Imprint
Privacy Policy
Generated on Mon Dec 20 2021 10:25:22 for Generic Column Generation by
1.8.17