Figure 4
From: A tree search algorithm towards solving Ising formulated combinatorial optimization problems
Benchmark results on square lattice graphs, circular ladder graphs and Mobius ladder graphs: (a) Epochs-to-solution of the the best reported result, and (b) success rate on square lattice graphs with different graph size. The targets of left sub figures are the exact solutions and of right figure are the approximate solutions given by SDP. (parameter used: \(\alpha =0.25, \beta =0.29\)). (c, d) are evaluate on circular ladder graphs, and (e, f) are evaluate on Mobius ladder graphs (\(\alpha =0.07, \beta =0.39\)).
