On the complexity of local search in unconstrained quadratic binary optimization
Optimization and Control
2016-05-16 v2
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.
Cite
@article{arxiv.math/0701184,
title = {On the complexity of local search in unconstrained quadratic binary optimization},
author = {Dávid Papp},
journal= {arXiv preprint arXiv:math/0701184},
year = {2016}
}
Comments
Minor update in 2016: simplified construction