Concept最大割问题
Max-Cut
A classic NP-hard combinatorial optimization problem in graph theory. The goal is to partition the vertices of a graph into two sets so that the sum of the weights of the edges crossing between the two sets is maximized.
Timeline (last 90 days)
Oct 12
vq-logics-opt/bsb_solver.py implements ballistic simulated bifurcation (bSB), a classical algorithm inspired by quantum adiabatic evolution, which outperforms standard greedy heuristics on Max-Cut and QUBO problems.
Unverified50%