Scippy

SCIP

Solving Constraint Integer Programs

heur_oneopt.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_oneopt.h
17  * @ingroup PRIMALHEURISTICS
18  * @brief Improvement heuristic that alters single variable values
19  * @author Timo Berthold
20  *
21  * Oneopt is a straightforward improvement heuristic: given a feasible MIP solution, the value of
22  * an integer variable x<sub>j</sub> can be decreased for c<sub>j</sub> > 0 or increased for c<sub>j</sub> < 0
23  * if the resulting solution is still feasible. If more than one variable can be shifted, they are sorted by
24  * non-decreasing impact on the objective and sequentially shifted until no more improvements can be
25  * obtained.
26  */
27 
28 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
29 
30 #ifndef __SCIP_HEUR_ONEOPT_H__
31 #define __SCIP_HEUR_ONEOPT_H__
32 
33 
34 #include "scip/scip.h"
35 
36 #ifdef __cplusplus
37 extern "C" {
38 #endif
39 
40 /** creates the oneopt primal heuristic and includes it in SCIP */
41 extern
42 SCIP_RETCODE SCIPincludeHeurOneopt(
43  SCIP* scip /**< SCIP data structure */
44  );
45 
46 #ifdef __cplusplus
47 }
48 #endif
49 
50 #endif
51