Scippy

SCIP

Solving Constraint Integer Programs

heur_coefdiving.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_coefdiving.h
17  * @ingroup PRIMALHEURISTICS
18  * @brief LP diving heuristic that chooses fixings w.r.t. the matrix coefficients
19  * @author Tobias Achterberg
20  *
21  * Diving heuristic: Iteratively fixes some fractional variable and resolves the LP-relaxation, thereby simulating a
22  * depth-first-search in the tree. Coefficient Diving chooses the variable with the fewest locking number in any
23  * direction and rounds it into this direction. One-level backtracking is applied: If the LP gets infeasible, the last
24  * fixing is undone, and the opposite fixing is tried. If this is infeasible, too, the procedure aborts.
25  */
26 
27 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
28 
29 #ifndef __SCIP_HEUR_COEFDIVING_H__
30 #define __SCIP_HEUR_COEFDIVING_H__
31 
32 
33 #include "scip/scip.h"
34 
35 #ifdef __cplusplus
36 extern "C" {
37 #endif
38 
39 /** creates the coefdiving heuristic and includes it in SCIP */
40 extern
41 SCIP_RETCODE SCIPincludeHeurCoefdiving(
42  SCIP* scip /**< SCIP data structure */
43  );
44 
45 #ifdef __cplusplus
46 }
47 #endif
48 
49 #endif
50