Scippy

SCIP

Solving Constraint Integer Programs

Functions
heur_oneopt.h File Reference
Primal Heuristics

Detailed Description

Improvement heuristic that alters single variable values.

Author
Timo Berthold

Oneopt is a straightforward improvement heuristic: given a feasible MIP solution, the value of an integer variable xj can be decreased for cj > 0 or increased for cj < 0 if the resulting solution is still feasible. If more than one variable can be shifted, they are sorted by non-decreasing impact on the objective and sequentially shifted until no more improvements can be obtained.

Definition in file heur_oneopt.h.

#include "scip/scip.h"

Go to the source code of this file.

Functions

SCIP_RETCODE SCIPincludeHeurOneopt (SCIP *scip)
 

Function Documentation

SCIP_RETCODE SCIPincludeHeurOneopt ( SCIP *  scip)

creates the oneopt primal heuristic and includes it in SCIP

Parameters
scipSCIP data structure

Definition at line 834 of file heur_oneopt.c.

References DEFAULT_BEFOREPRESOL, DEFAULT_DURINGROOT, DEFAULT_FORCELPCONSTRUCTION, DEFAULT_WEIGHTEDOBJ, 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(), SCIPsetHeurInitsol(), and TRUE.

Referenced by SCIP_DECL_HEURCOPY(), and SCIPincludeDefaultPlugins().