Solving weighted MaxCut with QUBO
I would like to solve the MaxCut problem for a weighted graph.
For this I already use the functions from https://docs.ocean.dwavesys.com/projects/dwave-networkx/en/latest/reference/algorithms/max_cut.html.
However, these use the Ising Model in the background and partially do not provide me with the optimal solutions.
Now I would like to solve the problem with the QUBO model.
For this I currently use the approach of: https://github.com/dwave-examples/maximum-cut.
My problem is that I do not know how to create a QUBO for a weighted graph.
It would be great if someone has some advice or hint for me.
Thanks a lot!