heur_proximity.h
Go to the documentation of this file.
18 * @brief improvement heuristic which uses an auxiliary objective instead of the original objective function which
19 * is itself added as a constraint to a sub-SCIP instance. The heuristic was presented by Matteo Fischetti
24 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
55 * @note the method can be applied in an iterative way, keeping the same subscip in between. If the @p freesubscip
56 * parameter is set to FALSE, the heuristic will keep the subscip data structures. Always set this parameter
SCIP_EXPORT SCIP_RETCODE SCIPincludeHeurProximity(SCIP *scip)
Definition: heur_proximity.c:1022
Definition: struct_scip.h:59
type definitions for return codes for SCIP methods
type definitions for primal heuristics
type definitions for SCIP's main datastructure
Definition: struct_heur.h:88
result codes for SCIP callback methods
common defines and data types used in all packages of SCIP
SCIP_EXPORT SCIP_RETCODE SCIPdeleteSubproblemProximity(SCIP *scip)
Definition: heur_proximity.c:642
Definition: objbenders.h:33
SCIP_EXPORT SCIP_RETCODE SCIPapplyProximity(SCIP *scip, SCIP_HEUR *heur, SCIP_RESULT *result, SCIP_Real minimprove, SCIP_Longint nnodes, SCIP_Longint nlpiters, SCIP_Longint *nusednodes, SCIP_Longint *nusedlpiters, SCIP_Bool freesubscip)
Definition: heur_proximity.c:669