22 citations · 34 across the 7 of their papers we have counts for
1 paper · 1 filter
Sebastian Lamm, Christian Schulz, Darren Strash +2
One powerful technique to solve NP-hard optimization problems in practice is branch-and-reduce search---which is branch-and-bound that intermixes branching with reductions to decre…