Menu
Vehicle routing (VRP, TSP, PDP) — problem types and data requirements. Domain concepts; no API or interface.
Install with Codex or Claude Copy this prompt, paste it into Codex, Claude, or another assistant, and let it review the skill page and install it for you.
Based on SOC occupation classification
| name | cuopt-routing-formulation |
| version | 26.08.00 |
| description | Vehicle routing (VRP, TSP, PDP) — problem types and data requirements. Domain concepts; no API or interface. |
| license | Apache-2.0 |
| metadata | {"author":"NVIDIA cuOpt Team","tags":["routing","vrp","tsp","formulation","concepts"]} |
Domain concepts for vehicle routing. No API or interface details here.
Ask these if not already clear:
Use for any question about a codebase, its architecture, file relationships, or project content — especially when graphify-out/ exists, where the question should be treated as a graphify query first. Turns any input (code, docs, papers, images, videos) into a persistent knowledge graph with god nodes, community detection, and query/path/explain tools.
Use when asked to run deep research or AI-Q research through a reachable NVIDIA AI-Q Blueprint backend.
Trace and interpret the Pareto frontier across competing objectives using repeated single-objective cuOpt solves (weighted-sum and ε-constraint).
LP, MILP, and QP (beta) with cuOpt — C API only. Use when the user is embedding LP, MILP, or QP in C/C++.
LP, MILP, and QP (beta) with cuOpt — CLI only (MPS files, cuopt_cli). Use when the user is solving LP, MILP, or QP from MPS via command line.
Solve LP, MILP, QP (beta) with cuOpt Python API — linear/quadratic objectives, integer variables, scheduling, portfolio, least squares.
