Scippy

SCIP

Solving Constraint Integer Programs

type_reopt.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-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 type_reopt.h
26  * @brief type definitions for collecting reoptimization information
27  * @author Jakob Witzig
28  */
29 
30 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
31 
32 #ifndef __SCIP_TYPE_REOPT_H__
33 #define __SCIP_TYPE_REOPT_H__
34 
35 #ifdef __cplusplus
36 extern "C" {
37 #endif
38 
39 typedef struct SCIP_Reopt SCIP_REOPT; /**< reopt data */
40 
41 typedef struct SCIP_SolTree SCIP_SOLTREE; /**< tree to check solutions */
42 
43 typedef struct SCIP_SolNode SCIP_SOLNODE; /**< nodes of SCIP_SOLTREE */
44 
45 typedef struct SCIP_ReoptTree SCIP_REOPTTREE; /**< data structure to store the search tree */
46 
47 typedef struct SCIP_ReoptNode SCIP_REOPTNODE; /**< nodes of SCIP_REOPTTREE */
48 
49 typedef struct SCIP_ReoptNode SCIP_REPRESENTATIVE;/**< representatives of the search frontier */
50 
51 typedef struct SCIP_ReoptConsData SCIP_REOPTCONSDATA; /**< data for constraints to handle dual information \
52  * within (mixed) binary programs
53  */
54 
55 /* type of nodes during reoptimization */
57 {
58  SCIP_REOPTTYPE_NONE = 0, /**< node is not part of the reoptimizationtree */
59  SCIP_REOPTTYPE_TRANSIT = 1, /**< node is only needed for reconstructing the tree */
60  SCIP_REOPTTYPE_INFSUBTREE = 2, /**< node contains dual reductions which leed to LP infeasibility */
61  SCIP_REOPTTYPE_STRBRANCHED = 3, /**< node contains dual reductions */
62  SCIP_REOPTTYPE_LOGICORNODE = 4, /**< node contains additional constraints */
63  SCIP_REOPTTYPE_LEAF = 5, /**< node is a leaf node */
64  SCIP_REOPTTYPE_PRUNED = 6, /**< node is a leaf node and pruned by boudning */
65  SCIP_REOPTTYPE_FEASIBLE = 7 /**< node is a leaf node and has an integral optimal LP solution */
66 };
67 typedef enum SCIP_ReoptType SCIP_REOPTTYPE; /**< type nodes during reoptimization */
68 
70 {
71  REOPT_CONSTYPE_INFSUBTREE = 0, /**< constraint cutoffs an LP infeasible subtree */
72  REOPT_CONSTYPE_DUALREDS = 1, /**< constraint reconstructs dual reductions */
73  REOPT_CONSTYPE_CUT = 2, /**< constraint representing a cut, e.g., to separate a solution */
74  REOPT_CONSTYPE_UNKNOWN = 3 /**< constraint was added by SCIP, e.g., a (local) conflict */
75 };
76 typedef enum Reopt_ConsType REOPT_CONSTYPE; /**< tye of constraunts added during reoptimization */
77 
78 #ifdef __cplusplus
79 }
80 #endif
81 
82 #endif
struct SCIP_ReoptConsData SCIP_REOPTCONSDATA
Definition: type_reopt.h:51
Reopt_ConsType
Definition: type_reopt.h:69
enum SCIP_ReoptType SCIP_REOPTTYPE
Definition: type_reopt.h:67
SCIP_ReoptType
Definition: type_reopt.h:56
enum Reopt_ConsType REOPT_CONSTYPE
Definition: type_reopt.h:76