/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* This file is part of the program and library */ /* SCIP --- Solving Constraint Integer Programs */ /* */ /* Copyright (C) 2002-2020 Konrad-Zuse-Zentrum */ /* fuer Informationstechnik Berlin */ /* */ /* SCIP is distributed under the terms of the ZIB Academic License. */ /* */ /* You should have received a copy of the ZIB Academic License */ /* along with SCIP; see the file COPYING. If not visit scipopt.org. */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /**@file branch_inference.h * @ingroup BRANCHINGRULES * @brief inference history branching rule * @author Tobias Achterberg * @author Timo Berthold * @author Stefan Heinz * * The inference history branching rule is based on the average number of deductions obtained after * branching this variable upwards and downwards. * Variables which cause many problem reductions are preferred since they are more likely to drive * the created sub-tree towards infeasibility. * Inference history of the variables is updated during the branch-and-bound search. * * For a more detailed description and a comparison between the inference rule and other branching rules * in SCIP, we refer to * * @par * Tobias Achterberg@n * Constraint Integer Programming@n * PhD Thesis, Technische Universität Berlin, 2007@n * */ /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/ #ifndef __SCIP_BRANCH_INFERENCE_H__ #define __SCIP_BRANCH_INFERENCE_H__ #include "scip/def.h" #include "scip/type_retcode.h" #include "scip/type_scip.h" #ifdef __cplusplus extern "C" { #endif /** creates the inference history branching rule and includes it in SCIP * * @ingroup BranchingRuleIncludes */ SCIP_EXPORT SCIP_RETCODE SCIPincludeBranchruleInference( SCIP* scip /**< SCIP data structure */ ); #ifdef __cplusplus } #endif #endif