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 heur_feaspump.h 26 * @ingroup PRIMALHEURISTICS 27 * @brief Objective Feasibility Pump 2.0 28 * @author Timo Berthold 29 * @author Domenico Salvagnin 30 * 31 * The fundamental idea of the Feasibility Pump is to construct two sequences of points which hopefully converge to a 32 * feasible solution. One sequence consists of LP-feasiblepoints, the other one of integer feasible points. They are 33 * produced by alternately rounding an LP-feasible point and solvng an LP that finds a point on the LP polyhedron which 34 * is closest to the rounded, integral point (w.r.t. Manhattan distance). 35 * 36 * The version implemented in SCIP supports using an Objective Feasibility Pump that uses a convex combination of the 37 * Manhattan distance and the original LP objective for reoptimization. It further features Feasibility Pump 2.0 38 * capabilities, hence propagating the fixings for a faster convergence. 39 */ 40 41 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/ 42 43 #ifndef __SCIP_HEUR_FEASPUMP_H__ 44 #define __SCIP_HEUR_FEASPUMP_H__ 45 46 #include "scip/def.h" 47 #include "scip/type_retcode.h" 48 #include "scip/type_scip.h" 49 50 #ifdef __cplusplus 51 extern "C" { 52 #endif 53 54 /** creates the feaspump primal heuristic and includes it in SCIP 55 * 56 * @ingroup PrimalHeuristicIncludes 57 */ 58 SCIP_EXPORT 59 SCIP_RETCODE SCIPincludeHeurFeaspump( 60 SCIP* scip /**< SCIP data structure */ 61 ); 62 63 #ifdef __cplusplus 64 } 65 #endif 66 67 #endif 68