Graph-Aware Large Language Models for Combinatorial Optimization
This work proposes graph-aware hybrid approach that combines classical graph algorithms and Large Language Models (LLMs) to improve interpretability of the solutions for combinatorial optimization problems. The proposed framework is capable of solving such NP-hard problems as Traveling Salesman Problem (TSP), Graph Col...