Scippy

SCIP

Solving Constraint Integer Programs

Functions
heur_cycgreedy.h File Reference
Public API of SCIP » Plugin API of SCIP » Primal Heuristics

Detailed Description

Greedy primal heuristic. States are assigned to clusters iteratively. At each iteration all possible assignments are computed and the one with the best change in objective value is selected.

Author
Leon Eifler

Definition in file heur_cycgreedy.h.

#include "scip/scip.h"

Go to the source code of this file.

Functions

SCIP_EXPORT SCIP_RETCODE SCIPincludeHeurCycGreedy (SCIP *scip)
 

Function Documentation

◆ SCIPincludeHeurCycGreedy()

SCIP_EXPORT SCIP_RETCODE SCIPincludeHeurCycGreedy ( SCIP *  scip)

creates the CycGreedy primal heuristic and includes it in SCIP

creates the CycGreedy - primal heuristic and includes it in SCIP

Parameters
scipSCIP data structure

Definition at line 598 of file heur_cycgreedy.c.

References FALSE, HEUR_DESC, HEUR_DISPCHAR, HEUR_FREQ, HEUR_FREQOFS, HEUR_MAXDEPTH, HEUR_NAME, HEUR_PRIORITY, HEUR_TIMING, HEUR_USESSUBSCIP, NULL, SCIP_CALL, SCIP_OKAY, SCIPaddBoolParam(), SCIPallocMemory, SCIPincludeHeurBasic(), SCIPsetHeurCopy(), SCIPsetHeurExitsol(), SCIPsetHeurFree(), SCIPsetHeurInit(), and TRUE.

Referenced by SCIP_DECL_HEURCOPY(), and SCIPincludeCycPlugins().