TSP (Traveling Salesman Problem)
I'm working on a problem which can be transform to the TSP, so I want to using D-Wave to solve it. But the API you provide(https://docs.ocean.dwavesys.com/en/latest/docs_dnx/reference/algorithms/tsp.html) is only for small-scale TSP with the classical Solver not quantum Solver.
I want to know if a TSP with around 40 nodes can be solved by a Quantum Annealer. If could, can anyone provide some more detailed materials, such as websites, demos, or codes......
Many thanks in advance.