Solving the Traveling Salesman Problem using Concorde, CuOpt, Gurobi and approximations using neural networks
-
Updated
Jul 13, 2026 - Python
Solving the Traveling Salesman Problem using Concorde, CuOpt, Gurobi and approximations using neural networks
Scheduling with MILP using cuOpt example
Agentic multilingual municipal-services triage for Singapore on NVIDIA Nemotron NIM + cuOpt.
Add a description, image, and links to the cuopt topic page so that developers can more easily learn about it.
To associate your repository with the cuopt topic, visit your repo's landing page and select "manage topics."