Improvement heuristic that alters single variable values.
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.
|SCIP_RETCODE||SCIPincludeHeurOneopt (SCIP *scip)|