Traveling Salesman Problem (TSP) Graph Data / Traveling Salesman Problem (TSP) Graph Data

분야: 금융/최적화 · 데이터 유형: 그래프/네트워크 데이터 · ADVANCED

Graph dataset for solving Traveling Salesman Problem (TSP) using quantum optimization algorithms. Includes TSP instances with various numbers of cities (5-20), suitable for QAOA and quantum annealing algorithm testing.

Usage / 사용 가이드

Use this dataset in the QAOA code from Algorithm Hub to solve TSP problems finding the shortest path. Suitable for advanced experiments solving practical optimization problems using quantum algorithms.