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_lookahead.h 26 * @ingroup BRANCHINGRULES 27 * @brief lookahead LP branching rule 28 * @author Christoph Schubert 29 * @author Gerald Gamrath 30 * 31 * The (multi-level) lookahead branching rule applies strong branching to every fractional value of the LP solution 32 * at the current node of the branch-and-bound tree, as well as recursivly to every temporary child problem created by this 33 * strong branching. The rule selects the candidate with the best proven dual bound. 34 * 35 * The branching rule was motivated by the following technical report: 36 * 37 * @par 38 * Wasu Glankwamdee and Jeff Linderoth@n 39 * Lookahead Branching for Mixed Integer Programming@n 40 * Technical Report 06T-004, Department of Industrial and Systems Engineering, Lehigh University. 41 * 42 * For a more mathematical description and a comparison between lookahead branching and other branching rules 43 * in SCIP, we refer to 44 * 45 * @par 46 * Christoph Schubert@n 47 * Multi-Level Lookahead Branching@n 48 * Master Thesis, Technische Universität Berlin, 2017@n 49 */ 50 51 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/ 52 53 #ifndef __SCIP_BRANCH_LOOKAHEAD_H__ 54 #define __SCIP_BRANCH_LOOKAHEAD_H__ 55 56 57 #include "scip/def.h" 58 #include "scip/type_retcode.h" 59 #include "scip/type_scip.h" 60 61 #ifdef __cplusplus 62 extern "C" { 63 #endif 64 65 /** creates the lookahead branching rule and includes it in SCIP */ 66 SCIP_EXPORT 67 SCIP_RETCODE SCIPincludeBranchruleLookahead( 68 SCIP* scip /**< SCIP data structure */ 69 ); 70 71 #ifdef __cplusplus 72 } 73 #endif 74 75 #endif 76