1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
/* */
/* This file is part of the program and library */
/* SCIP --- Solving Constraint Integer Programs */
/* */
/* Copyright 2002-2022 Zuse Institute Berlin */
/* */
/* Licensed under the Apache License, Version 2.0 (the "License"); */
/* you may not use this file except in compliance with the License. */
/* You may obtain a copy of the License at */
/* */
/* http://www.apache.org/licenses/LICENSE-2.0 */
/* */
/* Unless required by applicable law or agreed to in writing, software */
/* distributed under the License is distributed on an "AS IS" BASIS, */
/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. */
/* See the License for the specific language governing permissions and */
/* limitations under the License. */
/* */
/* You should have received a copy of the Apache-2.0 license */
/* along with SCIP; see the file LICENSE. If not visit scipopt.org. */
/* */
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
/**@file branch_lookahead.h
* @ingroup BRANCHINGRULES
* @brief lookahead LP branching rule
* @author Christoph Schubert
* @author Gerald Gamrath
*
* The (multi-level) lookahead branching rule applies strong branching to every fractional value of the LP solution
* at the current node of the branch-and-bound tree, as well as recursivly to every temporary child problem created by this
* strong branching. The rule selects the candidate with the best proven dual bound.
*
* The branching rule was motivated by the following technical report:
*
* @par
* Wasu Glankwamdee and Jeff Linderoth@n
* Lookahead Branching for Mixed Integer Programming@n
* Technical Report 06T-004, Department of Industrial and Systems Engineering, Lehigh University.
*
* For a more mathematical description and a comparison between lookahead branching and other branching rules
* in SCIP, we refer to
*
* @par
* Christoph Schubert@n
* Multi-Level Lookahead Branching@n
* Master Thesis, Technische Universität Berlin, 2017@n
*/
/*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
#ifndef __SCIP_BRANCH_LOOKAHEAD_H__
#define __SCIP_BRANCH_LOOKAHEAD_H__
#include "scip/def.h"
#include "scip/type_retcode.h"
#include "scip/type_scip.h"
#ifdef __cplusplus
extern "C" {
#endif
/** creates the lookahead branching rule and includes it in SCIP */
SCIP_EXPORT
SCIP_RETCODE SCIPincludeBranchruleLookahead(
SCIP* scip /**< SCIP data structure */
);
#ifdef __cplusplus
}
#endif
#endif