TSPLIB
Emerging3papers using it
2024first seen
TSPLIB is a benchmark library that contains a collection of instances for various combinatorial optimization problems, including the Traveling Salesman Problem, used to evaluate and compare the performance of algorithms.
Papers using TSPLIB (3)
- MViewRouter: Internalizing Geometric Equivariance via Multi-view Alternating Attention for Combinatorial RoutingConstruct, Merge, Solve & Adapt with Reinforcement Learning for the min-max Multiple Traveling Salesman ProblemSolving the QAP by Two-Stage Graph Pointer Networks and Reinforcement
Learning