OpenSkillIndex← back to search
claude-codescience

Babysitter mixed-integer-optimization

Mixed-integer linear and nonlinear programming

install
source · Clone the upstream repo
git clone https://github.com/a5c-ai/babysitter
Claude Code · Install into ~/.claude/skills/
T=$(mktemp -d) && git clone --depth=1 https://github.com/a5c-ai/babysitter "$T" && mkdir -p ~/.claude/skills && cp -r "$T/library/specializations/domains/science/mathematics/skills/mixed-integer-optimization" ~/.claude/skills/a5c-ai-babysitter-mixed-integer-optimization && rm -rf "$T"
manifest: library/specializations/domains/science/mathematics/skills/mixed-integer-optimization/SKILL.md
tags
#math-optimization#mip-solver#branch-bound#constraint-programming#linear-optimization
source content

Mixed-Integer Optimization

Purpose

Provides capabilities for formulating and solving mixed-integer linear and nonlinear programming problems.

Capabilities

  • Branch and bound/cut algorithms
  • MIP formulation techniques
  • Indicator constraints
  • Big-M reformulations
  • Lazy constraints
  • Solution pool generation

Usage Guidelines

  1. Formulation: Use tight formulations with valid inequalities
  2. Big-M Selection: Choose appropriate Big-M values
  3. Branching: Configure branching priorities
  4. Solution Pool: Generate diverse feasible solutions

Tools/Libraries

  • Gurobi
  • CPLEX
  • SCIP
  • CBC