Results for “route-optimization”

Recommends the optimal Claude model tier (Opus, Sonnet, or Haiku) for a given task by analyzing reasoning depth, blast radius, domain expertise, output length, and correctness cost, and suggests parallelization opportunities.

Auto-routes Claude Code subtasks to the cheapest capable model (Haiku/Sonnet/Opus), logs token costs, and A/B tests tiers to validate savings against real workloads.

Solve vehicle routing problems (TSP, VRP, PDP) using NVIDIA cuOpt's Python API with cost matrices, time windows, capacity constraints, and pickup-delivery pairs.

Routes NuRec/Neural Reconstruction requests to the correct upstream NVIDIA skill (datasets, conversion, training, rendering, object harvesting, frame cleanup).

Designs and governs recursive self-improvement loops where an agent mines its own failures and proposes edits to its own harness, prompts, or workflow, covering acceptance gates, diversity preservation, and the optimization ladder.