Fig. 2
From: Efficient bit labeling in factorization machines with annealing for traveling salesman problem
Local solution metric p for two labeling methods as a function of the number of cities, N. 10 different random configurations of N cities were generated and the average values with error bars were plotted. We sampled \(2^{\ell }\) cases for \(N \le 9\), and \(10^5\) random cases for \(N \ge 10\) in each configuration.
