Despite exceptional capabilities in knowledge-intensive tasks, Large Language Models (LLMs) face a critical gap in understanding how they internalize new knowledge, particularly how to structurally ...

Abstract: Traveling salesman problem (TSP) is a combinatorial optimization problem, serving as basis for many real-world applications (e.g., transportation planning, circuit board design, and DNA ...

Abstract: In the realm of combinatorial optimization, the Multiple Traveling Salesman Problem (MTSP) presents a unique challenge by requiring optimal routes for multiple salesmen. This study ...