Steepest ascent can be exponential in bounded treewidth problems.

David A. Cohen Martin C. Cooper Artem Kaznatcheev Mark Wallace

Published in: Oper. Res. Lett. (2020)

Keyphrases

np complete
bounded treewidth
highly parallelizable
special case
machine learning
structured data
databases
prior knowledge
utility function
tractable cases
steepest ascent