All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
heur_twoopt.h
Go to the documentation of this file.
22 * The Twoopt heuristic attempts to improve a feasible MIP solution by altering the solution values of pairs of
23 * variables. Only variables which share a pre-defined ratio of LP rows are considered as pairs. Each step of the
24 * heuristic consists of improving the objective value by shifting one variable, and then compensating the resulting
25 * infeasibilities by shifting a second variable, without completely losing the objective improvement. Similarly to
26 * Oneopt (see @ref heur_oneopt.h), pairs are processed in non-decreasing order of their impact on the objective.
|