AEGISi: Attribute Experimentation Guiding Improvement Searches Inline Framework

The quality of a solution to an integer programming problem is a function of a number of elements. Lightly constrained problems are easier to solve than those with tighter constraints. Local search methods generally perform better than greedy methods. In the companion paper to this one, the authors investigated how peripheral information could be gathered and utilized to improve solving subsequent problems of the same type. In the current paper, they extend this to the dynamic environment – that is, utilizing such “peripheral” information as the solver is in progress, in order to determine how best to proceed.