Scippy

SCIP

Solving Constraint Integer Programs

heur_rins.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-2017 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 email to scip@zib.de. */
13 /* */
14 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
15 
16 /**@file heur_rins.h
17  * @ingroup PRIMALHEURISTICS
18  * @brief LNS heuristic that combines the incumbent with the LP optimum
19  * @author Timo Berthold
20  *
21  * RINS is a large neighborhood search improvement heuristic, i.e., it requires a known feasible solution. It solves a
22  * sub-SCIP that is created by fixing variables which take the same value in the incumbent and the current node's LP
23  * relaxation.
24  */
25 
26 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
27 
28 #ifndef __SCIP_HEUR_RINS_H__
29 #define __SCIP_HEUR_RINS_H__
30 
31 #include "scip/scip.h"
32 
33 #ifdef __cplusplus
34 extern "C" {
35 #endif
36 
37 /** creates RINS primal heuristic and includes it in SCIP
38  *
39  * @ingroup PrimalHeuristicIncludes
40  */
41 extern
42 SCIP_RETCODE SCIPincludeHeurRins(
43  SCIP* scip /**< SCIP data structure */
44  );
45 
46 #ifdef __cplusplus
47 }
48 #endif
49 
50 #endif
SCIP_RETCODE
enum SCIP_Retcode SCIP_RETCODE
Definition: type_retcode.h:53
SCIPincludeHeurRins
SCIP_RETCODE SCIPincludeHeurRins(SCIP *scip)
Definition: heur_rins.c:587
scip.h
SCIP callable library.