Steepest ascent can be exponential in bounded treewidth problems

DOI10.1016/j.orl.2020.02.010OpenAlexW2990526839WikidataQ115568194 ScholiaQ115568194MaRDI QIDQ2183191

Yanyan Li

Publication date: 26 May 2020

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.08600

zbMATH Keywords

local searchfitness landscapelong pathbounded treewidthsteepest ascentVCSP

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Related Items (1)

Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search

Uses Software

• Python

Cites Work

• Computing equilibria: a computational complexity perspective
• Nonserial dynamic programming
• Adaptation on Rugged Landscapes

This page was built for publication: Steepest ascent can be exponential in bounded treewidth problems