scip-opt
SCIP optimization with PySCIPOpt
Install / Use
npx skills add benchflow-ai/skillsbench --skill scip-optInstalls into whichever agent you are using.
SKILL.md
Installable skill definition
Quality Score
Category
Development & EngineeringSupported Platforms
Our assessment of scip-opt
scip-opt scores 81/100 on our quality scale, 3476th of 4,700 Development & Engineering skills we index.
Its SKILL.md is 6.9 KB long, well organised into 12 sections with 9 code examples: a thorough specification that gives an agent plenty to work with.
With 1,813 GitHub stars, it is one of the more widely adopted skills in the catalogue.
Maintenance, license and trust
- The repository was last updated about 4 months ago. That is recent enough to be usable, but agent tooling moves fast, so check the instructions against your agent's current version.
- Our last check on 2026-11-08 found the source still online.
- It is released under the Apache-2.0 license, a permissive license that allows use, modification and commercial use with attribution.
- Its trust signals score 98/100, with no cautions. These come from repository metadata, not a code audit — read the skill file before letting an agent act on it.
Safety scan
No issues foundOur scan of the whole file found no instruction hijacking, hidden characters, credential access, data exfiltration or destructive commands. An AI review of the same text found nothing harmful.
AI review by kimi-k2.7-code on 2026-10-01. Automated pattern scan on 2026-10-01. It catches known dangerous patterns, not every risk — read a skill before letting an agent act on it.
scip-opt compared with similar skills
All 4 of these similar skills score higher than scip-opt; compare them before choosing.
| Skill | Score | Stars | Updated | Format |
|---|---|---|---|---|
| scip-opt (this skill)by benchflow-ai | 81 | 1.8k | 4mo ago | SKILL.md |
| taste-skillby Leonxlnx | 100 | 116.8k | 8d ago | CLAUDE.md |
| Agent-Reachby Panniantong | 100 | 112.3k | 9d ago | CLAUDE.md |
| headroomby headroomlabs-ai | 100 | 79.8k | today | CLAUDE.md |
| ai-job-searchby ai-job-search-dev | 100 | 72.1k | today | CLAUDE.md |
Frequently asked questions
- How do I install scip-opt?
- Run
npx skills add benchflow-ai/skillsbench --skill scip-opt. The install tabs above show the steps for each supported agent. - Which AI agents does scip-opt work with?
- It is written for Universal, as a SKILL.md file. Other agents that read the same format can often use it too.
- Is scip-opt safe to use?
- Our scan of the whole file found no instruction hijacking, hidden characters, credential access, data exfiltration or destructive commands. An AI review of the same text found nothing harmful. It is Apache-2.0-licensed and scores 98/100 on trust signals. Skills are instructions an agent will follow, so read the file before installing it and do not approve commands you do not understand.
- Is scip-opt still maintained?
- The repository was last updated about 4 months ago. That is recent enough to be usable, but agent tooling moves fast, so check the instructions against your agent's current version.
Skill content
View source on GitHubname: scip-opt description: SCIP optimization with PySCIPOpt. Use when facing an optimization problem with an objective, hard constraints, soft penalties, integer decisions, routing, assignment, scheduling, allocation, packing, capacity, inventory, or service-level rules. Prefer modeling and solving the problem with PySCIPOpt when it is available.
SCIP Optimization
Use SCIP through pyscipopt when a task asks you to minimize or maximize an objective subject to constraints.
SCIP is a strong open-source optimization solver with a Python API. It is well suited for mixed-integer optimization, routing-style models, assignment models, capacity planning, inventory movement, scheduling, and problems with soft penalties. For benchmark tasks, a SCIP-backed model plus an independent validator is usually safer than a greedy construction.
When To Use
Consider PySCIPOpt when the request includes:
- an objective such as minimizing cost, distance, time, unmet demand, or penalty;
- yes/no choices, route arcs, assignments, selected items, or ordering decisions;
- integer or continuous quantities such as load, inventory, flow, served units, or slack;
- hard rules that every valid answer must satisfy;
- soft rules that can be violated with an explicit penalty.
Do not start by installing another optimization package. First check whether PySCIPOpt is already available:
try:
from pyscipopt import Model, quicksum
except ImportError as exc:
raise RuntimeError("PySCIPOpt is required for this optimization approach") from exc
Modeling Workflow
-
Identify sets and indices.
- Examples: vehicles
K, stationsN, jobsJ, periodsT, arcsA. - Build explicit mappings when input IDs are not contiguous.
- Examples: vehicles
-
Define decision variables.
- Binary variables for choices, visits, assignments, route arcs, or modes.
- Integer variables for counts, loads, inventory moves, or unmet units.
- Continuous variables for flows, costs, times, slacks, or resource levels.
-
Add hard constraints.
- Conservation, capacity, bounds, linking, continuity, inventory limits, and mutual exclusion.
-
Add soft constraints with explicit slack variables.
- Never use Python
abs()on solver expressions. - Linearize absolute deviation with two inequalities.
- Never use Python
-
Set a single objective.
- Keep named objective components such as travel cost and penalty cost.
-
Solve with time and gap limits.
- Require at least one incumbent before extracting a solution.
-
Reconstruct and independently validate the output.
- Recompute objective components and every hard rule from the reported answer.
Minimal PySCIPOpt Template
from pyscipopt import Model, quicksum
model = Model("optimization_model")
model.hideOutput()
I = range(n_items)
x = {i: model.addVar(vtype="B", name=f"x_{i}") for i in I}
amount = {
i: model.addVar(vtype="I", lb=0, ub=capacity[i], name=f"amount_{i}")
for i in I
}
dev = {i: model.addVar(lb=0, name=f"dev_{i}") for i in I}
for i in I:
model.addCons(amount[i] <= capacity[i] * x[i])
model.addCons(amount[i] - target[i] <= dev[i])
model.addCons(target[i] - amount[i] <= dev[i])
cost = quicksum(fixed_cost[i] * x[i] for i in I)
penalty = penalty_weight * quicksum(dev[i] for i in I)
model.setObjective(cost + penalty, "minimize")
model.setParam("limits/time", 300.0)
model.setParam("limits/gap", 0.01)
model.optimize()
status = str(model.getStatus()).lower()
if model.getNSols() == 0:
raise RuntimeError(f"SCIP found no feasible solution; status={status}")
objective = float(model.getObjVal())
selected = [i for i in I if model.getVal(x[i]) > 0.5]
Common Patterns
Binary Activation
Use a binary variable to allow a quantity only when an option is active.
use = {i: model.addVar(vtype="B", name=f"use_{i}") for i in I}
q = {i: model.addVar(lb=0, ub=upper[i], name=f"q_{i}") for i in I}
for i in I:
model.addCons(q[i] <= upper[i] * use[i])
Assignment
assign = {
(i, j): model.addVar(vtype="B", name=f"assign_{i}_{j}")
for i in items
for j in options
}
for i in items:
model.addCons(quicksum(assign[i, j] for j in options) == 1)
for j in options:
model.addCons(quicksum(weight[i] * assign[i, j] for i in items) <= capacity[j])
Absolute Deviation Penalty
dev = {i: model.addVar(lb=0, name=f"dev_{i}") for i in I}
for i in I:
model.addCons(actual[i] - target[i] <= dev[i])
model.addCons(target[i] - actual[i] <= dev[i])
penalty_cost = penalty_weight * quicksum(dev[i] for i in I)
Route Arcs
START = "depot_start"
END = "depot_end"
nodes_from = [START, *locations]
nodes_to = [*locations, END]
arcs = [
(i, j)
for i in nodes_from
for j in nodes_to
if i != j and not (i == START and j == END)
]
x = {
(k, i, j): model.addVar(vtype="B", name=f"x_{k}_{i}_{j}")
for k in vehicles
for i, j in arcs
}
for k in vehicles:
model.addCons(quicksum(x[k, START, j] for j in locations) == 1)
model.addCons(quicksum(x[k, i, END] for i in locations) == 1)
for i in locations:
incoming = quicksum(x[k, j, i] for j in nodes_from if (j, i) in arcs)
outgoing = quicksum(x[k, i, j] for j in nodes_to if (i, j) in arcs)
model.addCons(incoming == outgoing)
model.addCons(outgoing <= 1)
Degree and continuity constraints alone can permit disconnected cycles. Add subtour elimination for routing models.
MTZ Subtour Elimination
order = {
(k, i): model.addVar(lb=1, ub=max(1, len(locations)), name=f"order_{k}_{i}")
for k in vehicles
for i in locations
}
n = len(locations)
for k in vehicles:
for i in locations:
for j in locations:
if i != j:
model.addCons(order[k, i] - order[k, j] + n * x[k, i, j] <= n - 1)
Reproducibility
Fix SCIP randomization and thread settings when repeatability matters.
def set_if_available(model, name, value):
try:
model.setParam(name, value)
except Exception:
pass
for name in [
"randomization/randomseedshift",
"randomization/permutationseed",
"randomization/lpseed",
]:
set_if_available(model, name, 0)
for name in ["randomization/permutevars", "randomization/permuteconss"]:
set_if_available(model, name, False)
set_if_available(model, "parallel/maxnthreads", 1)
Extraction And Validation
After solving, reconstruct the answer from variable values and validate it outside SCIP.
def is_selected(var):
return model.getVal(var) > 0.5
selected_arcs = [(i, j) for i, j in arcs if is_selected(x[vehicle, i, j])]
reported_cost = sum(distance[i, j] for i, j in selected_arcs)
if abs(reported_cost - expected_cost) > 1e-6:
raise AssertionError("reported objective component does not match reconstruction")
Treat SCIP feasibility as necessary but not sufficient. The final reported file still needs independent checks for schema, route reconstruction, capacity, inventory, penalties, and objective arithmetic.
Related Skills
taste-skill
116.8kAgent skills that give coding agents taste: art direction, reference images and a browser check instead of generic AI pages
Agent-Reach
112.3kGive your AI agent eyes to see the entire internet. Read & search Twitter, Reddit, YouTube, GitHub, Bilibili, XiaoHongShu — one CLI, zero API fees.
headroom
79.8kCompress tool outputs, logs, files, and RAG chunks before they reach the LLM. 20% fewer tokens for coding agents, 60-95% fewer tokens for JSON, same answers. Library, proxy, MCP server.
ai-job-search
72.1kThe job search that runs on your machine. AI job application framework built on Claude Code: evaluate postings, tailor CVs, write cover letters, prep interviews. Fork it and own it.
Languages
Trust signals
From repository metadata: license, adoption, age and documentation. Not a code audit — see the Safety scan above for what the skill file itself contains.
