Scippy

SCIP

Solving Constraint Integer Programs

heur_shiftandpropagate.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_shiftandpropagate.h
17  * @ingroup PRIMALHEURISTICS
18  * @brief preroot heuristic that alternatingly fixes variables and propagates domains
19  * @author Timo Berthold
20  * @author Gregor Hendel
21  *
22  * Preroot primal heuristic that fixes variables and propagates these fixings. In each step, the heuristic fixes a
23  * variable such that the number of violated LP rows gets maximally reduced. The fixing is then propagated to reduce
24  * further variable domains. In case that the domain propagation detects the infeasibility of the current partial
25  * solution, the domain is reset to its previous state and the variable is postponed.
26  */
27 
28 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
29 
30 #ifndef __SCIP_HEUR_SHIFTANDPROPAGATE_H__
31 #define __SCIP_HEUR_SHIFTANDPROPAGATE_H__
32 
33 
34 #include "scip/scip.h"
35 
36 #ifdef __cplusplus
37 extern "C" {
38 #endif
39 
40 /** creates the shiftandpropagate primal heuristic and includes it in SCIP */
41 extern
42 SCIP_RETCODE SCIPincludeHeurShiftandpropagate(
43  SCIP* scip /**< SCIP data structure */
44  );
45 
46 #ifdef __cplusplus
47 }
48 #endif
49 
50 #endif
51