heur_twoopt.h
Go to the documentation of this file.
31 * The Twoopt heuristic attempts to improve a feasible MIP solution by altering the solution values of pairs of
32 * variables. Only variables which share a pre-defined ratio of LP rows are considered as pairs. Each step of the
33 * heuristic consists of improving the objective value by shifting one variable, and then compensating the resulting
34 * infeasibilities by shifting a second variable, without completely losing the objective improvement. Similarly to
35 * Oneopt (see @ref heur_oneopt.h), pairs are processed in non-decreasing order of their impact on the objective.
38 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
Definition: struct_scip.h:68
type definitions for return codes for SCIP methods
type definitions for SCIP's main datastructure
common defines and data types used in all packages of SCIP
Definition: objbenders.h:43