agentmods.dev

set-covering-problem

set-covering-problem is a skill for Claude Code from kishorkukreja/awesome-supply-chain. It costs 98 tokens per session (7,390 once invoked), scanned A, original, MIT.

A guide to selecting the smallest or least costly group of locations or resources that covers required customers, areas, or other elements. Coverage can mean being within a distance or time limit, for example.

In plain words
What is it for?
Use it to plan facility locations, service areas, emergency coverage, resource allocation, and coverage requirements with distance or redundancy rules.
Why use it?
It turns broad coverage goals into a concrete placement decision. It can also handle partial coverage, priorities, and backup coverage when full coverage is too expensive.

Skill for Claude Code

Written for Claude Code: shipped in a Claude Code plugin.

Part of the supply-chain-skills plugin — 133 skills shipped together , and of supply-chain-skills

not rated 67repo +2 12d ago A scan SkillSpector: pass 98 tokens original MIT

Good fit Use it to plan facility locations, service areas, emergency coverage, resource allocation, and coverage requirements with distance or redundancy rules.

Compare 6 skills from other repositories ↓
Install with agentmods
npx agentmods add skills/kishorkukreja/awesome-supply-chain/set-covering-problem
View source ↗ kishorkukreja/awesome-supply-chain
Install

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.

Any agent
npx skills add kishorkukreja/awesome-supply-chain --skill set-covering-problem
Clone the repo
git clone --depth 1 https://github.com/kishorkukreja/awesome-supply-chain

Made for: Claude Code.

Or install supply-chain-skills, the plugin that ships this one along with the rest of its 133 skills.

Wrote 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.

agentmods badge for set-covering-problem

README.md
[![agentmods](https://agentmods.dev/badge/skills/kishorkukreja/awesome-supply-chain/set-covering-problem/github.svg)](https://agentmods.dev/skills/kishorkukreja/awesome-supply-chain/set-covering-problem)
Your own site
<a href="https://agentmods.dev/skills/kishorkukreja/awesome-supply-chain/set-covering-problem"><img src="https://agentmods.dev/badge/skills/kishorkukreja/awesome-supply-chain/set-covering-problem/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.

agentmods 80×15 button for set-covering-problem

Your own site · 80×15
<a href="https://agentmods.dev/skills/kishorkukreja/awesome-supply-chain/set-covering-problem"><img src="https://agentmods.dev/badge/skills/kishorkukreja/awesome-supply-chain/set-covering-problem.svg" alt="Reviewed on agentmods" width="80" height="20"></a>
Per session 98 Skills are progressive disclosure: only the name and description are preloaded; the body loads when the skill is used.
When invoked 7,390 The whole file, excluding the scripts and references it only reads on demand.
Security scan A 0 findings. A grade says what 26 rules found in the file — not that it is safe. Third-party audits
  • NVIDIA SkillSpector pass 7 Sept 2026
How audits are shown
Origin original No closer match found in the catalogue.
Token cost

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.

ModelPer sessionOnce invoked
Fable 5.1 $0.00098 $0.07390
Opus 5 $0.00049 $0.03695
Sonnet 5 $0.00020 $0.01478
Haiku 4.5 $0.00010 $0.00739

Measured 9d ago against content hash 42dba84ff467, method: parsed. Prices are Anthropic first-party input rates as of 2026-09-12, from the pricing page.

Security

Grade A, and why

set-covering-problem 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 9d 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.

skills/set-covering-problem/SKILL.md · 953 lines

How it starts

The opening of the file, as written. The whole thing — 953 lines — stays where its author put it; the contents beside it link to each section on GitHub.

Set Covering Problem

You are an expert in set covering problems and coverage-based optimization. Your goal is to help find the minimum cost collection of sets (or facilities) that covers all required elements (or customers), commonly used for facility location, service coverage, and resource allocation problems.

Initial Assessment

Before solving set covering problems, understand:

  1. Problem Type

    • Set Covering Problem (SCP)? (cover all elements with minimum cost)
    • Maximal Covering Location Problem (MCLP)? (maximize covered demand with limited resources)
    • Location Set Covering Problem (LSCP)? (minimum facilities for full coverage)
    • Partial Set Covering? (cover a percentage of elements)
    • Redundant Coverage? (elements covered multiple times)

  2. Coverage Requirements

    • Must cover all elements? (100% coverage)
    • Partial coverage acceptable? (e.g., 95%)
    • Coverage distance/time threshold?
    • Redundancy requirements? (backup coverage)
    • Quality of coverage (single vs. multiple cover)?

  3. Elements to Cover

    • What needs to be covered? (customers, demand points, areas)
    • How many elements?
    • Weights/priorities for elements?
    • Geographic locations?
    • Time-dependent coverage needs?

  4. Coverage Sets/Facilities

    • How many potential covering sets/facilities?
    • Cost structure? (fixed costs, variable costs)
    • Coverage radius or service area?
    • Capacity constraints?
    • Can sets/facilities overlap in coverage?

  5. Objectives

    • Minimize number of facilities?
    • Minimize total cost?
    • Maximize covered demand (with budget)?
    • Balance coverage and cost?
    • Ensure redundancy for reliability?

Set Covering Problem Framework

Problem Variants

1. Basic Set Covering Problem (SCP)

  • Goal: Cover all elements with minimum cost
  • Constraint: Every element must be covered at least once
  • Application: Emergency service location, sensor placement

2. Location Set Covering Problem (LSCP)

  • Goal: Minimize number of facilities for full coverage
  • Constraint: All demand points within coverage distance
  • Application: Fire station, ambulance location

Read the full file on GitHub · 953 lines

Changes

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.

  1. 9d ago First seen · 953 lines · 98 tokens per session scan A 42dba84ff467

Subscribe to this mod's changes

set-covering-problem is a skill published in the GitHub repository kishorkukreja/awesome-supply-chain (67 stars, last pushed 12d ago), licensed MIT. It adds 98 tokens to every session and 7,390 once invoked, about $0.0005 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-09-03.

Planning
Related

Other skills, from other repositories

systematic-debugging

Use when encountering any bug, test failure, or unexpected behavior, before proposing fixes.

obra/superpowers · 21 tokens

local-ai-agents

Build local-first AI agents that run entirely on a developer workstation with Microsoft Foundry Local and Qwen function-calling models. Covers Small Language Models (SLMs), the OpenAI-compatible local endpoint, sandboxed local tools, local RAG with Chroma, local MCP servers, hybrid cloud/local routing, and the…

microsoft/ai-agents-for-beginners · 200 tokens

next-cache-components-adoption

Turn on Cache Components in a Next.js app and resolve the blocking routes it surfaces. Use when the user wants to enable, adopt, or migrate to Cache Components, flip the cacheComponents flag, work through a flood of blocking-prerender / instant validation errors, run the cache-components-instant-false codemod, or…

vercel/next.js · 95 tokens

chat-pet-sprite-creation

Use when creating or changing VS Code chat pet sprite art, sprite sheets, state animations, eye treatments, Stable/Insiders variants, or pet transitions under src/vs/workbench/contrib/chat/browser/widget/media/chatPet.

microsoft/vscode · 53 tokens

cpu-profile-analysis

Analyze V8/Chrome CPU profiles (.cpuprofile) and DevTools trace files (Trace-.json). Use when: profiling performance, investigating slow functions, comparing code paths, finding bottlenecks, analyzing timeToRequest, understanding call trees from sampling profiler data, analyzing layout/paint/rendering, investigating…

microsoft/vscode · 71 tokens

insight-error-page

Write or audit an insight-kind error page for the Next.js dev overlay. Use when creating a new errors/ .mdx page, auditing an existing one, or checking that a page matches the framework fix cards. Covers page structure, title alignment, FixCard cards with Copy prompt button, code snippets, terminology verification…

vercel/next.js · 83 tokens