Efficient bit labeling in factorization machines with annealing for traveling salesman problem

This study treats the TSP with FMA; therefore, any variables in the TSP must be redescribed by binary variables only. This section explains the labeling methods for converting TSP route \(\textbf{r}\) into single- bit sequence \(\textbf{b}\). In a…