Scippy

SCIP

Solving Constraint Integer Programs

Functions
heur_trivial.h File Reference
Primal Heuristics

Detailed Description

trivial primal heuristic

Author
Timo Berthold

pre-root heuristic that tries some trivial (but often feasibile) solutions: all variables at their upper bounds, all variables at their lower bounds, all variables zero, all variables at the bound with the fewer locks. This will, e.g., find a start solution for all pure set covering or set packing problems.

Definition in file heur_trivial.h.

#include "scip/scip.h"

Go to the source code of this file.

Functions

SCIP_RETCODE SCIPincludeHeurTrivial (SCIP *scip)
 

Function Documentation

SCIP_RETCODE SCIPincludeHeurTrivial ( SCIP *  scip)

creates the trivial primal heuristic and includes it in SCIP

Parameters
scipSCIP data structure

Definition at line 233 of file heur_trivial.c.

References HEUR_DESC, HEUR_DISPCHAR, HEUR_FREQ, HEUR_FREQOFS, HEUR_MAXDEPTH, HEUR_NAME, HEUR_PRIORITY, HEUR_TIMING, HEUR_USESSUBSCIP, NULL, SCIP_CALL, SCIP_OKAY, SCIPincludeHeurBasic(), and SCIPsetHeurCopy().

Referenced by SCIP_DECL_HEURCOPY(), and SCIPincludeDefaultPlugins().