Scippy

SCIP

Solving Constraint Integer Programs

heur_dins.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-2014 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_dins.h
17  * @ingroup PRIMALHEURISTICS
18  * @brief DINS primal heuristic
19  * @author Robert Waniek
20  *
21  * DINS combines the ideas of RINS (see @ref heur_rins.h) and Local Branching (see @ref heur_localbranching.h). It
22  * defines the neighborhood by introducing a distance function between the incumbent solution and the optimum of the LP
23  * relaxation. When applied during a branch-and-bound search, it further takes into account how variables change their
24  * values at different nodes of the tree.
25  */
26 
27 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
28 
29 #ifndef __SCIP_HEUR_DINS_H__
30 #define __SCIP_HEUR_DINS_H__
31 
32 #include "scip/scip.h"
33 
34 #ifdef __cplusplus
35 extern "C" {
36 #endif
37 
38 /** creates the DINS primal heuristic and includes it in SCIP */
39 extern
40 SCIP_RETCODE SCIPincludeHeurDins(
41  SCIP* scip /**< SCIP data structure */
42  );
43 
44 #ifdef __cplusplus
45 }
46 #endif
47 
48 #endif
49