Scippy

SCIP

Solving Constraint Integer Programs

heur_trivial.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-2016 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_trivial.h
17  * @ingroup PRIMALHEURISTICS
18  * @brief trivial primal heuristic
19  * @author Timo Berthold
20  *
21  * pre-root heuristic that tries some trivial (but often feasibile) solutions: all variables at their upper bounds, all
22  * variables at their lower bounds, all variables zero, all variables at the bound with the fewer locks. This will,
23  * e.g., find a start solution for all pure set covering or set packing problems.
24  */
25 
26 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
27 
28 #ifndef __SCIP_HEUR_TRIVIAL_H__
29 #define __SCIP_HEUR_TRIVIAL_H__
30 
31 
32 #include "scip/scip.h"
33 
34 #ifdef __cplusplus
35 extern "C" {
36 #endif
37 
38 /** creates the trivial primal heuristic and includes it in SCIP */
39 extern
41  SCIP* scip /**< SCIP data structure */
42  );
43 
44 #ifdef __cplusplus
45 }
46 #endif
47 
48 #endif
enum SCIP_Retcode SCIP_RETCODE
Definition: type_retcode.h:53
SCIP_RETCODE SCIPincludeHeurTrivial(SCIP *scip)
Definition: heur_trivial.c:233
SCIP callable library.