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*/ 38 * @note the method can be applied in an iterative way, keeping the same subscip in between. If the @p freesubscip 39 * parameter is set to FALSE, the heuristic will keep the subscip data structures. Always set this parameter
SCIP_RETCODE SCIPincludeHeurProximity(SCIP *scip) 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: objbranchrule.h:33 SCIP_RETCODE SCIPdeleteSubproblemProximity(SCIP *scip) SCIP callable library. |