Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs

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…