SkillsBench is a benchmark for measuring how effectively AI agents use modular skills—folders containing instructions, scripts, and resources—to complete specialized tasks. It helps researchers and developers evaluate both skill quality and agent behavior, including tasks that require combining multiple skills. The catalogue’s skills and instructions are evaluated as part of this workflow.
Getting it into your agent
One page per mod, every tool's command on it. A separate URL per tool would split the same page into five that compete with each other.
npx skills add benchflow-ai/skillsbench --skill routing-subtour-eliminationgit clone --depth 1 https://github.com/benchflow-ai/skillsbenchWrote this? Show the measurements
A badge with what this costs and how it scanned, read live from this page, so it follows the numbers instead of freezing them. Markdown for a README, HTML for a documentation site or a project page.
[](https://agentmods.dev/skills/benchflow-ai/skillsbench/routing-subtour-elimination)<a href="https://agentmods.dev/skills/benchflow-ai/skillsbench/routing-subtour-elimination"><img src="https://agentmods.dev/badge/skills/benchflow-ai/skillsbench/routing-subtour-elimination/github.svg" alt="Measured on agentmods" height="20"></a>Or the 80×15 button, for a site that already has a row of RSS and ATOM ones. Only the verdict fits; the numbers stay here.
<a href="https://agentmods.dev/skills/benchflow-ai/skillsbench/routing-subtour-elimination"><img src="https://agentmods.dev/badge/skills/benchflow-ai/skillsbench/routing-subtour-elimination.svg" alt="Reviewed on agentmods" width="80" height="20"></a>- NVIDIA SkillSpector pass
What it costs to keep this loaded
Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.
| Model | Per session | Once invoked |
|---|---|---|
| Fable 5.1 | $0.00070 | $0.02140 |
| Opus 5 | $0.00035 | $0.01070 |
| Sonnet 5 | $0.00014 | $0.00428 |
| Haiku 4.5 | $0.00007 | $0.00214 |
Grade A, and why
routing-subtour-elimination scanned grade A with 0 findings against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured 12d ago.
A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.
Nothing flagged
None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.
Copies of this mod
3 near-identical copies found in the catalogue:
- routing-subtour-elimination — 100% identical, 0 lines differ
- routing-subtour-elimination — 100% identical, 0 lines differ
- routing-subtour-elimination — 100% identical, 0 lines differ
How it starts
The opening of the file, as written. The whole thing — 256 lines — stays where its author put it; the contents beside it link to each section on GitHub.
Routing Subtour Elimination
In routing MIPs, degree and continuity constraints are not enough. A vehicle can have one depot-to-depot path and a separate closed cycle among stations. Add subtour-elimination constraints whenever binary arc variables decide routes.
Use this base notation:
START = "depot_start"
END = "depot_end"
vehicles = range(K)
stations = range(n)
from_nodes = [START, *stations]
to_nodes = [*stations, END]
arcs = [(i, j) for i in from_nodes for j in to_nodes if i != j and not (i == START and j == END)]
x = {(v, i, j): model.addVar(vtype="B", name=f"x_{v}_{i}_{j}") for v in vehicles for i, j in arcs}
Required Base Route Constraints
Subtour elimination assumes each selected station has matching inbound and outbound route arcs.
for v in vehicles:
model.addCons(quicksum(x[v, START, j] for j in stations) == 1)
model.addCons(quicksum(x[v, i, END] for i in stations) == 1)
for i in stations:
incoming = quicksum(x[v, j, i] for j in from_nodes if j != i)
outgoing = quicksum(x[v, i, j] for j in to_nodes if j != i)
model.addCons(incoming == outgoing)
model.addCons(outgoing <= 1)
The subtour methods below prevent station-only cycles that are disconnected from START.
1. MTZ Order Constraints
MTZ adds an order variable for each vehicle-station pair. If vehicle v travels from station i to station j, then order[v, j] must be greater than order[v, i].
order = {
(v, i): model.addVar(vtype="C", lb=1, ub=max(1, n), name=f"order_{v}_{i}")
for v in vehicles
for i in stations
}
for v in vehicles:
for i in stations:
for j in stations:
if i != j:
model.addCons(order[v, i] - order[v, j] + n * x[v, i, j] <= n - 1)
Pros:
- Compact:
O(K n^2)constraints andO(K n)extra variables. - Easy to implement in common Python optimization APIs.
- Good default for small and medium benchmark instances.
Cons:
- LP relaxation is weak compared with cutset or flow formulations.
- Can be slow for larger VRPs.
- Order variables are artificial; do not interpret them as service times unless you also model time.
What this file has done since we first saw it
Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.
- 12d ago First seen · 256 lines · 70 tokens per session scan A 211306948184
routing-subtour-elimination is a skill published in the GitHub repository benchflow-ai/skillsbench (1,760 stars, last pushed 1mo ago), licensed Apache-2.0. It adds 70 tokens to every session and 2,140 once invoked, about $0.0003 per session on Opus 5. A static security scan graded it A with 0 findings. No closer match exists in the catalogue, so it is treated as the original; first seen 2026-08-30.
Other skills, from other repositories
run-aeon-benchmark
Use when asked to run, benchmark, evaluate, or score an LLM with AEON Bench. You run the AEON Bench Pod on the user's machine, point it at a model, run the benchmark, and submit the signed result to the public leaderboard at aeon-bench.com. All work happens on the pod. The mothership only shows the board and accepts…
data-matching
Matching observation data to simulation output with exact datetime and depth binning.
model-calibration
Calculating RMSE metrics and parameter calibration for lake model validation.
dbscan-custom-metric
Run DBSCAN clustering with a custom distance metric using sklearn, including how to define weighted Euclidean metrics and extract cluster centroids.
greedy-bipartite-matching
Implement greedy bipartite matching for pairing cluster centroids with expert annotations.
plate-tectonics-geospatial
Analyze plate tectonics data using GeoPandas, identify points within plates, and calculate distances to boundaries.