Steepest ascent can be exponential in bounded treewidth problems - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Operations Research Letters Année : 2020

Steepest ascent can be exponential in bounded treewidth problems

Résumé

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.
Fichier principal
Vignette du fichier
Cohen_26375.pdf (269.42 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02887815 , version 1 (02-07-2020)

Identifiants

Citer

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

Altmetric

Partager

Gmail Facebook X LinkedIn More