Scippy

SCIP

Solving Constraint Integer Programs

branch_leastinf.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 branch_leastinf.h
17  * @ingroup BRANCHINGRULES
18  * @brief least infeasible LP branching rule
19  * @author Tobias Achterberg
20  *
21  * The least infeasible branching rule selects a candidate variable $j$ with fractional solution value \f$ \hat{x}_j\f$
22  * which maximizes
23  * \f[
24  * \max \left\{ \lceil \hat{x}_j \rceil - \hat{x}_j, \hat{x}_j - \lfloor \hat{x}_j \rfloor \right\}.
25  * \f]
26  * i. e., a variable which already is closest to being integral among all branching candidates.
27  *
28  * The least infeasible rule and many other branching rules of SCIP are explained and compared in
29  *
30  * @par
31  * Tobias Achterberg@n
32  * Constraint Integer Programming@n
33  * PhD Thesis, Technische Universit├Ąt Berlin, 2007@n
34  */
35 
36 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
37 
38 #ifndef __SCIP_BRANCH_LEASTINF_H__
39 #define __SCIP_BRANCH_LEASTINF_H__
40 
41 
42 #include "scip/scip.h"
43 
44 #ifdef __cplusplus
45 extern "C" {
46 #endif
47 
48 /** creates the least infeasible LP branching rule and includes it in SCIP */
49 extern
51  SCIP* scip /**< SCIP data structure */
52  );
53 
54 #ifdef __cplusplus
55 }
56 #endif
57 
58 #endif
59