HIGHLIGHTS
- who: Daniel Rehfeldt from the , Berlin, Germany have published the paper: Faster exact solution of sparse MaxCut and QUBO problems, in the Journal: (JOURNAL)
- what: The main focus lies on sparse problem instances although also dense ones can be solved. The focus of this article is mostly on MaxCut algorithms, but due to the just mentioned equivalence, all results can be (and indeed are) applied to QUBO as well. Among other things, the authors demonstrate how the separation of maximally violated constraints, which was 1 In the following, the authors propose a new reduction test . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.