Scippy

SCIP

Solving Constraint Integer Programs

bendersdefcuts.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-2018 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 visit scip.zib.de. */
13 /* */
14 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
15 
16 /**@file bendersdefcuts.c
17  * @brief default cuts for Benders' decomposition
18  * @author Stephen J. Maher
19  */
20 
21 /*--+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
22 
23 #ifndef __SCIP_BENDERSDEFCUTS_H__
24 #define __SCIP_BENDERSDEFCUTS_H__
25 
26 /* include header files here, such that the user only has to include bendersdefcuts.h */
27 #include "scip/benderscut_feas.h"
28 #include "scip/benderscut_int.h"
29 #include "scip/benderscut_nogood.h"
30 #include "scip/benderscut_opt.h"
31 
32 #ifdef __cplusplus
33 extern "C" {
34 #endif
35 
36 /** includes default Benders' decomposition cuts plugins into SCIP and the associated Benders' decomposition */
37 extern
39  SCIP* scip, /**< SCIP data structure */
40  SCIP_BENDERS* benders /**< Benders' decomposition struture */
41  );
42 
43 #ifdef __cplusplus
44 }
45 #endif
46 
47 #endif
Generates a Laporte and Louveaux Benders&#39; decomposition integer cut.
enum SCIP_Retcode SCIP_RETCODE
Definition: type_retcode.h:53
Generates a standard Benders&#39; decomposition optimality cut.
Standard feasibility cuts for Benders&#39; decomposition.
SCIP_RETCODE SCIPincludeBendersDefaultCuts(SCIP *scip, SCIP_BENDERS *benders)
Generates a no-good cut for solutions that are integer infeasible.