UniCO: On Unified Combinatorial Optimization via Problem Reduction to Matrix-Encoded General TSP

Various neural solvers have been devised for combinatorial optimization (CO), which are often tailored for specific problem types, e.g. TSP, HCP and SAT, etc. Yet, it remains an open question how to achieve universality regarding problem representing and learning with a general framework.