/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* 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_crossover.h * @ingroup PRIMALHEURISTICS * @brief LNS heuristic that tries to combine several feasible solutions * @author Timo Berthold * * Crossover is a large neighborhood search improvement heuristic that is inspired by genetic algorithms and requires * more than one feasible solution. For a set of feasible solutions, e.g., the three best found so far, it fixes * variables that take identical values in all of them and solves a corresponding sub-SCIP. See also @ref * heur_mutation.h */ /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/ #ifndef __SCIP_HEUR_CROSSOVER_H__ #define __SCIP_HEUR_CROSSOVER_H__ #include "scip/def.h" #include "scip/type_retcode.h" #include "scip/type_scip.h" #ifdef __cplusplus extern "C" { #endif /** creates the crossover primal heuristic and includes it in SCIP * * @ingroup PrimalHeuristicIncludes */ SCIP_EXPORT SCIP_RETCODE SCIPincludeHeurCrossover( SCIP* scip /**< SCIP data structure */ ); #ifdef __cplusplus } #endif #endif