Solving Constraint Integer Programs

heur_oneopt.h File Reference

Detailed Description

Improvement heuristic that alters single variable values.

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.


SCIP_RETCODE SCIPincludeHeurOneopt (SCIP *scip)

Function Documentation

SCIP_RETCODE SCIPincludeHeurOneopt ( SCIP scip)

creates the oneopt primal heuristic and includes it in SCIP

scipSCIP data structure