Skip to Main content Skip to Navigation
Journal articles

Steepest ascent can be exponential in bounded treewidth problems

Abstract : We investigate the complexity of local search based on steepest ascent. We show that even when all variables have domains of size two and the underlying constraint graph of variable interactions has bounded treewidth (in our construction, treewidth 7), there are fitness landscapes for which an exponential number of steps may be required to reach a local optimum. This is an improvement on prior recursive constructions of long steepest ascents, which we prove to need constraint graphs of unbounded treewidth.
Document type :
Journal articles
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Thursday, July 2, 2020 - 3:16:34 PM
Last modification on : Wednesday, June 9, 2021 - 10:00:25 AM
Long-term archiving on: : Thursday, September 24, 2020 - 5:01:59 AM


Files produced by the author(s)



David Cohen, Martin Cooper, Artem Kaznatcheev, Mark Wallace. Steepest ascent can be exponential in bounded treewidth problems. Operations Research Letters, Elsevier, 2020, 48 (3), pp.217-224. ⟨10.1016/j.orl.2020.02.010⟩. ⟨hal-02887815⟩



Record views


Files downloads