Scippy

GCG

Branch-and-Price & Column Generation for Everyone

heur_gcgrens.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 heur_gcgrens.h
29  * @brief LNS heuristic that finds the optimal rounding to a given point
30  * @author Timo Berthold
31  * @author Christian Puchert
32  * @ingroup PRIMALHEURISTICS
33  */
34 
35 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
36 
37 #ifndef GCG_HEUR_GCGRENS_H__
38 #define GCG_HEUR_GCGRENS_H__
39 
40 #include "scip/scip.h"
41 
42 #ifdef __cplusplus
43 extern "C" {
44 #endif
45 
46 /** creates RENS primal heuristic and includes it in SCIP */
47 extern
48 SCIP_RETCODE SCIPincludeHeurGcgrens(
49  SCIP* scip /**< SCIP data structure */
50  );
51 
52 /** main procedure of the GCG RENS heuristic, creates and solves a sub-SCIP */
53 SCIP_RETCODE GCGapplyGcgrens(
54  SCIP* scip, /**< original SCIP data structure */
55  SCIP_HEUR* heur, /**< heuristic data structure */
56  SCIP_RESULT* result, /**< result data structure */
57  SCIP_Real minfixingrate, /**< minimum percentage of integer variables that have to be fixed */
58  SCIP_Real minimprove, /**< factor by which RENS should at least improve the incumbent */
59  SCIP_Longint maxnodes, /**< maximum number of nodes for the subproblem */
60  SCIP_Longint nstallnodes, /**< number of stalling nodes for the subproblem */
61  SCIP_Bool binarybounds, /**< should general integers get binary bounds [floor(.),ceil(.)]? */
62  SCIP_Bool uselprows /**< should subproblem be created out of the rows in the LP rows? */
63  );
64 
65 #ifdef __cplusplus
66 }
67 #endif
68 
69 #endif
SCIP_RETCODE GCGapplyGcgrens(SCIP *scip, SCIP_HEUR *heur, SCIP_RESULT *result, SCIP_Real minfixingrate, SCIP_Real minimprove, SCIP_Longint maxnodes, SCIP_Longint nstallnodes, SCIP_Bool binarybounds, SCIP_Bool uselprows)
Definition: heur_gcgrens.c:332
SCIP_RETCODE SCIPincludeHeurGcgrens(SCIP *scip)
Definition: heur_gcgrens.c:814