hajibabaie

hajibabaie/combinatorial-optimization-skills

Plugin Claude Code

Plugin marketplace listing 1 plugin: combinatorial-optimization.

hajibabaie/combinatorial-optimization-skills

Skill Claude CodeCodex

When the user wants to compare optimization algorithms with a sound empirical protocol — instance and seed design, time limits, best/mean/gap reporting, nonparametric hypothesis tests, effect sizes, and the plots that summarize them. Also use when the user mentions "compare algorithms," "statistical test," "Wilcoxon,"…

hajibabaie/combinatorial-optimization-skills

Skill Claude CodeCodex

When the user wants to design, implement, or tune ant colony optimization for combinatorial problems, including pheromone model design, visibility heuristics, and choosing among Ant System, Ant Colony System, and MAX-MIN Ant System. Also use when the user mentions "ant colony," "ACO," "pheromone," "MMAS," "ant colony…

hajibabaie/combinatorial-optimization-skills

Skill Claude CodeCodex

When the user wants to match agents to tasks at minimum cost - linear assignment via the Hungarian algorithm, LP duality, or linearsumassignment; generalized assignment (GAP) via MIP, Lagrangian relaxation, and local search; bottleneck (min-max) assignment. Also use when the user mentions "assignment problem,"…

hajibabaie/combinatorial-optimization-skills

Skill Claude CodeCodex

When the user wants to solve a structured MILP or two-stage stochastic program by Benders decomposition — splitting it into an integer master and LP subproblems, deriving optimality and feasibility cuts from subproblem duals, and implementing either the classic iterative loop or branch-and-Benders-cut with…

hajibabaie/combinatorial-optimization-skills

Skill Claude CodeCodex

When the user wants to design, implement, or tune a biased random-key genetic algorithm (BRKGA), where chromosomes are random-key vectors in [0,1), evolution uses elite/mutant partitioning with biased uniform crossover, and a decoder is the only problem-specific component. Also use when the user mentions "BRKGA,"…

hajibabaie/combinatorial-optimization-skills

Skill Claude CodeCodex

When the user wants to pack items into the fewest capacitated bins, compare FFD/BFD heuristics against the L1/L2 lower bounds, or build exact compact MIP and arc-flow models, plus variants with variable bin sizes and item conflicts. Also use when the user mentions "bin packing," "first fit decreasing," "minimize…

hajibabaie/combinatorial-optimization-skills

Skill Claude CodeCodex

When the user wants to implement a custom branch-and-bound algorithm — designing bounding functions, branching rules, node selection (depth-first vs best-first), dominance rules, and incumbent management — or to decide when custom B&B beats a MIP solver. Also use when the user mentions "custom branch and bound,"…

hajibabaie/combinatorial-optimization-skills

Skill Claude CodeCodex

When the user wants to solve linear or integer programs whose variable set is too large to enumerate, by iterating between a restricted master problem and a reduced-cost pricing problem, up to full branch-and-price. Also use when the user mentions "column generation," "pricing problem," "restricted master problem,"…

hajibabaie/combinatorial-optimization-skills

Skill Claude CodeCodex

When the user wants to handle constraints inside metaheuristics by choosing among penalty functions (static, dynamic, adaptive), repair operators, feasibility-preserving operators, decoder-based feasibility, stochastic ranking, and Deb's feasibility rules. Also use when the user mentions "constraint handling,"…

hajibabaie/combinatorial-optimization-skills

Skill Claude CodeCodex

When the user wants to model and solve combinatorial problems with constraint programming, especially OR-Tools CP-SAT: integer, boolean, and interval variables, AllDifferent, NoOverlap, Cumulative, channeling, and search strategies, plus CP-vs-MIP selection guidance. Also use when the user mentions "constraint…

hajibabaie/combinatorial-optimization-skills

Skill Claude CodeCodex

When the user wants to choose or implement a crossover operator for a genetic or evolutionary algorithm: one-point, two-point, uniform, arithmetic, blend (BLX-alpha), and SBX plus the permutation family OX, PMX, CX, ERX, AEX, and position-based, with preservation properties and operator-encoding fit tables. Also use…

hajibabaie/combinatorial-optimization-skills

Skill Claude CodeCodex

When the user wants to strengthen a MIP with cutting planes and valid inequalities — deriving cover, clique, MIR, or Gomory cuts, writing separation routines, and adding them as user cuts or lazy constraints via Gurobi callbacks. Also use when the user mentions "valid inequalities," "cutting planes," "separation…

hajibabaie/combinatorial-optimization-skills

Skill Claude CodeCodex

When the user wants to solve one-dimensional cutting stock problems — cutting demanded item widths from standard stock rolls at minimum roll usage or trim loss — with pattern-based (Gilmore-Gomory) or compact MIP models, column generation with knapsack pricing, and integer rounding. Also use when the user mentions…

hajibabaie/combinatorial-optimization-skills

Skill Claude CodeCodex

When the user wants to reformulate a structured LP or MIP via Dantzig-Wolfe decomposition — detect block-angular structure, build the master with convexity constraints, price columns from independent subproblems, and relate the DW bound to LP and Lagrangian bounds. Also use when the user mentions "Dantzig-Wolfe,"…

hajibabaie/combinatorial-optimization-skills

Skill Claude CodeCodex

When the user wants to design an indirect encoding where a decoder maps a simple genotype (random keys, priority vectors, rule choices) to a feasible solution, including serial/parallel schedule-generation schemes and feasibility-enforcing decoders. Also use when the user mentions "decoder," "random keys," "indirect…

hajibabaie/combinatorial-optimization-skills

Skill Claude CodeCodex

When the user wants to solve continuous or mixed black-box optimization problems with differential evolution, choose among DE strategies (rand/1/bin, best/1/bin, current-to-best), tune F and CR, or adapt DE to permutation problems through random keys. Also use when the user mentions "differential evolution,"…

hajibabaie/combinatorial-optimization-skills

Skill Claude CodeCodex

When the user wants to diagnose or prevent premature convergence in population-based metaheuristics by measuring and managing diversity: entropy and distance-based diversity measures, fitness sharing, crowding, niching, duplicate elimination, restart policies, and adaptive parameter control driven by diversity…

hajibabaie/combinatorial-optimization-skills

Skill Claude CodeCodex

When the user wants to design and implement dynamic programming for combinatorial optimization — state-space design, Bellman recursions, memoization vs tabulation, solution recovery, and labeling algorithms for resource-constrained shortest paths. Also use when the user mentions "dynamic programming," "Bellman…

hajibabaie/combinatorial-optimization-skills

Skill Claude CodeCodex

When the user wants to design or implement an estimation of distribution algorithm — UMDA, PBIL, compact GA, tree models, BOA, or permutation EDAs with position-frequency, edge-histogram, or Mallows models — building and sampling probabilistic models over good solutions instead of using crossover. Also use when the…

hajibabaie/combinatorial-optimization-skills

Skill Claude CodeCodex

When the user wants to design or implement an evolution strategy — (mu+lambda) or (mu,lambda) selection, self-adaptive step sizes, or CMA-ES — for continuous, integer, or mixed-integer search, including tuning another algorithm's parameters. Also use when the user mentions "evolution strategy," "CMA-ES,"…

hajibabaie/combinatorial-optimization-skills

Skill Claude CodeCodex

When the user wants to choose facility sites and assign customers to them — UFLP, CFLP, p-median, or p-center — with strong MIP formulations, Benders or Lagrangian solution paths, and greedy, interchange, or VNS heuristics. Also use when the user mentions "facility location," "p-median," "p-center," "open facilities,"…

hajibabaie/combinatorial-optimization-skills

Skill Claude CodeCodex

When the user wants to speed up objective evaluation in a metaheuristic or local search — profiling, delta/incremental evaluation, memoization with solution hashing, surrogate, vectorized batch, and parallel evaluation. Also use when the user mentions "fitness evaluation," "delta evaluation," "incremental evaluation,"…

hajibabaie/combinatorial-optimization-skills

Skill Claude CodeCodex

When the user wants to analyze a fitness landscape before or while designing a search algorithm — measuring ruggedness with random-walk autocorrelation and correlation length, fitness-distance correlation, plateaus and neutrality, and sampled local optima networks — and to use those measurements to choose operators…