1 citations · 1 across the 3 of their papers we have counts for
1 paper · 1 filter
Julien Weissenberg, Hayko Riemenschneider, Ralf Dragon +1
To tackle the exponentiality associated with NP-hard problems, two paradigms have been proposed. First, Branch & Bound, like Dynamic Programming, achieve efficient exact inference…