/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* 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 heur_repair.h * @ingroup PRIMALHEURISTICS * @brief repair primal heuristic * @author Gregor Hendel * @author Thomas Nagel * * repair is a large neighborhood search heuristic, which starts with an infeasible solution and tries to repair it. This can happen by variable fixing as long as the sum of all potential possible shiftings is higher than alpha*slack or slack variables with a strong penalty on the objective function. */ /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/ #ifndef __SCIP_HEUR_REPAIR_H__ #define __SCIP_HEUR_REPAIR_H__ #include "scip/def.h" #include "scip/type_retcode.h" #include "scip/type_scip.h" #ifdef __cplusplus extern "C" { #endif /** creates the repair primal heuristic and includes it in SCIP * * @ingroup PrimalHeuristicIncludes */ SCIP_EXPORT SCIP_RETCODE SCIPincludeHeurRepair( SCIP* scip /**< SCIP data structure */ ); #ifdef __cplusplus } #endif #endif