On the complexity of local search in unconstrained quadratic binary optimization
arXiv:math/0701184
Abstract
We consider the problem of finding a local minimum of a binary quadratic function, and show by an elementary construction that every descending local search algorithm takes exponential time in the worst case.
arXiv commentMinor update in 2016: simplified construction