1 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ 2 /* */ 3 /* This file is part of the program and library */ 4 /* SCIP --- Solving Constraint Integer Programs */ 5 /* */ 6 /* Copyright (C) 2002-2021 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 visit scipopt.org. */ 13 /* */ 14 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ 15 16 /**@file heur_intshifting.h 17 * @ingroup PRIMALHEURISTICS 18 * @brief LP rounding heuristic that tries to recover from intermediate infeasibilities, shifts integer variables, and 19 * solves a final LP to calculate feasible values for continuous variables 20 * @author Tobias Achterberg 21 * 22 * This heuristic is similar to the Shifting heuristic (see @ref heur_shifting.h), but it ignores continuous variables 23 * during the shifting phase and solves a final LP to find feasible (and optimal w.r.t. the integer fixings) values for 24 * the continuous variables. 25 */ 26 27 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/ 28 29 #ifndef __SCIP_HEUR_INTSHIFTING_H__ 30 #define __SCIP_HEUR_INTSHIFTING_H__ 31 32 #include "scip/def.h" 33 #include "scip/type_retcode.h" 34 #include "scip/type_scip.h" 35 36 #ifdef __cplusplus 37 extern "C" { 38 #endif 39 40 /** creates the intshifting heuristic and includes it in SCIP 41 * 42 * @ingroup PrimalHeuristicIncludes 43 */ 44 SCIP_EXPORT 45 SCIP_RETCODE SCIPincludeHeurIntshifting( 46 SCIP* scip /**< SCIP data structure */ 47 ); 48 49 #ifdef __cplusplus 50 } 51 #endif 52 53 #endif 54