Scippy

SCIP

Solving Constraint Integer Programs

heur_nlpdiving.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_nlpdiving.h
17  * @ingroup PRIMALHEURISTICS
18  * @brief NLP diving heuristic that chooses fixings w.r.t. the fractionalities
19  * @author Timo Berthold
20  * @author Stefan Vigerske
21  *
22  * Diving heuristic: Iteratively fixes some fractional variable and resolves the NLP-relaxation, thereby simulating a
23  * depth-first-search in the tree. Fractional Diving chooses the variable with the highest fractionality and rounds it to the
24  * nearest integer. One-level backtracking is applied: If the NLP gets infeasible, the last fixing is undone, and the
25  * opposite fixing is tried. If this is infeasible, too, the procedure aborts.
26  */
27 
28 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
29 
30 #ifndef __SCIP_HEUR_NLPDIVING_H__
31 #define __SCIP_HEUR_NLPDIVING_H__
32 
33 
34 #include "scip/scip.h"
35 
36 #ifdef __cplusplus
37 extern "C" {
38 #endif
39 
40 /** creates the fracdiving heuristic and includes it in SCIP */
41 extern
43  SCIP* scip /**< SCIP data structure */
44  );
45 
46 #ifdef __cplusplus
47 }
48 #endif
49 
50 #endif
enum SCIP_Retcode SCIP_RETCODE
Definition: type_retcode.h:53
struct Scip SCIP
Definition: type_scip.h:30
SCIP_RETCODE SCIPincludeHeurNlpdiving(SCIP *scip)
SCIP callable library.