Thinklab-SJTU/UniCO
[ICLR 2025] UniCO: On Unified Combinatorial Optimization via Problem Reduction to Matrix-Encoded General TSP
This project helps operations managers, logisticians, or supply chain analysts solve complex routing and scheduling problems by transforming them into a standard Traveling Salesperson Problem (TSP) format. You provide a "distance matrix" — a table showing the cost or time to go from any point to any other point — and it outputs an optimized route. This is designed for anyone needing to find the most efficient sequence of stops or tasks in a scenario with many constraints or unusual "distances" between points.
No commits in the last 6 months.
Use this if you need to solve various combinatorial optimization challenges, like vehicle routing, job scheduling, or even logical satisfiability, by converting them into a generalized Traveling Salesperson Problem (TSP) format.
Not ideal if your problems always involve standard Euclidean distances on a 2D map, as this tool is specifically designed for more complex, non-metric, or asymmetric 'distance' scenarios.
Stars
15
Forks
1
Language
Python
License
—
Category
Last pushed
Jun 20, 2025
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/Thinklab-SJTU/UniCO"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
aimclub/SAMPO
Open-source framework for adaptive manufacturing processes scheduling
pdrm83/py2opt
How to solve the traveling salesman problem with the 2-opt algorithm, a fast heuristic search algorithm.
yining043/TSP-improve
An improvement-based Deep Reinforcement Learning Algorithm presented in paper...
albert-espin/knapsack-packing
Evolutionary Algorithm for the 2D Packing Problem combined with the 0/1 Knapsack Problem (Master Thesis)
rithinch/pareto-optimal-student-supervisor-allocation
🎓An AI tool to assist universities with optimal allocation of students to supervisors for their...