1    	/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
2    	/*                                                                           */
3    	/*                  This file is part of the program and library             */
4    	/*         SCIP --- Solving Constraint Integer Programs                      */
5    	/*                                                                           */
6    	/*  Copyright (c) 2002-2023 Zuse Institute Berlin (ZIB)                      */
7    	/*                                                                           */
8    	/*  Licensed under the Apache License, Version 2.0 (the "License");          */
9    	/*  you may not use this file except in compliance with the License.         */
10   	/*  You may obtain a copy of the License at                                  */
11   	/*                                                                           */
12   	/*      http://www.apache.org/licenses/LICENSE-2.0                           */
13   	/*                                                                           */
14   	/*  Unless required by applicable law or agreed to in writing, software      */
15   	/*  distributed under the License is distributed on an "AS IS" BASIS,        */
16   	/*  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. */
17   	/*  See the License for the specific language governing permissions and      */
18   	/*  limitations under the License.                                           */
19   	/*                                                                           */
20   	/*  You should have received a copy of the Apache-2.0 license                */
21   	/*  along with SCIP; see the file LICENSE. If not visit scipopt.org.         */
22   	/*                                                                           */
23   	/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
24   	
25   	/**@file   branch_leastinf.h
26   	 * @ingroup BRANCHINGRULES
27   	 * @brief  least infeasible LP branching rule
28   	 * @author Tobias Achterberg
29   	 *
30   	 * The least infeasible branching rule selects a candidate variable $j$ with fractional solution value \f$ \hat{x}_j\f$
31   	 * which maximizes
32   	 * \f[
33   	 *      \max \left\{ \lceil \hat{x}_j \rceil - \hat{x}_j, \hat{x}_j - \lfloor \hat{x}_j \rfloor  \right\}.
34   	 * \f]
35   	 * i. e., a variable which already is closest to being integral among all branching candidates.
36   	 *
37   	 * The least infeasible rule and many other branching rules of SCIP are explained and compared in
38   	 *
39   	 * @par
40   	 * Tobias Achterberg@n
41   	 * Constraint Integer Programming@n
42   	 * PhD Thesis, Technische Universität Berlin, 2007@n
43   	 */
44   	
45   	/*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
46   	
47   	#ifndef __SCIP_BRANCH_LEASTINF_H__
48   	#define __SCIP_BRANCH_LEASTINF_H__
49   	
50   	
51   	#include "scip/def.h"
52   	#include "scip/type_retcode.h"
53   	#include "scip/type_scip.h"
54   	
55   	#ifdef __cplusplus
56   	extern "C" {
57   	#endif
58   	
59   	/** creates the least infeasible LP branching rule and includes it in SCIP
60   	 *
61   	 *  @ingroup BranchingRuleIncludes
62   	 */
63   	SCIP_EXPORT
64   	SCIP_RETCODE SCIPincludeBranchruleLeastinf(
65   	   SCIP*                 scip                /**< SCIP data structure */
66   	   );
67   	
68   	#ifdef __cplusplus
69   	}
70   	#endif
71   	
72   	#endif
73